{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05211361,0.000020338215,0.9383733,0.000952777,0.0026370676,0.00038788625,0.000013478574,0.00025310396,0.0052483864],"genre_scores_gemma":[0.9896594,0.000022098046,0.008473966,0.00060545903,0.0008058987,0.0000696447,0.000054194614,0.000013369367,0.000295934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815744,0.000053476946,0.00046605707,0.000564086,0.00038622034,0.00037269515],"domain_scores_gemma":[0.99851227,0.00010336099,0.00019664686,0.00037044944,0.00066012616,0.00015712433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000756685,0.00021137236,0.00016804664,0.0003208972,0.0001681776,0.0005252429,0.0008562302,0.000120191165,0.00016526894],"category_scores_gemma":[0.00019366053,0.00019951921,0.000099842626,0.00025568483,0.00006650866,0.0010943242,0.00007505472,0.00018977118,0.00031138334],"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.00007336311,0.0002265867,0.00005449661,0.000005064205,0.000012134537,0.000012046744,0.0024909182,0.000024048595,0.038729087,0.5656414,0.000049665025,0.39268118],"study_design_scores_gemma":[0.00014786219,0.0009610161,0.0036925043,0.00013734386,0.000011300495,0.000032830834,0.0015895728,0.48182437,0.40457276,0.103855774,0.002519381,0.0006552726],"about_ca_topic_score_codex":0.00014075887,"about_ca_topic_score_gemma":0.0005579299,"teacher_disagreement_score":0.93754584,"about_ca_system_score_codex":0.0001613611,"about_ca_system_score_gemma":0.00006410913,"threshold_uncertainty_score":0.81361574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3602297,0.041334223,0.112638,0.00046802798,0.010707791,0.0010460695,0.00002601861,0.0015684325,0.47198173],"genre_scores_gemma":[0.9402812,0.0006514216,0.0020122502,0.0000717865,0.00027786617,0.00002079678,0.00044885065,0.000029093653,0.056206703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975862,0.00012081602,0.00035919462,0.0007758482,0.00071141345,0.00044653096],"domain_scores_gemma":[0.9984064,0.000100761616,0.0003697738,0.00044210436,0.0003704117,0.00031056686],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00012057636,0.00041673228,0.00040628292,0.00033705973,0.005400167,0.000110119494,0.00093572924,0.00046817446,0.0000104299725],"category_scores_gemma":[0.000046330366,0.00044605363,0.0003122994,0.0004806387,0.00011630175,0.0005253215,0.00020036931,0.0004601674,0.00019893279],"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.00051257154,0.0008123588,0.0033967404,0.00027846155,0.0005388397,0.012146762,0.100429095,0.0028808436,0.003739413,0.8262394,0.02135836,0.027667126],"study_design_scores_gemma":[0.007957052,0.0013208551,0.21582958,0.0007207193,0.000896263,0.017525766,0.03027856,0.28896463,0.018186135,0.03879336,0.37182873,0.0076983664],"about_ca_topic_score_codex":0.0065139025,"about_ca_topic_score_gemma":0.0014728097,"teacher_disagreement_score":0.7874461,"about_ca_system_score_codex":0.003342764,"about_ca_system_score_gemma":0.0019796928,"threshold_uncertainty_score":0.99979913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051799375,0.0002078056,0.9904992,0.00070351607,0.0018077024,0.00048472988,0.000007941533,0.00027789068,0.0008312781],"genre_scores_gemma":[0.7998607,0.000017200944,0.19955984,0.00021850716,0.00012601043,0.00004150665,0.000024288198,0.000012859496,0.00013905573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819946,0.00008365115,0.00048616197,0.0005427152,0.00029790524,0.00039012628],"domain_scores_gemma":[0.9979217,0.0012198132,0.00013056178,0.0003742701,0.00024636943,0.00010728081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088948716,0.00020091384,0.00023675844,0.0004702429,0.0003213201,0.00013022017,0.0006201915,0.00013631207,0.000006733855],"category_scores_gemma":[0.00007343403,0.00019814933,0.00013205195,0.00080118445,0.00004993414,0.0003662367,0.000012762722,0.00024703046,0.00004463257],"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.00007659275,0.00035767656,0.00017166405,0.00004461525,0.00003799565,0.000015678477,0.0004740116,0.8420505,0.00008428688,0.0990695,0.00018615005,0.057431366],"study_design_scores_gemma":[0.0018258237,0.00044272793,0.00958161,0.00010510819,0.000017877142,0.00012796874,0.00020787341,0.87532306,0.00017019908,0.10799405,0.0036957045,0.0005080156],"about_ca_topic_score_codex":0.000045127374,"about_ca_topic_score_gemma":0.000044603305,"teacher_disagreement_score":0.7946808,"about_ca_system_score_codex":0.00021112057,"about_ca_system_score_gemma":0.00007955648,"threshold_uncertainty_score":0.8080295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48645973,0.00016062497,0.50657725,0.00044623943,0.00013833903,0.00074940285,0.000014133286,0.000107479194,0.0053467853],"genre_scores_gemma":[0.98945576,0.000035963054,0.010209546,0.000004604937,0.0000386036,6.8639895e-7,0.000058224356,0.0000042549323,0.00019236501],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798286,0.0001814746,0.00021109603,0.00030191636,0.000938123,0.0003845137],"domain_scores_gemma":[0.9974636,0.00016179915,0.0002522107,0.0005724077,0.0014341961,0.000115809424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026976643,0.00011630429,0.00019457655,0.0005938009,0.00037942713,0.00004497669,0.0008074359,0.000074725394,0.000015848105],"category_scores_gemma":[0.00030707289,0.000100424375,0.00004783989,0.0012959156,0.000540774,0.0021252027,0.00043784533,0.00026989653,0.000039795872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016739039,0.0008722119,0.014031159,0.00090910186,0.00017381902,0.00007156033,0.07866132,0.00020230943,0.0296646,0.15360965,0.0041592373,0.7159711],"study_design_scores_gemma":[0.007654104,0.007756438,0.40049115,0.0009638025,0.000082757695,0.00019453943,0.025950255,0.009508067,0.4025487,0.016576227,0.12654142,0.0017325368],"about_ca_topic_score_codex":0.0006602065,"about_ca_topic_score_gemma":0.00034759083,"teacher_disagreement_score":0.7142386,"about_ca_system_score_codex":0.00016773105,"about_ca_system_score_gemma":0.00028469047,"threshold_uncertainty_score":0.40951872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06767481,0.0029769044,0.9057264,0.009046574,0.003333159,0.00049211713,0.0000012852471,0.000095851705,0.010652942],"genre_scores_gemma":[0.9895321,0.00014727653,0.008465333,0.00004249609,0.0012821811,0.000009854782,3.2245597e-7,0.000010876627,0.0005095203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972137,0.00032040584,0.00041084836,0.00022453713,0.0013544476,0.00047605985],"domain_scores_gemma":[0.99640644,0.00025799492,0.00021348213,0.00031994397,0.002431903,0.00037025503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004001107,0.00011940101,0.0002202299,0.00045997644,0.0002255309,0.00029062422,0.001067275,0.000082255094,0.000025196245],"category_scores_gemma":[0.00074977655,0.00008266888,0.00006964378,0.0011257549,0.00024467372,0.0010951469,0.00017091782,0.0006451375,0.00012577561],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005029625,0.0005634705,0.00097291375,0.000038648763,0.000055648354,0.000453918,0.029943591,0.00031284388,0.0013446644,0.23573694,0.005867266,0.72420716],"study_design_scores_gemma":[0.0005513579,0.019851739,0.00096725515,0.0005841459,0.000050608258,0.0017029728,0.035193086,0.062250018,0.17334615,0.45210344,0.2519819,0.0014173168],"about_ca_topic_score_codex":0.00020636775,"about_ca_topic_score_gemma":0.0002657807,"teacher_disagreement_score":0.92185736,"about_ca_system_score_codex":0.00046271528,"about_ca_system_score_gemma":0.00074185623,"threshold_uncertainty_score":0.3371139},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004082895,0.0000450691,0.91888463,0.004769594,0.0012886424,0.00036712884,0.000014965165,0.00045252798,0.07009455],"genre_scores_gemma":[0.9870409,0.000029661376,0.010862775,0.0007687085,0.0008560142,0.00012363742,0.000030824634,0.000014160272,0.0002733569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757415,0.00011540471,0.0005995079,0.00071688835,0.0006091108,0.00038492735],"domain_scores_gemma":[0.99856496,0.00005593513,0.00018421233,0.00044047652,0.00059074396,0.00016366321],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041865025,0.0002868521,0.00025870095,0.00030860858,0.00017484407,0.00057204167,0.001184152,0.00013218672,0.00018439279],"category_scores_gemma":[0.00006593342,0.00026077149,0.0001423255,0.00036761316,0.00009492396,0.0008323531,0.00013183363,0.0002976306,0.0015784883],"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.000025753858,0.00027199718,0.0000063662974,0.00001242889,0.00002244134,0.000014444734,0.0029624328,0.00045497337,0.0011380267,0.8207507,0.000094849485,0.17424555],"study_design_scores_gemma":[0.00007473996,0.00015860687,0.00014973906,0.00017281724,0.000007640177,0.00007117652,0.00048692033,0.96566033,0.021429304,0.009531489,0.0018590022,0.000398212],"about_ca_topic_score_codex":0.00006959348,"about_ca_topic_score_gemma":0.000041051808,"teacher_disagreement_score":0.98295796,"about_ca_system_score_codex":0.000247274,"about_ca_system_score_gemma":0.00009760571,"threshold_uncertainty_score":0.99998444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2544359,0.0015881679,0.7349287,0.0018007578,0.0005996088,0.0027573775,0.000037392536,0.00036586646,0.003486187],"genre_scores_gemma":[0.98900807,0.00016672356,0.0077361255,0.0000056305435,0.0001390361,0.000009524899,0.000038007656,0.00001542119,0.0028814892],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997159,0.00037288832,0.00016496716,0.0008204757,0.0007640425,0.0007185936],"domain_scores_gemma":[0.99720246,0.00050920306,0.00012954767,0.00091378647,0.0010487108,0.00019629575],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00181193,0.00020405087,0.00032065346,0.00040616028,0.0014223799,0.000052918727,0.0014341825,0.00011930619,0.000033815275],"category_scores_gemma":[0.00065173564,0.00018523766,0.00013627685,0.0011361686,0.0010853254,0.001011038,0.0007552647,0.0004024794,0.000087924185],"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.0030912645,0.0031052453,0.03489887,0.0030660762,0.0006092606,0.00062362273,0.053178046,0.0013475844,0.0076184976,0.103506245,0.11842205,0.67053324],"study_design_scores_gemma":[0.012169214,0.012861309,0.08025966,0.000890341,0.00011508437,0.00043509164,0.005724524,0.04419102,0.09816315,0.015210544,0.72725296,0.002727075],"about_ca_topic_score_codex":0.0003849615,"about_ca_topic_score_gemma":0.0002023384,"teacher_disagreement_score":0.7345722,"about_ca_system_score_codex":0.00024212697,"about_ca_system_score_gemma":0.0004115712,"threshold_uncertainty_score":0.99987763},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014416011,0.0001759918,0.9224208,0.0075724316,0.00023956926,0.0008284853,0.0000024374149,0.00013576627,0.06718291],"genre_scores_gemma":[0.99535,0.00026218212,0.0019547732,0.00073879486,0.00017619338,0.000056546018,0.0000037449197,0.000010812951,0.0014469512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835247,0.0003876188,0.00033610314,0.00045339225,0.0002026737,0.0002677622],"domain_scores_gemma":[0.9985082,0.0005774107,0.00012037815,0.0005613485,0.00016982527,0.000062820705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015718134,0.00016786366,0.00013506477,0.00003542661,0.00069053296,0.00060137175,0.0010599456,0.00003305072,0.00011458418],"category_scores_gemma":[0.00022162698,0.00009049514,0.00006302452,0.00024226075,0.0003784217,0.00018903984,0.00009209384,0.00017258851,0.0007768585],"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.00003497969,0.000023054701,0.0000010693506,0.0000023289208,0.000003993708,7.6279736e-7,0.0016561461,0.00017375803,0.00010535871,0.5704752,0.000101789694,0.42742154],"study_design_scores_gemma":[0.00017111907,0.00024439662,0.00043278217,0.000035486777,0.000023291133,0.000010902901,0.0004025113,0.74573827,0.0027496098,0.23588835,0.014001296,0.00030199636],"about_ca_topic_score_codex":0.000029795941,"about_ca_topic_score_gemma":0.000042887797,"teacher_disagreement_score":0.9939084,"about_ca_system_score_codex":0.000019018513,"about_ca_system_score_gemma":0.000051268547,"threshold_uncertainty_score":0.9985203},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6237581,0.000115654526,0.112776905,0.0008374809,0.0025224744,0.0009686736,0.0000056105896,0.0003137219,0.25870144],"genre_scores_gemma":[0.99629694,0.000016282793,0.0033505277,0.00007562248,0.00004671849,0.00001880985,2.490767e-7,0.000010720165,0.00018413986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981526,0.000023690565,0.00051514915,0.000519583,0.00034956558,0.00043938792],"domain_scores_gemma":[0.9989233,0.00008793641,0.00031145607,0.0002994208,0.00028500945,0.000092854636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000526774,0.00023255877,0.00028190555,0.00019064339,0.0001497758,0.00012382847,0.0022930545,0.00011165749,0.00006563431],"category_scores_gemma":[0.0004747565,0.0001756367,0.000108856744,0.0006834772,0.0002539927,0.00039405146,0.00045406923,0.0003586063,0.00011600995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008501503,0.00019825116,0.0016894932,0.000025510679,0.000009690731,0.0000043813466,0.008422981,0.000020702793,0.0042457874,0.96998227,0.00004181359,0.01527409],"study_design_scores_gemma":[0.0001251768,0.00044789896,0.0065593566,0.00048948696,0.00001883829,0.000015776674,0.0014373244,0.1270807,0.122486785,0.74070555,0.00008777269,0.0005453275],"about_ca_topic_score_codex":0.00008750342,"about_ca_topic_score_gemma":0.00004054823,"teacher_disagreement_score":0.37253886,"about_ca_system_score_codex":0.000073143914,"about_ca_system_score_gemma":0.00011736033,"threshold_uncertainty_score":0.7162257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044954512,0.000042548185,0.87233007,0.00018962292,0.0001332898,0.0006763645,0.0000013240298,0.00031721286,0.08135503],"genre_scores_gemma":[0.8382951,0.000004649931,0.16101767,0.00024679775,0.000062083454,0.00004131187,0.000013735968,0.0000073826195,0.00031126916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987774,0.00001268387,0.0002696502,0.00029437747,0.00019571517,0.00045021172],"domain_scores_gemma":[0.9993293,0.00006884738,0.00008755225,0.00024075019,0.00013674612,0.00013676906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006040046,0.00016751821,0.00017340411,0.00007599038,0.00014087024,0.00017216828,0.00039904864,0.00008532258,0.000044857057],"category_scores_gemma":[0.0000145859085,0.00010940723,0.000089339024,0.0002279977,0.00010012933,0.00045225243,0.000019810414,0.00008486383,0.00003900471],"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.00005107207,0.00018830872,0.00035170137,0.00003784036,0.000028232973,0.000014393341,0.0015420076,0.000013797125,0.00044979036,0.68404305,0.00016493192,0.31311485],"study_design_scores_gemma":[0.064204514,0.014585859,0.0878307,0.0006508908,0.00038238417,0.0038455124,0.0037891488,0.17703466,0.14496976,0.22809346,0.264815,0.009798123],"about_ca_topic_score_codex":0.000019244155,"about_ca_topic_score_gemma":0.000120957404,"teacher_disagreement_score":0.79334056,"about_ca_system_score_codex":0.000032474094,"about_ca_system_score_gemma":0.00008117427,"threshold_uncertainty_score":0.44614974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07109137,0.002658473,0.7084805,0.0006975863,0.00044351924,0.00092618144,0.0000041419025,0.00073141896,0.2149668],"genre_scores_gemma":[0.97677296,0.000030684358,0.012829216,0.00006268706,0.000079831734,0.000111783214,0.000003163632,0.00002673786,0.010082911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797696,0.00009183022,0.00033028523,0.0006726669,0.00030833262,0.00061992917],"domain_scores_gemma":[0.9986002,0.00017026743,0.00012881005,0.0006966092,0.00022037869,0.00018374962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038826116,0.0003104572,0.0004017997,0.00023153047,0.0003074705,0.00034603232,0.0007307431,0.00010160546,0.000057560224],"category_scores_gemma":[0.000024365152,0.0002123818,0.000050855942,0.0008469019,0.0000701143,0.0010474782,0.00015793464,0.00032427438,0.00024715735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00046328912,0.0051042982,0.060995277,0.0005879353,0.00091868726,0.00045040678,0.031207656,0.08283405,0.00059261447,0.6791522,0.0048614643,0.13283214],"study_design_scores_gemma":[0.003470791,0.00056837715,0.01480364,0.00049483863,0.00004079254,0.000592333,0.0018042153,0.8914796,0.00013243535,0.0000802836,0.08550603,0.0010266243],"about_ca_topic_score_codex":0.0011340248,"about_ca_topic_score_gemma":0.04985492,"teacher_disagreement_score":0.9056816,"about_ca_system_score_codex":0.00036241984,"about_ca_system_score_gemma":0.00024956482,"threshold_uncertainty_score":0.96748275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004446964,0.0015900951,0.9918196,0.0003216452,0.00070404535,0.00039758426,0.000002799898,0.00008634599,0.0006309289],"genre_scores_gemma":[0.93583846,0.00064323476,0.06261108,0.000611875,0.00017530446,0.000020654752,0.000007229432,0.00001812721,0.000074008465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973995,0.00008063237,0.00050258514,0.0011564287,0.00038935908,0.00047151462],"domain_scores_gemma":[0.99792796,0.0007345853,0.0002926032,0.0007013979,0.00024114818,0.00010229086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012846689,0.00039979393,0.00045779545,0.0006780904,0.00017831875,0.00038259398,0.0009358023,0.00016937948,0.000008418461],"category_scores_gemma":[0.00013673671,0.00033523678,0.000049494007,0.00042644338,0.0008019177,0.000370857,0.00076839986,0.0004034411,0.000014351944],"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.000006784168,0.000018556806,0.0005977491,0.00016631294,0.00001652125,0.000480212,0.01374618,0.0036158187,0.00004294984,0.22206153,0.000020508363,0.75922686],"study_design_scores_gemma":[0.00066571595,0.00040775817,0.00059460686,0.00035326267,0.000016301412,0.0007922219,0.000013503177,0.26722038,0.00045094168,0.7275726,0.0010769083,0.0008358145],"about_ca_topic_score_codex":0.000035276033,"about_ca_topic_score_gemma":0.00048928556,"teacher_disagreement_score":0.93139154,"about_ca_system_score_codex":0.00023266155,"about_ca_system_score_gemma":0.00016577211,"threshold_uncertainty_score":0.99990994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61788434,0.007575998,0.0015294274,0.0015490621,0.0025003396,0.0025998994,0.00008646187,0.00007432247,0.36620012],"genre_scores_gemma":[0.99391377,0.00012099179,0.00094575563,0.00009611852,0.00006112503,0.000013203084,0.0000032190287,0.000012176746,0.0048336238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978716,0.00007802674,0.0006641657,0.0004811714,0.00056638353,0.00033864655],"domain_scores_gemma":[0.9980381,0.00024977044,0.00035867555,0.0010648016,0.00019934907,0.000089286244],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017341309,0.00027165716,0.0004125893,0.00025314282,0.00028097077,0.00009251141,0.0027315493,0.000108086904,0.000014399501],"category_scores_gemma":[0.000024861794,0.00017767369,0.000065900655,0.00023277923,0.0041072406,0.0013892056,0.0009477837,0.00035683665,0.0000020096045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00003719517,0.000088418456,0.023669802,0.00004867932,0.000017020242,0.0000029748053,0.01572639,0.00002837314,0.0003096063,0.9512823,0.0000032267894,0.008785995],"study_design_scores_gemma":[0.0010241234,0.0013393235,0.18992046,0.00081059185,0.00006276425,0.000068680216,0.00039843773,0.00039717316,0.0012955084,0.79557467,0.008172039,0.00093624915],"about_ca_topic_score_codex":0.0046050823,"about_ca_topic_score_gemma":0.2507711,"teacher_disagreement_score":0.37602943,"about_ca_system_score_codex":0.00013807576,"about_ca_system_score_gemma":0.000535315,"threshold_uncertainty_score":0.998603},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09339158,0.00035661,0.4787378,0.00008560457,0.00026560557,0.00013954465,0.0000019223119,0.00019768237,0.42682365],"genre_scores_gemma":[0.96173596,0.000008077269,0.037230413,0.00011418597,0.000020327423,0.000001427188,0.0000012414736,0.000003265072,0.0008850737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939734,0.000031510015,0.00015042216,0.00018131072,0.00009374903,0.00014565092],"domain_scores_gemma":[0.9993963,0.000019411214,0.00006114625,0.0003813625,0.000065549524,0.000076199394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002038968,0.00006935002,0.00011472183,0.000031689324,0.000043166943,0.000027352395,0.00045743294,0.000033340344,0.000076269855],"category_scores_gemma":[0.000021375317,0.000050872302,0.000043287804,0.00011334648,0.000028998598,0.00034897594,0.00015026871,0.00003831653,0.000037073252],"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.000010920787,0.00031089978,0.011294075,0.00007472746,0.000040220257,0.000012001126,0.013423569,0.000001210273,0.0040540406,0.81058246,0.015917053,0.14427881],"study_design_scores_gemma":[0.003538392,0.003994555,0.036049962,0.00036570078,0.00010203157,0.00022096887,0.0015366034,0.12314046,0.5576915,0.13116907,0.13949196,0.0026987914],"about_ca_topic_score_codex":0.00009323878,"about_ca_topic_score_gemma":0.000022365733,"teacher_disagreement_score":0.8683444,"about_ca_system_score_codex":0.00001130506,"about_ca_system_score_gemma":0.000026416335,"threshold_uncertainty_score":0.20745122},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032251373,0.00050146814,0.71804875,0.0016723702,0.0032647063,0.00028027696,0.0000014365964,0.0010133769,0.24296623],"genre_scores_gemma":[0.97291374,0.00011670793,0.0030028294,0.0006956929,0.00049330044,0.000039343984,0.000002596215,0.000006295789,0.022729509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992284,0.000029312878,0.000113264185,0.0002620487,0.00013933978,0.0002276296],"domain_scores_gemma":[0.9993693,0.0000495111,0.00004226323,0.000344486,0.00009403738,0.000100401274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008946806,0.00009751052,0.000101272686,0.00007108213,0.0003121568,0.00005150011,0.00027072497,0.000066736,0.00014266976],"category_scores_gemma":[0.000029759738,0.00007835591,0.00005936512,0.00026620206,0.00003893749,0.00062789425,0.000080444464,0.0001132994,0.0012730892],"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.000031206204,0.0011954005,0.026942521,0.00002077127,0.00011375247,0.00018680141,0.007633639,0.000020252059,0.0026963803,0.42836526,0.35740566,0.17538837],"study_design_scores_gemma":[0.0014507417,0.00047527198,0.20159258,0.000015171423,0.000023469976,0.0005525803,0.00013104307,0.018862002,0.002731559,0.0024672458,0.7709844,0.00071391114],"about_ca_topic_score_codex":0.00015548294,"about_ca_topic_score_gemma":0.0001315671,"teacher_disagreement_score":0.9406623,"about_ca_system_score_codex":0.000035282872,"about_ca_system_score_gemma":0.00003836305,"threshold_uncertainty_score":0.9995045},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000141775545,0.0007573501,0.057585474,0.000005038625,0.00034533683,0.00020342422,0.00004523995,0.00015972779,0.94088423],"genre_scores_gemma":[0.011230242,0.00015037465,0.0010508279,0.000022708984,0.00012564294,3.1994603e-7,0.000008900417,0.000024506802,0.98738647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986596,0.000035958205,0.00019411645,0.000478794,0.00028953055,0.00034201908],"domain_scores_gemma":[0.9982114,0.00006415412,0.00030294457,0.0009760896,0.00023092452,0.00021449845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001324922,0.0003308566,0.00045552684,0.00018353791,0.00011604763,0.000035813995,0.0016253592,0.00036804887,0.0000038512535],"category_scores_gemma":[0.000004770855,0.00035905538,0.00028205887,0.000011670399,0.00019880988,0.00032000986,0.0011285469,0.0003370956,0.000028278306],"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.000011732502,0.000013805007,9.628868e-7,0.00005992808,0.00007222172,0.000047715457,0.00021198278,0.0000058869655,0.000022551698,0.98815966,0.007765339,0.0036282],"study_design_scores_gemma":[0.0004622269,0.000061945764,0.000007273423,0.00013298675,0.00013251869,0.000021517257,0.000010877418,0.0025642614,0.00076777535,0.0007424854,0.9945192,0.00057697174],"about_ca_topic_score_codex":0.00005839087,"about_ca_topic_score_gemma":0.000001186313,"teacher_disagreement_score":0.98741716,"about_ca_system_score_codex":0.00011262786,"about_ca_system_score_gemma":0.0001335597,"threshold_uncertainty_score":0.99988616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026328482,0.00024894916,0.92943174,0.0003026362,0.0002221221,0.00006080044,9.057606e-8,0.00013435817,0.043270808],"genre_scores_gemma":[0.9194093,0.000029943123,0.0789329,0.00030417062,0.000101244244,2.2768387e-7,0.0000010318389,0.0000031746056,0.0012180224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993503,0.000016543032,0.00013246897,0.00020457759,0.00013013901,0.00016594504],"domain_scores_gemma":[0.9995581,0.00011234026,0.00003595807,0.00014424369,0.00006789034,0.000081459024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004075078,0.00007191823,0.00008694376,0.000049568647,0.000096804826,0.00009739075,0.00017781676,0.000041746793,0.000010439863],"category_scores_gemma":[0.00003503013,0.00005566027,0.00002081679,0.00017640357,0.000029843433,0.00019087268,0.00015506524,0.00005667517,0.0000892073],"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.000004115111,0.00006987072,0.0030190095,0.000026269554,0.000009057921,0.00003863137,0.0021419434,0.00001215056,0.00017638192,0.56485945,0.007530414,0.4221127],"study_design_scores_gemma":[0.0027510538,0.001106855,0.14504024,0.00017146055,0.000037003465,0.00054886116,0.0005682161,0.5968498,0.007330942,0.05401686,0.19002269,0.0015560243],"about_ca_topic_score_codex":0.0000058648584,"about_ca_topic_score_gemma":0.000011930559,"teacher_disagreement_score":0.8930808,"about_ca_system_score_codex":0.000010968299,"about_ca_system_score_gemma":0.000014309733,"threshold_uncertainty_score":0.22697599},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111813475,0.0005349207,0.9714443,0.00020537226,0.002231654,0.0004427442,0.0000134722795,0.00021726644,0.024798457],"genre_scores_gemma":[0.72294545,0.00043828698,0.2687811,0.0026944305,0.0019444439,0.000053768043,0.00026331333,0.0000949813,0.0027842447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601334,0.000030889136,0.0006646342,0.001241256,0.0013305271,0.0007193792],"domain_scores_gemma":[0.9963156,0.00016961597,0.00035210076,0.0026865944,0.000309025,0.00016704248],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015246754,0.00048553917,0.0005232159,0.0011645871,0.00024545615,0.00075648073,0.008117633,0.00034202938,0.000013105522],"category_scores_gemma":[0.00017894049,0.00043701907,0.00007431434,0.00080117123,0.00027136347,0.0030201823,0.005889491,0.00074238627,0.00020002271],"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.000010525604,0.000060121878,0.0011201671,0.0004958566,0.000021301355,0.00042028836,0.01763557,0.008741543,0.0000044794133,0.028213976,0.0014415772,0.94183457],"study_design_scores_gemma":[0.0004149818,0.00006579366,0.00088214735,0.0007848043,0.000004884359,0.00022098956,0.0000010686433,0.9736035,0.00003227542,0.0036553768,0.019659718,0.0006745003],"about_ca_topic_score_codex":0.00009926208,"about_ca_topic_score_gemma":0.00019224269,"teacher_disagreement_score":0.9648619,"about_ca_system_score_codex":0.00059995626,"about_ca_system_score_gemma":0.0004267546,"threshold_uncertainty_score":0.99980813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6752341,0.0014466489,0.074255265,0.011993063,0.00035022598,0.00066289224,0.000005951786,0.00017161414,0.23588026],"genre_scores_gemma":[0.9961194,0.000022260663,0.0025700186,0.0004357849,0.00003687548,0.000022264298,0.0000012284339,0.0000013494342,0.00079083414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9996362,0.000024649788,0.00008790218,0.00009826539,0.00006484419,0.00008814079],"domain_scores_gemma":[0.9996668,0.00009061945,0.000026755457,0.0001716933,0.000032485004,0.000011624605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011730008,0.000041141422,0.000059024555,0.000039509392,0.00006270687,0.000037324597,0.00023145773,0.000021959419,0.000007672478],"category_scores_gemma":[0.000011545078,0.000025964782,0.000016926899,0.00027157395,0.000028677823,0.00023818605,0.000051095005,0.000040948955,0.0000060372327],"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":[3.1536626e-7,0.00007563475,0.025843231,0.000003206475,0.0000013819177,6.514996e-7,0.0024287645,9.963361e-7,0.00018359462,0.9652394,0.0013613134,0.004861517],"study_design_scores_gemma":[0.0003471297,0.000066336506,0.94236606,0.000011744524,0.0000040151726,0.000007773786,0.0006156225,0.00840686,0.0007085458,0.013756302,0.033599123,0.00011045806],"about_ca_topic_score_codex":0.0017476351,"about_ca_topic_score_gemma":0.003909864,"teacher_disagreement_score":0.9514831,"about_ca_system_score_codex":0.000006291796,"about_ca_system_score_gemma":0.000012877449,"threshold_uncertainty_score":0.26419133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016933969,0.0012187714,0.96438146,0.00015484571,0.003224505,0.00044721464,0.000007942211,0.00012622999,0.030269688],"genre_scores_gemma":[0.8463077,0.00017828851,0.14734398,0.0004380128,0.0010957044,0.000031622247,0.000017681888,0.000057009514,0.0045300364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966679,0.00006584358,0.0006555585,0.00123795,0.0007624817,0.0006102548],"domain_scores_gemma":[0.9969595,0.00040137774,0.0005348572,0.001388255,0.0005653441,0.00015067107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011927629,0.00043659247,0.0006814352,0.0004950536,0.00017309922,0.0004351802,0.0027417114,0.0003583347,0.00004783695],"category_scores_gemma":[0.00009905507,0.00036913485,0.00013471607,0.00049667654,0.0003851812,0.00059883716,0.0006587881,0.00048635335,0.00014772809],"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.000012285874,0.00016859554,0.0010661794,0.00048642926,0.000050407674,0.000060958606,0.005314797,0.026859757,0.0009738287,0.32295328,0.00080280774,0.64125067],"study_design_scores_gemma":[0.0003969982,0.00025726436,0.00083841453,0.0005400525,0.000005787294,0.0000771717,7.534447e-7,0.9400718,0.0014544504,0.04834933,0.0071091657,0.0008987826],"about_ca_topic_score_codex":0.000053751228,"about_ca_topic_score_gemma":0.00014582965,"teacher_disagreement_score":0.91321206,"about_ca_system_score_codex":0.00017881871,"about_ca_system_score_gemma":0.00040614966,"threshold_uncertainty_score":0.9998761},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007334094,0.000722948,0.98146296,0.0002828199,0.006280179,0.0010439791,0.0000114473805,0.00020840348,0.009913948],"genre_scores_gemma":[0.12807985,0.00003854719,0.8660487,0.00050694385,0.0030237439,0.000083771396,0.00001446618,0.00007944862,0.002124564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525476,0.000059527127,0.00058476976,0.0021783304,0.0009383452,0.0009842863],"domain_scores_gemma":[0.9962449,0.0009790615,0.00042526878,0.0014665577,0.00055650406,0.00032772042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012877084,0.0007013039,0.0008027076,0.0006782226,0.00055863906,0.0008859439,0.0035590574,0.00059334206,0.0000126706545],"category_scores_gemma":[0.00038005825,0.00058959716,0.00027481487,0.00047951724,0.0010734454,0.0005398036,0.0013636999,0.0014884821,0.00005066459],"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.00001771179,0.000055073502,0.000041490668,0.00008055259,0.00003923308,0.00009611763,0.003117139,0.0062318225,0.00034103176,0.83096737,0.00004187505,0.1589706],"study_design_scores_gemma":[0.00052178313,0.00039970456,0.00012253315,0.0005789421,0.000021127424,0.00018905399,7.5797374e-7,0.5657761,0.0012317544,0.41836223,0.011624152,0.0011718322],"about_ca_topic_score_codex":0.000028307471,"about_ca_topic_score_gemma":0.00006365234,"teacher_disagreement_score":0.5595443,"about_ca_system_score_codex":0.00042987755,"about_ca_system_score_gemma":0.0007613927,"threshold_uncertainty_score":0.99965554},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097101685,0.00001738247,0.83432674,0.0007848562,0.0004117997,0.00023799221,0.0000042770466,0.00026116607,0.15424563],"genre_scores_gemma":[0.9226496,0.0000082827855,0.035619143,0.0016248701,0.00011361053,0.00004877283,0.000009103691,0.000010334038,0.039916284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990796,0.000024377732,0.00008999977,0.0003575822,0.00016903268,0.00027942343],"domain_scores_gemma":[0.9994294,0.000051296483,0.000030835192,0.00035697038,0.000043159132,0.00008834183],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014891614,0.000123568,0.0001122655,0.000050967505,0.00015516073,0.00019126697,0.0004756301,0.00006939158,0.00092780904],"category_scores_gemma":[0.000011702984,0.00009623318,0.00008648624,0.00014446767,0.000012724955,0.00020086239,0.000044402044,0.000046698085,0.0004159222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014187436,0.000092208065,0.0000068828344,0.0000060630264,0.000010832159,0.0000054429215,0.00032895402,0.000014901077,0.00015427543,0.8919117,0.009795557,0.097658984],"study_design_scores_gemma":[0.0030189203,0.0017691401,0.0020546466,0.00005141819,0.000031123465,0.000035595287,0.00012262298,0.20873448,0.026606452,0.63856363,0.11806557,0.0009463887],"about_ca_topic_score_codex":0.0000037475097,"about_ca_topic_score_gemma":0.0000056246267,"teacher_disagreement_score":0.9129394,"about_ca_system_score_codex":0.00003322358,"about_ca_system_score_gemma":0.000018542349,"threshold_uncertainty_score":0.99998546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003439249,0.0011308681,0.9755438,0.000549654,0.0025714007,0.0011949441,0.0000049367504,0.00039432815,0.01857565],"genre_scores_gemma":[0.057857517,0.00016080288,0.93284976,0.003233646,0.0019377324,0.00015447152,0.000042473494,0.000103554805,0.003660065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495715,0.00004159512,0.0006359251,0.0022477144,0.0008573491,0.001260289],"domain_scores_gemma":[0.99669963,0.00043386887,0.00039730422,0.0016503193,0.00052352983,0.00029535338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008453818,0.00080264534,0.0008382146,0.0006607979,0.0004528667,0.0009048986,0.004802541,0.0005118144,0.0000354942],"category_scores_gemma":[0.00011302495,0.0006622045,0.00030999086,0.0009829015,0.00083574426,0.00047327921,0.0014379912,0.0006910333,0.00009262622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011252236,0.000107111715,0.00009510015,0.00006549371,0.000021197367,0.00008746744,0.00056099583,0.003214079,0.000039481765,0.100300826,0.00019575395,0.8953012],"study_design_scores_gemma":[0.0008219556,0.0007900911,0.000088668785,0.0003063186,0.00002054677,0.00022197423,2.9026697e-7,0.5098639,0.0002030373,0.42744753,0.058863137,0.0013725616],"about_ca_topic_score_codex":0.000018729044,"about_ca_topic_score_gemma":0.0001429604,"teacher_disagreement_score":0.8939287,"about_ca_system_score_codex":0.00033086285,"about_ca_system_score_gemma":0.00067284424,"threshold_uncertainty_score":0.99958295},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5062065,0.00025307675,0.32436672,0.00016746539,0.0002505479,0.00019716712,1.736349e-7,0.0002442506,0.16831408],"genre_scores_gemma":[0.9783891,0.0000021555443,0.019456193,0.00006519648,0.000023835222,0.00000438936,2.841301e-7,0.0000030455003,0.0020558313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944896,0.000014907486,0.000089468485,0.00021836512,0.000058279526,0.00017001451],"domain_scores_gemma":[0.9997506,0.00006317157,0.00001955717,0.00012842489,0.000010664731,0.000027564955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012508509,0.00006948822,0.000076575416,0.000073522024,0.00005073977,0.00008128627,0.00015925049,0.00003402466,0.000005864768],"category_scores_gemma":[0.000017427212,0.000053613763,0.0000131342085,0.00013692878,0.000014696758,0.00016316396,0.000080662925,0.00006646115,0.000039103576],"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.0000037895436,0.00011515675,0.016541919,0.000009152227,0.0000018625866,0.00002903601,0.00080453884,0.00015354573,0.000565396,0.9642302,0.00048900925,0.017056396],"study_design_scores_gemma":[0.0031829858,0.00033331977,0.11843683,0.00016984387,0.0000040082436,0.00006620744,0.00008922545,0.7841583,0.010660891,0.08001681,0.00206307,0.00081855064],"about_ca_topic_score_codex":0.00014712158,"about_ca_topic_score_gemma":0.00036144236,"teacher_disagreement_score":0.8842134,"about_ca_system_score_codex":0.000024005682,"about_ca_system_score_gemma":0.000011871163,"threshold_uncertainty_score":0.21863058},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004889112,0.0008853164,0.9887501,0.00037736387,0.00083021045,0.001505669,0.0000017190587,0.00031023254,0.0068504484],"genre_scores_gemma":[0.4925335,0.000033082062,0.50601435,0.0001695501,0.00037646617,0.000106020714,0.000035838508,0.00005033998,0.00068083976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950605,0.00008854642,0.0008469547,0.0020500536,0.0011654139,0.000788509],"domain_scores_gemma":[0.99647456,0.00033415447,0.0008279945,0.0015853184,0.00052253547,0.00025543958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068678573,0.0007595734,0.0008494196,0.0006325056,0.00033585352,0.00037064953,0.0025522124,0.00051232916,0.000014307949],"category_scores_gemma":[0.0000916072,0.00053777755,0.00023122723,0.0011184139,0.0015503797,0.00076731294,0.00075256627,0.00082426856,0.000011996889],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090453286,0.0004565668,0.0007392266,0.00014247645,0.000041090658,0.00074045465,0.0062498944,0.0028035739,0.00016703241,0.0043552946,0.000024175357,0.98418975],"study_design_scores_gemma":[0.0041831397,0.018736761,0.003137596,0.00785832,0.00028839917,0.004613758,0.000015497853,0.75477684,0.0030660864,0.19085756,0.006526659,0.0059393924],"about_ca_topic_score_codex":0.00005493652,"about_ca_topic_score_gemma":0.000104050276,"teacher_disagreement_score":0.9782504,"about_ca_system_score_codex":0.0002323354,"about_ca_system_score_gemma":0.00058113673,"threshold_uncertainty_score":0.9997074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013979612,0.00016525648,0.9867955,0.00036732157,0.0033443014,0.00071809714,0.0000022085605,0.00024268366,0.008224876],"genre_scores_gemma":[0.18543163,0.00004000226,0.81112707,0.00082650146,0.001342451,0.000033536762,0.000008776874,0.000048055306,0.0011419643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968188,0.000024712273,0.00050632196,0.0014053136,0.0005579963,0.00068686256],"domain_scores_gemma":[0.9977465,0.0005837744,0.0002918024,0.0009943044,0.00025702763,0.00012654687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014062912,0.00046278638,0.0005067465,0.0010611914,0.00026349863,0.0006621044,0.002948757,0.0005347278,0.000010127661],"category_scores_gemma":[0.00024062865,0.00041739037,0.00013977554,0.00059163815,0.00045443195,0.00080560497,0.0008410732,0.00095783634,0.000019063089],"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.000006450698,0.000026784788,0.00012453964,0.00005412483,0.0000039113775,0.000022561473,0.0012912324,0.00022300545,0.0011955668,0.13515206,0.000023565663,0.8618762],"study_design_scores_gemma":[0.00042785774,0.00028191914,0.000276584,0.0005499194,0.000007228359,0.000075132884,3.229577e-7,0.21760583,0.018143963,0.75155735,0.010054198,0.0010196866],"about_ca_topic_score_codex":0.000033982513,"about_ca_topic_score_gemma":0.00037031065,"teacher_disagreement_score":0.86085653,"about_ca_system_score_codex":0.00034354313,"about_ca_system_score_gemma":0.0004168807,"threshold_uncertainty_score":0.9998278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03242247,0.001267568,0.31157708,0.0002773168,0.0007539078,0.00011198684,6.503285e-7,0.00093986496,0.65264916],"genre_scores_gemma":[0.9767629,0.000014153506,0.013666509,0.00016796486,0.00011195433,0.0000044488575,0.0000026097453,0.000011573413,0.009257906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905896,0.00010150482,0.00012631131,0.0002900965,0.00013264253,0.00029046016],"domain_scores_gemma":[0.9994503,0.000046721412,0.00007012935,0.00029754627,0.000037496386,0.00009775574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028675975,0.00012551059,0.00013060069,0.00007109987,0.00016053887,0.00007586957,0.00064865605,0.000055961948,0.00030093698],"category_scores_gemma":[0.00011763819,0.00010222469,0.000067294655,0.00021525513,0.00003080445,0.00022923622,0.0002044829,0.00033438718,0.00056211726],"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.000025979218,0.00032439278,0.33372068,0.00007055476,0.00008673107,0.00028552083,0.06400905,0.0002833721,0.0018750618,0.41224667,0.002977057,0.1840949],"study_design_scores_gemma":[0.0014129053,0.0007246406,0.087404035,0.000058851605,0.000029162316,0.00019156508,0.00016508825,0.28608954,0.002984132,0.023792254,0.5959365,0.001211382],"about_ca_topic_score_codex":0.00010873426,"about_ca_topic_score_gemma":0.0000542672,"teacher_disagreement_score":0.9443404,"about_ca_system_score_codex":0.000018423954,"about_ca_system_score_gemma":0.000022059581,"threshold_uncertainty_score":0.7225068},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011781066,0.00038195154,0.9918914,0.00036976524,0.0016209339,0.0009722089,0.000012192001,0.0002451426,0.004494635],"genre_scores_gemma":[0.08064268,0.00008459675,0.91486174,0.001175962,0.0009987426,0.00008714072,0.000014443666,0.000043264037,0.0020914264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963315,0.000050713883,0.00048815663,0.0015836845,0.00073462416,0.00081129896],"domain_scores_gemma":[0.9969954,0.0008747588,0.00033403767,0.0011947504,0.00040510675,0.00019592751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011379978,0.0005392385,0.0004789656,0.0005982942,0.00048366646,0.0006283129,0.0029240677,0.0004125985,0.0000451843],"category_scores_gemma":[0.00018482447,0.0004859288,0.00017613091,0.00042998145,0.00036186454,0.0008233349,0.0007927741,0.00050061475,0.00006184244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006709399,0.000038774742,0.0000041280355,0.000030645242,0.000010969023,0.000009731543,0.00071478554,0.008629948,0.00011769719,0.6169048,0.000115019735,0.3734168],"study_design_scores_gemma":[0.00027980097,0.00019057936,0.000023092249,0.0002076683,0.000010181381,0.000025977055,7.559062e-8,0.43432292,0.002383452,0.559726,0.0023423461,0.0004878839],"about_ca_topic_score_codex":0.000009807087,"about_ca_topic_score_gemma":0.00007057813,"teacher_disagreement_score":0.42569298,"about_ca_system_score_codex":0.00038552715,"about_ca_system_score_gemma":0.0007672294,"threshold_uncertainty_score":0.99975926},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008751265,0.0005827544,0.25730976,0.0024544825,0.000545645,0.00012648695,4.0084834e-7,0.00073938194,0.7294898],"genre_scores_gemma":[0.8632583,0.000019109873,0.09904833,0.0015756346,0.00049184397,0.000008162983,0.0000018400805,0.00001719334,0.035579603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814856,0.00006718038,0.0003177123,0.0005835448,0.00030825785,0.0005747329],"domain_scores_gemma":[0.9987462,0.00012980115,0.00016128847,0.0006855077,0.00009283049,0.00018437047],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005298578,0.0002264009,0.00023690169,0.00012170312,0.0002872301,0.00032271468,0.0011829314,0.00011210056,0.00023541343],"category_scores_gemma":[0.00018019303,0.0001918805,0.00012970039,0.0004029156,0.000045868386,0.0008039422,0.00042192196,0.00022850052,0.0010183092],"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.0000033422073,0.00010332379,0.0036993886,0.000017358321,0.000029589515,0.000031999345,0.0038900035,0.00013497299,0.00064015813,0.7250908,0.028170275,0.23818879],"study_design_scores_gemma":[0.0012181422,0.00016491552,0.007717438,0.00020415706,0.000028288105,0.0004815143,0.00022987579,0.3066849,0.0048568323,0.0049391715,0.672188,0.00128678],"about_ca_topic_score_codex":0.000044416924,"about_ca_topic_score_gemma":0.00015728605,"teacher_disagreement_score":0.854507,"about_ca_system_score_codex":0.00014323836,"about_ca_system_score_gemma":0.00017256147,"threshold_uncertainty_score":0.9997595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003317609,0.00058759743,0.99270505,0.00057129207,0.0016396539,0.00056582614,0.000025946503,0.00008872193,0.003782734],"genre_scores_gemma":[0.07617472,0.000053163498,0.92101276,0.0015958938,0.00046440598,0.000013591415,0.000069142785,0.000028855578,0.0005874492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635744,0.000048795715,0.00065261865,0.001726586,0.0006637435,0.00055079686],"domain_scores_gemma":[0.99575,0.00071460946,0.0004344439,0.0024778529,0.00046564845,0.00015743413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013470799,0.0004458662,0.0006279229,0.00039009642,0.00024725118,0.00025005123,0.0044782134,0.00039113846,0.000020346859],"category_scores_gemma":[0.00053265947,0.00034995395,0.0001448565,0.00042030454,0.0006533027,0.0005950101,0.0019942995,0.00046654648,0.000012929482],"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.00002455057,0.00026178485,0.0002383534,0.00016494344,0.000032628974,0.000091798654,0.00093513174,0.0088621965,0.000542069,0.42286167,0.0016270047,0.5643579],"study_design_scores_gemma":[0.00047064573,0.0005780679,0.00011404181,0.00025513984,0.000018746021,0.00008260607,3.6592687e-7,0.58283305,0.0014210582,0.39795873,0.015510157,0.00075740094],"about_ca_topic_score_codex":0.000007991782,"about_ca_topic_score_gemma":0.000080746744,"teacher_disagreement_score":0.57397085,"about_ca_system_score_codex":0.00012084937,"about_ca_system_score_gemma":0.00050762075,"threshold_uncertainty_score":0.9998953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027570447,0.00036507822,0.8229328,0.000082066006,0.00055060233,0.0003221321,0.0000013556823,0.00013097946,0.14804454],"genre_scores_gemma":[0.9905906,0.000025685102,0.008968387,0.00008839915,0.000017273776,0.000021456846,0.0000023747389,0.000003027124,0.00028285323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989954,0.000020525633,0.00036347227,0.00016729724,0.00021291581,0.000240336],"domain_scores_gemma":[0.99923676,0.000028754032,0.00017596524,0.00038972741,0.000108636035,0.000060181483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051739014,0.00010295907,0.00013293471,0.000071152615,0.00007447941,0.000069792346,0.00050838443,0.000062921434,0.000036842852],"category_scores_gemma":[0.000069111054,0.0000775025,0.00007044865,0.00027012939,0.000046554873,0.0005152611,0.00007026359,0.00008456904,0.00017564358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028489762,0.00007856783,0.0017733581,0.000041993546,0.000011020215,0.0000019707238,0.0008834978,0.00019772207,0.0009701087,0.9782519,0.00020643832,0.017580597],"study_design_scores_gemma":[0.0032544557,0.0016953151,0.14182636,0.00021174134,0.00005731861,0.00024300515,0.00023517101,0.06336297,0.12832274,0.5374688,0.121600315,0.0017217994],"about_ca_topic_score_codex":0.000011999863,"about_ca_topic_score_gemma":0.000018160086,"teacher_disagreement_score":0.9630201,"about_ca_system_score_codex":0.000020769261,"about_ca_system_score_gemma":0.000057112964,"threshold_uncertainty_score":0.316046},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019761914,0.0027007405,0.38878512,0.011506535,0.00200464,0.0008157272,0.000002010224,0.0011237856,0.5732995],"genre_scores_gemma":[0.9913599,0.000033386747,0.0065409285,0.0009879994,0.00060323486,0.000024595656,0.0000027849721,0.00001492939,0.00043227224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983562,0.00017464375,0.00027593432,0.00048832316,0.00031494163,0.00038991222],"domain_scores_gemma":[0.99853665,0.00019283351,0.00012203451,0.0008282421,0.00016135591,0.00015888107],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044357855,0.00022279573,0.0002814998,0.00011542767,0.00044466706,0.00022747643,0.0013594286,0.00007496099,0.00018892414],"category_scores_gemma":[0.00007270468,0.00017773923,0.00014329079,0.00034027596,0.0000739433,0.0006825902,0.0007208787,0.00021901939,0.0015751455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035688854,0.00010198241,0.00014023035,0.000019162395,0.00001649916,0.0000054535467,0.0007594058,0.0000069800167,0.00023711714,0.9517981,0.0051699537,0.04174155],"study_design_scores_gemma":[0.0004829261,0.00013427463,0.0017891618,0.00009388849,0.000008765022,0.000017020104,0.000008331113,0.009037745,0.00053323695,0.9611611,0.026384203,0.00034938278],"about_ca_topic_score_codex":0.000013775874,"about_ca_topic_score_gemma":5.857265e-7,"teacher_disagreement_score":0.97159797,"about_ca_system_score_codex":0.000043344266,"about_ca_system_score_gemma":0.00003213262,"threshold_uncertainty_score":0.99920225},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003754674,0.0003503802,0.0051947003,0.0025266036,0.90702075,0.00087307097,0.0001457268,0.0012155459,0.08229777],"genre_scores_gemma":[0.08386776,0.00055340765,0.008165641,0.00013117678,0.9042419,0.00055575254,0.0007223833,0.00023142618,0.001530503],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9892043,0.000749477,0.0015804344,0.0029355832,0.00340023,0.0021300013],"domain_scores_gemma":[0.9893353,0.0026733498,0.0019369138,0.0029893361,0.001745095,0.0013199883],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0018877394,0.0017016985,0.0018231405,0.0011053234,0.0015212425,0.0017022241,0.004803414,0.0035253712,0.00002486935],"category_scores_gemma":[0.0064654555,0.0016093762,0.0007683777,0.0020228785,0.0001153634,0.00095214706,0.0013633688,0.0063807126,0.00019561345],"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.00021317802,0.00069947756,0.000039937244,0.00010279919,0.00022689743,0.0002638466,0.0016328451,0.00003769598,0.00018998576,0.16954166,0.8237317,0.00331993],"study_design_scores_gemma":[0.0014508483,0.00030639514,0.0002788416,0.0006353988,0.00012314174,0.00010684849,0.00009406822,0.0008858685,0.00016372738,0.0002739371,0.99396247,0.0017184679],"about_ca_topic_score_codex":0.000017150656,"about_ca_topic_score_gemma":0.0008338939,"teacher_disagreement_score":0.1702307,"about_ca_system_score_codex":0.0014807194,"about_ca_system_score_gemma":0.0035920497,"threshold_uncertainty_score":0.9997786},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014791306,0.0010528648,0.9702287,0.0009814946,0.0027352998,0.0008176436,0.000006709115,0.00031843953,0.023844112],"genre_scores_gemma":[0.045874827,0.000069436384,0.94584674,0.0029944074,0.0010628778,0.00006191053,0.000009242987,0.000082857354,0.0039976966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541706,0.000053853248,0.00052009965,0.0020606986,0.00087238336,0.0010759236],"domain_scores_gemma":[0.9960611,0.0010754401,0.0003346893,0.0017216762,0.00055027497,0.0002568296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016613298,0.0007438642,0.0007388607,0.00074898463,0.0005229228,0.0009886207,0.0044340044,0.000514188,0.000028566174],"category_scores_gemma":[0.00041593675,0.00062606693,0.00027840983,0.00078112696,0.0010924753,0.0005556465,0.0013048763,0.0008482477,0.000088704444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000110318615,0.000057840734,0.000010944712,0.00006276747,0.000019006344,0.000040666862,0.001361291,0.003035689,0.00002216421,0.80242044,0.00004723151,0.19291095],"study_design_scores_gemma":[0.0007044875,0.00028703912,0.000028313485,0.00032184419,0.000014682123,0.00009666738,2.8902423e-7,0.07911827,0.00041116113,0.9126944,0.0055150627,0.000807791],"about_ca_topic_score_codex":0.000017355922,"about_ca_topic_score_gemma":0.000112160546,"teacher_disagreement_score":0.19210316,"about_ca_system_score_codex":0.00052429794,"about_ca_system_score_gemma":0.0017327899,"threshold_uncertainty_score":0.99961907},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070168756,0.0006422951,0.86759925,0.0008336552,0.0004469391,0.00031744543,6.7584944e-7,0.00035996438,0.059631035],"genre_scores_gemma":[0.95575565,0.00012936702,0.04060821,0.0002962763,0.000053899472,0.0000014589721,0.0000032484293,0.000005888391,0.0031459972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989856,0.000043229626,0.00021034501,0.00028397405,0.00023637661,0.00024049291],"domain_scores_gemma":[0.999174,0.000041818083,0.00007953396,0.00048311308,0.00014415955,0.00007735168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018965638,0.00011907862,0.00018846635,0.000050619372,0.00009798018,0.00003348856,0.0005561587,0.00007546136,0.000046172634],"category_scores_gemma":[0.000026100835,0.00008133096,0.00008304303,0.00035522826,0.000092184826,0.00019413198,0.00023104038,0.00008283034,0.0001251934],"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.0000073259275,0.0007037514,0.014766521,0.000100243255,0.000040242583,0.00007003343,0.003220792,0.00006161241,0.0004992941,0.90993947,0.018369317,0.05222139],"study_design_scores_gemma":[0.0074171876,0.007981659,0.08962181,0.0009909492,0.00015753269,0.0020791097,0.0013287389,0.19376628,0.05377453,0.20810366,0.42948097,0.005297569],"about_ca_topic_score_codex":0.000020948775,"about_ca_topic_score_gemma":0.000010673245,"teacher_disagreement_score":0.8855869,"about_ca_system_score_codex":0.000015302237,"about_ca_system_score_gemma":0.000051454444,"threshold_uncertainty_score":0.33165804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005031715,0.00064503256,0.9887847,0.00046209784,0.0025101893,0.00068481505,0.000056306024,0.00031528942,0.0064912965],"genre_scores_gemma":[0.16694929,0.00012806835,0.8243341,0.0024138708,0.003825902,0.000074029536,0.00014111602,0.000119793505,0.002013867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955178,0.00001573357,0.00062684424,0.001871031,0.00080338324,0.001165238],"domain_scores_gemma":[0.9965987,0.0008509089,0.00036161314,0.0014326609,0.00047357328,0.00028253268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096261647,0.000728506,0.0007211506,0.0006098357,0.0005093834,0.0008417437,0.0041202013,0.0005369434,0.000035373385],"category_scores_gemma":[0.000268478,0.0006297782,0.0002515312,0.0006840052,0.0005503773,0.00099926,0.0013809201,0.00079612824,0.00007132758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022772416,0.000060534596,0.000074808064,0.00009190821,0.00003681352,0.00007459594,0.002178985,0.011204128,0.0000639265,0.099189796,0.00081344735,0.88618827],"study_design_scores_gemma":[0.00083414844,0.0003390566,0.0001045583,0.00043502657,0.000020641968,0.00013891982,5.036726e-7,0.7656655,0.0008577877,0.16987546,0.060366035,0.0013623803],"about_ca_topic_score_codex":0.0000110436695,"about_ca_topic_score_gemma":0.00016382833,"teacher_disagreement_score":0.8848259,"about_ca_system_score_codex":0.00051205547,"about_ca_system_score_gemma":0.0008098159,"threshold_uncertainty_score":0.9996154},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037604193,0.00093563506,0.9877694,0.000566212,0.0012549384,0.00035065794,0.000005296909,0.00012013006,0.008960116],"genre_scores_gemma":[0.6976178,0.0002177413,0.29699352,0.0028615415,0.0010331674,0.000028161676,0.000042367577,0.000044962908,0.0011607038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713445,0.000033887703,0.00040790864,0.0012594855,0.0007037868,0.00046045906],"domain_scores_gemma":[0.9985193,0.00024024639,0.00024291173,0.00062040443,0.00018752585,0.00018963276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006677,0.00042090972,0.0004245399,0.0004345099,0.0003021842,0.00047928936,0.0013234902,0.00027764813,0.000041169696],"category_scores_gemma":[0.00007105164,0.00036702052,0.00008518586,0.00029609908,0.00063778315,0.0005315042,0.00081270456,0.00047877722,0.000045858626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024928277,0.00002563018,0.00008159336,0.000030775984,0.000007930728,0.000053528933,0.0007990628,0.0030781785,0.000057566544,0.82741135,0.000026835887,0.16842504],"study_design_scores_gemma":[0.000467815,0.00023235926,0.0007521285,0.00032187387,0.000009482319,0.00011902997,2.0938158e-7,0.09806412,0.0005205846,0.8944888,0.004348542,0.00067507714],"about_ca_topic_score_codex":0.000013126846,"about_ca_topic_score_gemma":0.00005045822,"teacher_disagreement_score":0.6975802,"about_ca_system_score_codex":0.00043611915,"about_ca_system_score_gemma":0.0006647389,"threshold_uncertainty_score":0.99987817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8932194,0.0005705268,0.10184072,0.0010927743,0.0003054625,0.0015139857,0.000018251096,0.00021131588,0.001227559],"genre_scores_gemma":[0.957717,0.000020327505,0.04129394,0.00000854992,0.0001392355,0.0000046551677,0.00005668162,0.000013219826,0.0007463717],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9974089,0.00019145118,0.00018892996,0.0009141857,0.0006290086,0.0006674876],"domain_scores_gemma":[0.99725306,0.00029991334,0.00017048945,0.0009495525,0.0010956876,0.00023127928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002222288,0.00017367804,0.0002676101,0.00038774108,0.0006664258,0.00019474614,0.0012104285,0.0001310148,0.000014489247],"category_scores_gemma":[0.0015798942,0.00017556823,0.00010082876,0.00075829984,0.00068424694,0.0006675127,0.0006691481,0.0005563183,0.000010064999],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052639836,0.0010024862,0.043951076,0.0012673937,0.00025663088,0.00015720066,0.03413056,0.00021192954,0.11750406,0.11859791,0.013063603,0.6693308],"study_design_scores_gemma":[0.01199395,0.0029362978,0.3121921,0.00070644,0.0001557567,0.00021717027,0.005009778,0.21827705,0.11770385,0.03883258,0.28884092,0.003134113],"about_ca_topic_score_codex":0.00085413776,"about_ca_topic_score_gemma":0.000560206,"teacher_disagreement_score":0.66619664,"about_ca_system_score_codex":0.000064167136,"about_ca_system_score_gemma":0.00034555903,"threshold_uncertainty_score":0.71594644},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006166986,0.000045105968,0.45699435,0.0000570021,0.00014079276,0.000031280753,0.0000012648721,0.000046554356,0.53651667],"genre_scores_gemma":[0.97903615,0.000003988149,0.018014098,0.00015718986,0.000016814887,0.0000018994026,0.0000018784526,0.0000013648563,0.00276664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994296,0.00004742559,0.00012335525,0.00014168199,0.00013010243,0.00012783505],"domain_scores_gemma":[0.99953187,0.00006223875,0.000045495348,0.00021933217,0.00009196756,0.000049128583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002335898,0.000056834477,0.000087900866,0.000023934534,0.00004544068,0.000020731222,0.0002831857,0.00003567085,0.00036083543],"category_scores_gemma":[0.000074183634,0.00004269899,0.000045847224,0.00013916324,0.000049514278,0.00016133492,0.000055579872,0.00004528779,0.000113873786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8918412e-7,0.000050920047,0.0036213128,0.0000036482556,0.000003757287,0.0000010986928,0.000069164926,0.000009217003,0.00009083545,0.99381,0.002020183,0.0003194921],"study_design_scores_gemma":[0.0012223993,0.0003014381,0.093211815,0.000012408714,0.000011696148,0.00010905792,0.00014720378,0.009077289,0.048796695,0.6867214,0.15979595,0.00059268397],"about_ca_topic_score_codex":0.000007484118,"about_ca_topic_score_gemma":0.000009343708,"teacher_disagreement_score":0.97286916,"about_ca_system_score_codex":0.0000110550145,"about_ca_system_score_gemma":0.00006167901,"threshold_uncertainty_score":0.39508948},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010250237,0.00067346904,0.9854917,0.00060970476,0.001193565,0.00057954586,0.0000016535548,0.00030287265,0.011045013],"genre_scores_gemma":[0.31132168,0.000040239393,0.68644464,0.0014924927,0.00046233126,0.00003055233,0.0000041074795,0.00004015543,0.00016379938],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492437,0.00009040259,0.0005938386,0.0022372415,0.0009894649,0.0011647153],"domain_scores_gemma":[0.99647295,0.0010439768,0.00031183715,0.0017719866,0.0001582425,0.00024101179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001273951,0.0007354322,0.0007953835,0.00104926,0.00026104422,0.00077655545,0.003990813,0.0007272455,0.000045044573],"category_scores_gemma":[0.00027192163,0.00064736116,0.000213103,0.0013362537,0.00075503957,0.00061645574,0.00087712373,0.0018790464,0.00009218929],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011994959,0.00012166999,0.000280319,0.000033076725,0.000004924338,0.00027853725,0.00070838426,0.022526896,0.000026004473,0.042511877,0.000005450233,0.9334909],"study_design_scores_gemma":[0.00048316582,0.00038131827,0.00082516274,0.0012663127,0.000008906512,0.00007232103,1.901877e-7,0.37662494,0.0006615016,0.61207515,0.0062065707,0.0013944393],"about_ca_topic_score_codex":0.00007571588,"about_ca_topic_score_gemma":0.00030937427,"teacher_disagreement_score":0.9320964,"about_ca_system_score_codex":0.0005226209,"about_ca_system_score_gemma":0.00092590007,"threshold_uncertainty_score":0.9995978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7841108,0.00143707,0.010353386,0.0056479634,0.00016887112,0.00043451777,8.541193e-7,0.00012147114,0.19772506],"genre_scores_gemma":[0.99872506,0.00007520053,0.0006913873,0.00023707986,0.000053964748,0.000019901021,5.0623663e-7,0.0000016121418,0.00019526592],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991608,0.00015542729,0.00008769003,0.00027624413,0.00013190483,0.000187926],"domain_scores_gemma":[0.99948615,0.00016809792,0.000021657199,0.00027123754,0.000023540197,0.000029319675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556235,0.00008510598,0.00010956177,0.000021099264,0.00016643957,0.000121781144,0.00036195427,0.00003822634,0.000025123725],"category_scores_gemma":[0.000099764344,0.00004945413,0.000029960825,0.00026530618,0.00005909933,0.00017477947,0.00008824633,0.00010314443,0.00003532463],"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.0000145735985,0.0004494778,0.03907232,0.000024312354,0.000022937891,0.000069257476,0.043666717,0.000047023488,0.00025050784,0.19612569,0.0027696579,0.7174875],"study_design_scores_gemma":[0.00057929143,0.00018715276,0.9497229,0.000011911645,0.000008346117,0.000017301332,0.00056364515,0.004593274,0.000041909483,0.019626634,0.02440249,0.000245156],"about_ca_topic_score_codex":0.000028015302,"about_ca_topic_score_gemma":0.00009289142,"teacher_disagreement_score":0.91065055,"about_ca_system_score_codex":0.000023015777,"about_ca_system_score_gemma":0.000023444683,"threshold_uncertainty_score":0.2016681},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09678042,0.00016259369,0.5255882,0.0001872508,0.0005313842,0.00041602156,0.00001137289,0.00036364215,0.3759591],"genre_scores_gemma":[0.993006,0.0000838917,0.004512452,0.0017344888,0.00010079297,0.000026208823,0.00001649878,0.000008648599,0.0005110058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668473,0.00013320388,0.0009118062,0.00040814758,0.0006140221,0.0012481184],"domain_scores_gemma":[0.99727404,0.0004711133,0.0006048554,0.0009028116,0.0004808326,0.00026634178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014798997,0.0005317302,0.000658927,0.00027942346,0.00045369827,0.00032300013,0.0025726901,0.0002912136,0.00015211363],"category_scores_gemma":[0.0006663705,0.0003816167,0.00023522745,0.0008450904,0.00041591036,0.007074258,0.0009530092,0.0005262085,0.00050311285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012749225,0.00011781718,0.0013612834,0.00004485454,0.000019027306,0.0000148881045,0.0060595074,0.00024230136,0.000058189722,0.9335331,0.000040096216,0.05838146],"study_design_scores_gemma":[0.0020027196,0.004804449,0.08700196,0.00019432436,0.000039959446,0.00017006672,0.0011649061,0.01945215,0.0074345837,0.87428844,0.0020124137,0.0014340392],"about_ca_topic_score_codex":0.000029082083,"about_ca_topic_score_gemma":0.000008628378,"teacher_disagreement_score":0.8962256,"about_ca_system_score_codex":0.00005978477,"about_ca_system_score_gemma":0.0004195456,"threshold_uncertainty_score":0.99986356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009261517,0.00023341362,0.9899282,0.0004304487,0.00074292964,0.0009411378,0.000028265466,0.00014841073,0.0074546197],"genre_scores_gemma":[0.42061868,0.0006347097,0.5725683,0.002081134,0.0003636427,0.00015983313,0.0013528367,0.000067755536,0.0021531212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971169,0.000043362903,0.0006534825,0.000918538,0.0006679937,0.0005996827],"domain_scores_gemma":[0.9979909,0.0003585776,0.0003557273,0.0009272652,0.00026062812,0.000106921434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008977597,0.0004299446,0.0004428619,0.00080270896,0.00028993023,0.0004316288,0.0018560356,0.0003013886,0.000009657477],"category_scores_gemma":[0.00011449187,0.0004082576,0.00011109112,0.00066887826,0.00028900435,0.00088828406,0.00071638206,0.0004179743,0.000055617846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004297622,0.00005956228,0.0001720933,0.00020126077,0.000014573975,0.000041962376,0.0018915812,0.035283186,0.000025719131,0.028180223,0.00061975763,0.9334671],"study_design_scores_gemma":[0.0010594731,0.00015220458,0.003809463,0.0004050662,0.000005131972,0.00006415378,5.890365e-7,0.8734603,0.00006377588,0.031391453,0.08869346,0.00089494797],"about_ca_topic_score_codex":0.000018699198,"about_ca_topic_score_gemma":0.00036517112,"teacher_disagreement_score":0.9325721,"about_ca_system_score_codex":0.00055177865,"about_ca_system_score_gemma":0.00019877122,"threshold_uncertainty_score":0.9998369},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6167433,0.002797758,0.033033237,0.0019953393,0.0016203391,0.00063933467,0.0000027154076,0.0004091825,0.34275877],"genre_scores_gemma":[0.9977257,0.00038326415,0.0005252014,0.0005521141,0.000056353103,0.00001585605,0.000003072961,0.0000028720822,0.0007355352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99900895,0.000025317397,0.000288974,0.0001804779,0.00014537686,0.00035090398],"domain_scores_gemma":[0.99945444,0.000087474145,0.000104991785,0.0002490107,0.000030871666,0.000073236544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044490042,0.000123309,0.00010860997,0.000049622064,0.00028171227,0.00024433093,0.00040511836,0.00005979302,0.000016934178],"category_scores_gemma":[0.00007822649,0.000072592644,0.000030845255,0.00031605354,0.00009893935,0.0005274492,0.00026914873,0.0001461509,0.00005761713],"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.00003887479,0.000076145654,0.21047045,0.000010830801,0.00000901938,0.000106689244,0.0010967324,0.000032612912,0.00005033689,0.6460479,0.00037129308,0.14168912],"study_design_scores_gemma":[0.0011932222,0.00062942045,0.73740524,0.00002512846,0.0000069717976,0.00066362,0.0004976552,0.039291706,0.00008429098,0.05169012,0.16799241,0.00052019645],"about_ca_topic_score_codex":0.000046811187,"about_ca_topic_score_gemma":0.00026318437,"teacher_disagreement_score":0.5943578,"about_ca_system_score_codex":0.000041362353,"about_ca_system_score_gemma":0.000035609846,"threshold_uncertainty_score":0.29602423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010201147,0.000057241523,0.9655376,0.0020898185,0.0016145993,0.00037441982,0.0000013214742,0.00037423833,0.019749606],"genre_scores_gemma":[0.546489,0.0000044679537,0.4505887,0.0009799039,0.00080791797,0.00011070979,0.0000010509048,0.0000059069553,0.0010123195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990888,0.000017053912,0.00011637162,0.0003303389,0.00012030243,0.00032711664],"domain_scores_gemma":[0.9990829,0.00026808417,0.00003575107,0.00040263525,0.000078665966,0.00013192851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023762255,0.000111546346,0.00015031938,0.00003416238,0.000117238305,0.00014418908,0.0007112198,0.00018005451,0.00014803128],"category_scores_gemma":[0.00029764132,0.00007799203,0.00009973127,0.00015082043,0.00004507417,0.00020390771,0.00019541135,0.0002315174,0.00017344255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047120357,0.000050945524,0.00041644936,0.0000049091163,0.000003221,0.0000031100371,0.00036298478,1.3637001e-8,0.00031100615,0.97193295,0.00073586614,0.026173811],"study_design_scores_gemma":[0.0010908319,0.00030029975,0.012006156,0.00001793212,0.000008877058,0.0000397266,0.000025607216,0.014704026,0.0016314967,0.83569074,0.13399023,0.0004941132],"about_ca_topic_score_codex":0.00000855137,"about_ca_topic_score_gemma":0.000032943648,"teacher_disagreement_score":0.53628784,"about_ca_system_score_codex":0.000008177227,"about_ca_system_score_gemma":0.00003048939,"threshold_uncertainty_score":0.31804228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0997182,0.00013343213,0.5034629,0.00013196503,0.00007308982,0.000064533095,4.242192e-7,0.00023115882,0.3961843],"genre_scores_gemma":[0.94252646,3.5627124e-7,0.051968347,0.000050007133,0.000054175125,0.000007026333,0.0000023335608,0.0000029325458,0.005388371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925256,0.000065158085,0.00010500015,0.00023577946,0.00015484894,0.00018666704],"domain_scores_gemma":[0.99957895,0.0001013419,0.000052174924,0.00017136929,0.00005741435,0.000038766102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018420412,0.00009383045,0.000102197715,0.000041464533,0.00008973402,0.00012227146,0.00035970565,0.000027989881,0.000025143698],"category_scores_gemma":[0.000009552998,0.00005610908,0.000020175003,0.00019200488,0.000047434027,0.00031964824,0.000065865344,0.00006034521,0.00006027888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010914084,0.00009372271,0.03853808,0.0000107026735,0.000016696855,0.00002571223,0.021504171,0.00009338638,0.00005360426,0.9280588,0.008892658,0.0027015414],"study_design_scores_gemma":[0.004178085,0.0033466807,0.2062016,0.00033579025,0.000039390547,0.00014294992,0.02293065,0.045764435,0.012459986,0.64540875,0.0559812,0.0032105143],"about_ca_topic_score_codex":0.00034956055,"about_ca_topic_score_gemma":0.00016487313,"teacher_disagreement_score":0.84280825,"about_ca_system_score_codex":0.00001179979,"about_ca_system_score_gemma":0.000052187093,"threshold_uncertainty_score":0.22880618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010433369,0.00029641605,0.9354141,0.0015880662,0.0016209617,0.00031181038,0.000014355764,0.00021372028,0.06043625],"genre_scores_gemma":[0.58236825,0.00013689566,0.3996834,0.015333614,0.0013739277,0.000025367268,0.00003970099,0.000064961154,0.0009739287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651873,0.000052344727,0.0004648333,0.00150386,0.00085911236,0.00060110586],"domain_scores_gemma":[0.99769235,0.00053237524,0.00015585758,0.0011555675,0.00023529356,0.00022857737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004466047,0.00054055394,0.00047675046,0.0006793962,0.00061636826,0.00092834287,0.0019416249,0.00029429496,0.0003416882],"category_scores_gemma":[0.00005327529,0.00047328603,0.00014876576,0.0003873464,0.00071425777,0.0005235366,0.0005781886,0.0008124019,0.00062565383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061512133,0.000074469615,0.000019738038,0.000009466146,0.000016300693,0.00019951358,0.00050122186,0.026793713,0.000056325658,0.8458655,0.00037238724,0.12608522],"study_design_scores_gemma":[0.00047927533,0.000323598,0.00015346157,0.00033499114,0.000010813188,0.00028452394,7.669004e-8,0.18741085,0.0016970373,0.7978724,0.0103190215,0.0011139512],"about_ca_topic_score_codex":0.000008532907,"about_ca_topic_score_gemma":0.00004732885,"teacher_disagreement_score":0.5822639,"about_ca_system_score_codex":0.0002617252,"about_ca_system_score_gemma":0.0008005994,"threshold_uncertainty_score":0.9997719},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017740439,0.0059328135,0.98660654,0.00031279572,0.0013877187,0.0005149192,0.000005242741,0.00011260785,0.0033533107],"genre_scores_gemma":[0.7185941,0.0014492705,0.27649957,0.0014897257,0.0005552268,0.000026197988,0.0000030741455,0.000049739006,0.0013331316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698615,0.000039709783,0.00051962945,0.0013630057,0.0005200023,0.00057148986],"domain_scores_gemma":[0.9973542,0.0005430107,0.0003501838,0.0011071395,0.0004828636,0.00016262001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007884774,0.00047924955,0.00068965845,0.00055469974,0.00031153357,0.00017537794,0.001430304,0.00024698398,0.0000075409635],"category_scores_gemma":[0.00023025036,0.00037303162,0.00009871872,0.0004673868,0.0012853337,0.0004078007,0.0022278156,0.0005072334,0.000007758391],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009720989,0.00010061997,0.00046698577,0.00017261894,0.00007790947,0.0034945412,0.0036309103,0.0008095117,0.00028973012,0.07308741,0.00011611947,0.9177439],"study_design_scores_gemma":[0.0018720676,0.0023631926,0.0005698666,0.0015801062,0.00012869366,0.013801072,0.000008612386,0.26872,0.0033625376,0.6957745,0.008951434,0.002867905],"about_ca_topic_score_codex":0.00004138576,"about_ca_topic_score_gemma":0.0002011051,"teacher_disagreement_score":0.91487604,"about_ca_system_score_codex":0.00012452906,"about_ca_system_score_gemma":0.0003053607,"threshold_uncertainty_score":0.99987215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104321916,0.00034111826,0.9856749,0.00043409006,0.002066642,0.0008286671,0.000040049912,0.00024334944,0.010266841],"genre_scores_gemma":[0.091672,0.000037997754,0.9046962,0.0014135273,0.001121148,0.00004004734,0.000013809428,0.000076456854,0.0009287903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99413466,0.0000515422,0.0006681957,0.0027154393,0.0011459297,0.001284199],"domain_scores_gemma":[0.99629694,0.0008933864,0.00050229416,0.0012333161,0.0006947459,0.00037934037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011142436,0.00087885524,0.0009398698,0.00085234665,0.00059182366,0.0008655427,0.0031358646,0.00053730817,0.000048280694],"category_scores_gemma":[0.00058961916,0.0007990982,0.00024666364,0.00074234215,0.00085166685,0.0006770717,0.0014998777,0.0011585321,0.00007572062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033318913,0.00006853007,0.0001167439,0.00008158203,0.000051393585,0.00016160002,0.0033475836,0.006942942,0.000063693944,0.8085432,0.00013864673,0.18045075],"study_design_scores_gemma":[0.0008295597,0.0004800885,0.00013398753,0.000926905,0.000025607056,0.0001544982,9.983908e-7,0.43965986,0.002597287,0.551843,0.0022645365,0.0010836655],"about_ca_topic_score_codex":0.000171241,"about_ca_topic_score_gemma":0.000164441,"teacher_disagreement_score":0.43271694,"about_ca_system_score_codex":0.0008929724,"about_ca_system_score_gemma":0.0018286124,"threshold_uncertainty_score":0.999446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006524678,0.00062656926,0.9855842,0.0006740881,0.0031687971,0.00050054706,0.000045425786,0.0003619926,0.00838594],"genre_scores_gemma":[0.36509606,0.00007046207,0.62985015,0.0026092797,0.0018767053,0.0000155024,0.00006546751,0.00005954386,0.0003568221],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930774,0.0001020967,0.0009516064,0.0031976607,0.0015851159,0.0010861198],"domain_scores_gemma":[0.9948852,0.0013046334,0.0003792529,0.002113811,0.00060375954,0.0007133314],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082942896,0.00095037924,0.00088854146,0.0010084314,0.000431389,0.0013088769,0.0072585056,0.00055024645,0.00028487545],"category_scores_gemma":[0.00020423002,0.000894143,0.00021845754,0.0012269737,0.0006699925,0.0010394971,0.0023320804,0.0011569753,0.00085635553],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013988808,0.00009226959,0.00010782668,0.0000074065315,0.000022267368,0.00018526927,0.0032954698,0.16157068,0.00008805403,0.046441168,0.00007342609,0.78810215],"study_design_scores_gemma":[0.00006348722,0.00020250633,0.000088049856,0.00022326052,0.00000876968,0.000029595329,0.0000018166979,0.47973567,0.0011035486,0.51587665,0.0019020019,0.0007646382],"about_ca_topic_score_codex":0.00044862594,"about_ca_topic_score_gemma":0.0007440831,"teacher_disagreement_score":0.78733754,"about_ca_system_score_codex":0.00049631315,"about_ca_system_score_gemma":0.0011073728,"threshold_uncertainty_score":0.9999216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021968239,0.00035470145,0.9928681,0.00020545191,0.00064699765,0.00037931642,0.0000035368178,0.000080283484,0.0052419263],"genre_scores_gemma":[0.6558366,0.000018600827,0.34350723,0.00030868824,0.0002472913,0.00001350292,0.000005012674,0.0000154041,0.00004771402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717516,0.000039850984,0.0005668828,0.0011679519,0.00061070756,0.00043944526],"domain_scores_gemma":[0.99790114,0.00028214036,0.000384022,0.0010993385,0.00023550054,0.00009788188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007134963,0.0003689506,0.0004918203,0.0008684017,0.00009311635,0.00012324529,0.0020566403,0.0003228059,0.000011187452],"category_scores_gemma":[0.00004592415,0.0003465244,0.00011336523,0.0007186818,0.000656431,0.00037739764,0.00034879803,0.0004837769,0.000022114327],"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.000005675676,0.000050620147,0.0004537335,0.00003787501,0.0000037191555,0.000007684593,0.0004646735,0.05351905,0.0004865114,0.09166896,0.0000042006213,0.8532973],"study_design_scores_gemma":[0.0003308441,0.000102533086,0.00051732553,0.00014525557,0.000004060118,0.000021501402,1.6244117e-7,0.8824723,0.0022534626,0.11310156,0.0006723975,0.00037861496],"about_ca_topic_score_codex":0.000042483625,"about_ca_topic_score_gemma":0.00019219525,"teacher_disagreement_score":0.8529187,"about_ca_system_score_codex":0.00028073485,"about_ca_system_score_gemma":0.0005256223,"threshold_uncertainty_score":0.9998987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018317868,0.0018208518,0.98071533,0.00068642513,0.0010399069,0.00031632325,0.0000042601578,0.000085624415,0.015148099],"genre_scores_gemma":[0.12602481,0.00028304473,0.87073463,0.0012111309,0.00045191622,0.000015376392,0.0000081082035,0.000050878254,0.0012201235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677813,0.00009832816,0.00048337114,0.0010665684,0.0009409288,0.00063269597],"domain_scores_gemma":[0.99704385,0.0004556448,0.00044109928,0.0015263556,0.00040173644,0.0001313211],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001182687,0.00044814785,0.00052625814,0.00034755367,0.00055114535,0.00037407846,0.0032463467,0.00023120671,0.000007735849],"category_scores_gemma":[0.000112407986,0.00027710706,0.00013320877,0.0005950892,0.003171959,0.00029791135,0.00077843113,0.00057684135,0.00001654571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015789676,0.00003089972,0.00007541486,0.0000308053,0.000020400812,0.000021148297,0.00038589927,0.0019290906,0.000055877026,0.87940794,0.00010128764,0.117925435],"study_design_scores_gemma":[0.00058203866,0.0003707615,0.00047302985,0.00033628283,0.000017494407,0.00011135174,3.4831294e-7,0.20559554,0.0018620922,0.7816731,0.008233041,0.00074494694],"about_ca_topic_score_codex":0.00004042156,"about_ca_topic_score_gemma":0.00021322041,"teacher_disagreement_score":0.20366645,"about_ca_system_score_codex":0.00020617404,"about_ca_system_score_gemma":0.00045889895,"threshold_uncertainty_score":0.9999681},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012159558,0.00020613422,0.99362916,0.0002824655,0.00091363664,0.0009906857,0.000002724683,0.00032090285,0.0035326988],"genre_scores_gemma":[0.16902806,0.000029264087,0.82871205,0.0008936839,0.00068950513,0.00004588932,0.000022853825,0.00005027684,0.00052843365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629366,0.0000385814,0.00043838343,0.0016310554,0.000808945,0.00078935135],"domain_scores_gemma":[0.9971614,0.0002903455,0.00036340643,0.0014127147,0.00054377725,0.0002283655],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007150056,0.0005926872,0.00054276467,0.0005462175,0.00037558516,0.0010371142,0.0029930363,0.00037717118,0.000010564781],"category_scores_gemma":[0.000079882,0.00045066216,0.00012429524,0.0006898039,0.0006623086,0.00082462665,0.00041995873,0.0005348732,0.000029061375],"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.000015926154,0.00015606955,0.00025179688,0.00010077943,0.000019474135,0.00005843732,0.0021103378,0.01205687,0.00003258155,0.219761,0.000023363189,0.76541334],"study_design_scores_gemma":[0.0005018852,0.0014840914,0.00008651853,0.00028282986,0.000017768118,0.00007729299,2.5459454e-7,0.8349906,0.00026997828,0.15940854,0.0021048365,0.0007753741],"about_ca_topic_score_codex":0.000009540827,"about_ca_topic_score_gemma":0.00008285032,"teacher_disagreement_score":0.8229338,"about_ca_system_score_codex":0.00018625899,"about_ca_system_score_gemma":0.0003419759,"threshold_uncertainty_score":0.9999999},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039687115,0.0040718233,0.96020365,0.0001166241,0.00250238,0.00030651133,0.0000025655202,0.00013929502,0.032260302],"genre_scores_gemma":[0.2966468,0.00006664121,0.6989793,0.0005525343,0.0013375594,0.0000054844336,0.000004632876,0.000068870344,0.002338163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971892,0.00012433414,0.0005059546,0.0009913498,0.0006471902,0.00054194237],"domain_scores_gemma":[0.997664,0.00037339816,0.00051143277,0.0010944295,0.00025786035,0.000098908364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011009026,0.00040067124,0.0004070998,0.00046164775,0.0002513297,0.00017291986,0.0028382372,0.00017255903,0.00003743585],"category_scores_gemma":[0.00014025939,0.00030137313,0.00016050095,0.00039289938,0.001279298,0.00045681055,0.0012306083,0.0007548908,0.000016967646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029521796,0.000032225755,0.00060784275,0.000072730494,0.000024044604,0.00014726033,0.009114283,0.0036830786,0.0001784545,0.013138034,0.00016023625,0.9728389],"study_design_scores_gemma":[0.0004630733,0.00024125616,0.0003677467,0.0012340567,0.000040392413,0.0011508202,0.000008986072,0.9444278,0.00029706693,0.020485813,0.02986969,0.0014133025],"about_ca_topic_score_codex":0.000036813966,"about_ca_topic_score_gemma":0.000017921482,"teacher_disagreement_score":0.97142553,"about_ca_system_score_codex":0.0006884548,"about_ca_system_score_gemma":0.0004997869,"threshold_uncertainty_score":0.99994385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116785784,0.0065771714,0.97692925,0.00046917042,0.0020661172,0.00040474496,0.000009978095,0.000043473738,0.013383306],"genre_scores_gemma":[0.75666964,0.0023874817,0.23218663,0.0010735625,0.0015349415,0.000018176232,0.000025803978,0.00010559408,0.005998157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665475,0.000052522963,0.00059305766,0.0011806984,0.0009513893,0.0005675994],"domain_scores_gemma":[0.9959652,0.0010448362,0.00034027227,0.0022333362,0.000300235,0.00011615847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032689602,0.0003663909,0.0005221278,0.0004173276,0.00023023055,0.00044728298,0.0045907306,0.00027742586,0.0000043346],"category_scores_gemma":[0.00034000629,0.00025604985,0.000048657585,0.0005588418,0.0012661796,0.00039409165,0.0036948598,0.0005824955,0.000009358852],"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.00001260443,0.00006409096,0.002221584,0.00032343043,0.000026742098,0.00023303872,0.0035915284,0.001352813,0.000027365255,0.20757021,0.0003615553,0.78421503],"study_design_scores_gemma":[0.0005038434,0.00019485258,0.0015286421,0.00079444685,0.000017810162,0.00023796294,0.0000028883883,0.9252382,0.00008260012,0.045684174,0.024922034,0.0007925644],"about_ca_topic_score_codex":0.000102135156,"about_ca_topic_score_gemma":0.0007893701,"teacher_disagreement_score":0.92388535,"about_ca_system_score_codex":0.00010752966,"about_ca_system_score_gemma":0.00032207338,"threshold_uncertainty_score":0.99998915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031820561,0.00078652654,0.9938703,0.000337728,0.00068739266,0.00063511555,0.000025333422,0.00015493375,0.00032059153],"genre_scores_gemma":[0.6474803,0.000019465659,0.35167482,0.00032532457,0.00024513845,0.000016098733,0.000117013835,0.000022512515,0.00009930169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997286,0.00003742463,0.0003435447,0.0013018198,0.00061174075,0.00041943396],"domain_scores_gemma":[0.9978438,0.00043000825,0.0002807327,0.0009301524,0.00036984673,0.0001454298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004741637,0.00041968856,0.00036129783,0.000450386,0.00043953734,0.0007300078,0.0011646714,0.00017397982,0.000004772801],"category_scores_gemma":[0.000052544954,0.00033870776,0.000054363372,0.00037356938,0.0006664215,0.00066071993,0.00025539324,0.00040167785,0.0000055686933],"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.0001327744,0.00047387357,0.00028305568,0.000535566,0.000064716885,0.00016267326,0.012644372,0.08198094,0.008196727,0.6060909,0.000062499625,0.28937188],"study_design_scores_gemma":[0.00040148615,0.00027043474,0.00045856825,0.0002742541,0.000017160524,0.0001239961,0.0000012718714,0.99004054,0.0025725546,0.005166844,0.0001524943,0.00052039],"about_ca_topic_score_codex":0.000016237931,"about_ca_topic_score_gemma":0.00008760822,"teacher_disagreement_score":0.9080596,"about_ca_system_score_codex":0.00012002448,"about_ca_system_score_gemma":0.000205749,"threshold_uncertainty_score":0.9999065},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006281152,0.000049183713,0.06228048,0.000019277462,0.00047480504,0.0004009685,0.000085916276,0.0001787738,0.9364478],"genre_scores_gemma":[0.002438207,0.0000092392065,0.0038108877,0.000028195042,0.00015298228,0.0000012209825,0.000059529535,0.000015838348,0.9934839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983562,0.000103163315,0.00024166197,0.0006345274,0.00033281738,0.0003315905],"domain_scores_gemma":[0.9978165,0.00014285074,0.00036753612,0.0010681298,0.0004027987,0.00020219742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017558513,0.0003243858,0.00051179476,0.00017918559,0.00026442236,0.00008329904,0.0022076308,0.00050191657,0.000007300041],"category_scores_gemma":[0.000040670227,0.00033399274,0.00028685402,0.000037213125,0.00072410295,0.00018696555,0.0013138822,0.00075948867,0.000020861542],"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.0000112312955,0.00004840144,0.000004250589,0.00007598004,0.000050179933,0.00005400422,0.000096545395,6.96886e-7,0.000046158326,0.947571,0.05095238,0.0010892155],"study_design_scores_gemma":[0.00047746024,0.00010231177,0.00013400438,0.00007159143,0.000078780395,0.000023811204,0.000007350363,0.0009276844,0.00064746535,0.0008919791,0.996203,0.00043455506],"about_ca_topic_score_codex":0.00006575368,"about_ca_topic_score_gemma":0.000017477545,"teacher_disagreement_score":0.946679,"about_ca_system_score_codex":0.00017362846,"about_ca_system_score_gemma":0.00065308326,"threshold_uncertainty_score":0.9999112},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046108707,0.0005263581,0.9902425,0.00018064481,0.0023670082,0.0007259095,0.0000034591635,0.0003246873,0.005168378],"genre_scores_gemma":[0.30933732,0.0000063852376,0.6878952,0.0009168313,0.0010396566,0.000012354331,0.000003202358,0.000041009753,0.0007480559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474573,0.000062538005,0.0006826448,0.0022386438,0.0010351401,0.0012353098],"domain_scores_gemma":[0.9972667,0.0002485223,0.00031891945,0.0015388058,0.00032514712,0.00030190768],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001297142,0.00073542714,0.0007569384,0.000698169,0.00063595094,0.0024014534,0.0037617416,0.00033407978,0.0000034546401],"category_scores_gemma":[0.00012627701,0.00063479727,0.00017699873,0.0010035161,0.00029590272,0.0014068144,0.00178264,0.00078043004,0.000049429207],"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.000004127533,0.000031360167,0.000056560686,0.00011594795,0.00001316759,0.00022088518,0.0027024143,0.04159833,0.0007405603,0.031558048,0.000015259633,0.92294335],"study_design_scores_gemma":[0.0002685385,0.00057139015,0.00007444125,0.0037560724,0.000025249305,0.00044100653,0.0000034322018,0.9701832,0.007875734,0.01014849,0.0043115583,0.0023408812],"about_ca_topic_score_codex":0.000044911296,"about_ca_topic_score_gemma":0.00007785996,"teacher_disagreement_score":0.9285849,"about_ca_system_score_codex":0.00077615207,"about_ca_system_score_gemma":0.0007131052,"threshold_uncertainty_score":0.9996103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13707499,0.001100678,0.8475596,0.0046575894,0.0010407949,0.00015615656,0.000001978724,0.0000428042,0.008365434],"genre_scores_gemma":[0.9815009,0.0005319416,0.016909795,0.00009105597,0.0007316645,0.0000023542682,6.9109836e-7,0.0000081264125,0.00022343453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968782,0.00033196388,0.00065392745,0.00023442261,0.0013732797,0.0005282134],"domain_scores_gemma":[0.997031,0.00046256962,0.00018783992,0.00032160117,0.0017065529,0.00029043836],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027523194,0.0001161882,0.00023637911,0.000503389,0.000575255,0.00019111064,0.0016274494,0.00008183362,0.00018537306],"category_scores_gemma":[0.00040439444,0.00009260908,0.0001667955,0.0009694602,0.00039851392,0.00066281925,0.00030405057,0.0008075266,0.00081952894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015373967,0.0009796813,0.0006928133,0.000018070987,0.00007011468,0.0013225041,0.0034795469,0.00048567803,0.014637563,0.8041507,0.014708902,0.1593007],"study_design_scores_gemma":[0.00019557407,0.002508526,0.0026390227,0.00018282459,0.000012419909,0.004295643,0.00073257077,0.04013323,0.33300406,0.57976687,0.03588528,0.00064401637],"about_ca_topic_score_codex":0.000018999699,"about_ca_topic_score_gemma":0.0000093758845,"teacher_disagreement_score":0.844426,"about_ca_system_score_codex":0.00012346586,"about_ca_system_score_gemma":0.0005650731,"threshold_uncertainty_score":0.99995846},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001654181,0.0020064414,0.9730931,0.0015418353,0.010772052,0.00092362706,0.000003189569,0.00030556586,0.01133767],"genre_scores_gemma":[0.047832094,0.003879537,0.912526,0.01713227,0.005749745,0.000113758615,0.00007808124,0.00016903266,0.012519492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948182,0.00002990785,0.0007729142,0.00204067,0.0010964959,0.0012417772],"domain_scores_gemma":[0.9958839,0.0009897358,0.00046784562,0.0018408573,0.00047117058,0.00034652321],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009834999,0.00083517417,0.00082766096,0.00084550097,0.0005341066,0.003500812,0.0054120123,0.00058147864,0.00003623026],"category_scores_gemma":[0.00021735218,0.0007210413,0.0003960826,0.0006401615,0.0006227196,0.004064918,0.0012879309,0.00078392995,0.0002177542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001301649,0.000035476554,0.00000537866,0.00006576561,0.000013024567,0.000021120542,0.0009835307,0.0013450864,0.000028451976,0.06986768,0.00033933556,0.92728215],"study_design_scores_gemma":[0.0012774502,0.0009933444,0.00017477309,0.0015757955,0.00002257261,0.00016843805,0.0000017192788,0.4526109,0.0022860693,0.32620096,0.21248816,0.0021998242],"about_ca_topic_score_codex":0.0000092536075,"about_ca_topic_score_gemma":0.00006475011,"teacher_disagreement_score":0.9250823,"about_ca_system_score_codex":0.0004423535,"about_ca_system_score_gemma":0.0011465498,"threshold_uncertainty_score":0.9999692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028338246,0.0005301563,0.7780471,0.0005893295,0.00018456684,0.00024560397,1.2651725e-7,0.0007503754,0.21681894],"genre_scores_gemma":[0.8841854,0.000021933152,0.109079234,0.0003630884,0.000100856196,0.0000144650685,0.0000015926637,0.000006112181,0.006227333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990528,0.000046926587,0.00015607539,0.0003137883,0.00016743536,0.00026297686],"domain_scores_gemma":[0.9993522,0.000036959136,0.00006386111,0.0003645813,0.000097974655,0.00008440223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001710452,0.00011154708,0.0001221886,0.000061085535,0.00015379327,0.00022785441,0.0004503378,0.00005849349,0.00016564637],"category_scores_gemma":[0.00009439402,0.00008198579,0.000053244046,0.00043364195,0.000025500123,0.00038225052,0.00011281793,0.00008609236,0.0007601908],"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.0000018847303,0.00016633682,0.008884547,0.000027900385,0.00001562553,0.000018458197,0.001479684,0.000014385667,0.00021067553,0.42383662,0.006365201,0.5589787],"study_design_scores_gemma":[0.0012817961,0.0004365182,0.007616318,0.00009092746,0.000026704603,0.00013562026,0.00009213745,0.7337521,0.0018788651,0.01506558,0.23863894,0.000984538],"about_ca_topic_score_codex":0.000015000571,"about_ca_topic_score_gemma":0.000013236896,"teacher_disagreement_score":0.8813516,"about_ca_system_score_codex":0.000028092123,"about_ca_system_score_gemma":0.000006551822,"threshold_uncertainty_score":0.9770968},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070622686,0.0004523561,0.9620244,0.0017214996,0.0032487053,0.0007072277,0.000004575291,0.0003664423,0.031404164],"genre_scores_gemma":[0.5889812,0.00010238429,0.38321722,0.020554854,0.0046661356,0.000052367803,0.000015200943,0.00014150118,0.0022691383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99472386,0.00005132626,0.0005446909,0.0021687716,0.0011160381,0.0013953376],"domain_scores_gemma":[0.9965539,0.00062658644,0.0002620724,0.0017756111,0.00033026608,0.0004515438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010585566,0.0007375786,0.0006660886,0.0012933081,0.0008117461,0.0007055143,0.0044616717,0.00039919824,0.000039419323],"category_scores_gemma":[0.00020753137,0.0006677349,0.00020331341,0.0012534357,0.0004401941,0.0004813692,0.0028133725,0.0010617934,0.0005564317],"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.0000052444857,0.00008316571,0.00004004885,0.000022710276,0.000011080748,0.00015171478,0.002682778,0.017629145,0.000022826724,0.2065029,0.0002327914,0.7726156],"study_design_scores_gemma":[0.00053955044,0.0009618729,0.0005423823,0.0012693322,0.00001534294,0.00021908403,4.3890898e-7,0.7806597,0.00018319902,0.1956343,0.018054407,0.0019204197],"about_ca_topic_score_codex":0.000066380366,"about_ca_topic_score_gemma":0.0002533121,"teacher_disagreement_score":0.77069515,"about_ca_system_score_codex":0.00057935674,"about_ca_system_score_gemma":0.00037026664,"threshold_uncertainty_score":0.9995774},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002051048,0.005195473,0.0023315344,0.00007297547,0.00021428609,0.00020888426,0.0000011361935,0.00007522731,0.99188],"genre_scores_gemma":[0.05970303,0.001574953,0.0014434988,0.00005661584,0.00017540713,0.00001937777,0.000008390504,0.000025651963,0.93699306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986862,0.00004614861,0.0003967717,0.00043735173,0.00020276509,0.00023074013],"domain_scores_gemma":[0.99858856,0.00028741683,0.00017543849,0.00077985704,0.00011687593,0.000051860916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000269222,0.00021670116,0.0002854536,0.0001360232,0.000087364046,0.00007581384,0.0011056828,0.00022605981,0.00019483024],"category_scores_gemma":[0.00003616376,0.0001394514,0.00014815606,0.000102027574,0.0001062977,0.00013107763,0.000260578,0.00024488932,0.00052935147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004441329,0.000019757481,0.000045854347,0.000004461557,0.000010135078,0.0000039389715,0.0004069458,0.0000062223744,0.00001152474,0.8553968,0.00064487703,0.143445],"study_design_scores_gemma":[0.00017272764,0.000056869896,0.00019895472,0.000051672705,0.0000074844206,0.000008910591,0.000023454626,0.003528882,0.0003011988,0.7129354,0.28250116,0.00021328131],"about_ca_topic_score_codex":0.000072229566,"about_ca_topic_score_gemma":0.00062762207,"teacher_disagreement_score":0.28185627,"about_ca_system_score_codex":0.000053188578,"about_ca_system_score_gemma":0.000118619224,"threshold_uncertainty_score":0.6803919},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005487062,0.00033056425,0.97484744,0.00074407837,0.00070065184,0.00031939935,0.000010317251,0.00006745685,0.022431392],"genre_scores_gemma":[0.6257493,0.00002161462,0.37341496,0.00037081752,0.00034473787,0.000010828587,0.000014868486,0.000009710288,0.00006319047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966465,0.000064621345,0.0006349446,0.0012050301,0.0009641637,0.00048470843],"domain_scores_gemma":[0.9980725,0.0005318106,0.00026682776,0.00070376624,0.00030325624,0.000121840814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095682725,0.00037564558,0.00049608387,0.00061767903,0.00013722003,0.00013776487,0.0016900005,0.00036416514,0.000065253276],"category_scores_gemma":[0.00016777952,0.00032662635,0.00014512557,0.0005658395,0.0014258969,0.0005099242,0.0006576796,0.00073128426,0.000043012773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000905444,0.00012639507,0.0007625521,0.000036358448,0.000004189635,0.00003302998,0.00023079396,0.004928624,0.00008781646,0.8978767,0.000009244234,0.095895275],"study_design_scores_gemma":[0.0003576242,0.00017175493,0.00857473,0.00027078635,0.0000047147214,0.00008326913,7.302593e-8,0.10957667,0.0004077886,0.8798601,0.00025233635,0.00044017538],"about_ca_topic_score_codex":0.000015048373,"about_ca_topic_score_gemma":0.00023285892,"teacher_disagreement_score":0.62520057,"about_ca_system_score_codex":0.0005445146,"about_ca_system_score_gemma":0.001093643,"threshold_uncertainty_score":0.9999186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010720516,0.0020922024,0.9760844,0.00026042422,0.005737824,0.00080906064,0.00002309788,0.00032699143,0.014558813],"genre_scores_gemma":[0.111613154,0.000065759115,0.88090223,0.0010198867,0.0031193718,0.000043421616,0.000024085104,0.00011320217,0.0030988804],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948405,0.00003754211,0.00065920805,0.002455389,0.0007496242,0.0012577411],"domain_scores_gemma":[0.9955755,0.00083185127,0.00045020116,0.0020851875,0.0006890898,0.00036815632],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010288339,0.0009174887,0.0008930086,0.00087993237,0.00075222837,0.0010016159,0.005656329,0.0009817156,0.000048525253],"category_scores_gemma":[0.00041517883,0.0007867401,0.00032320945,0.00069255364,0.0009515327,0.00066893356,0.0018685475,0.0017850288,0.000060038048],"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.000011788488,0.0000557001,0.00006548439,0.00013294605,0.000026980555,0.00004118426,0.0031595952,0.00085298106,0.0010013172,0.23909575,0.00013176922,0.7554245],"study_design_scores_gemma":[0.0010455609,0.0004945576,0.00027280225,0.0009429084,0.000036941005,0.00026033417,3.5653864e-7,0.30651078,0.007121803,0.61269975,0.06844211,0.0021720955],"about_ca_topic_score_codex":0.000013639487,"about_ca_topic_score_gemma":0.00052199006,"teacher_disagreement_score":0.75325245,"about_ca_system_score_codex":0.00030731017,"about_ca_system_score_gemma":0.0012635515,"threshold_uncertainty_score":0.99972355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010942323,0.00030182884,0.77082735,0.00032393236,0.00027437587,0.0005569684,0.0000045630322,0.00038032504,0.2163883],"genre_scores_gemma":[0.74343413,0.000007482244,0.2525651,0.00016488282,0.00007753908,0.00012777046,0.0000037521381,0.000019490071,0.003599855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809784,0.0001290943,0.00029772293,0.0007401502,0.0001824255,0.00055274507],"domain_scores_gemma":[0.9976625,0.0007757952,0.000105700914,0.00081392843,0.00044928805,0.00019280383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008410321,0.0002645609,0.00030804938,0.000083586725,0.00042046365,0.00019440254,0.00064643606,0.000088737266,0.00008879672],"category_scores_gemma":[0.001069796,0.00018535784,0.00010661258,0.00063229544,0.00009671532,0.00048689122,0.000106949425,0.00014144753,0.00006582848],"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.000101007485,0.0008433205,0.013503532,0.00015779726,0.00006949356,0.000012696679,0.003975911,0.00008252307,0.00010703101,0.9568819,0.010413037,0.0138517935],"study_design_scores_gemma":[0.0046600685,0.0012439423,0.016566832,0.0001802961,0.00005392315,0.00014330172,0.0003628814,0.088296965,0.0043213847,0.013890186,0.8687918,0.001488431],"about_ca_topic_score_codex":0.000058250833,"about_ca_topic_score_gemma":0.0009815746,"teacher_disagreement_score":0.9429917,"about_ca_system_score_codex":0.00007942385,"about_ca_system_score_gemma":0.00027164485,"threshold_uncertainty_score":0.7558673},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12644921,0.00011187978,0.820553,0.00073193904,0.00024038952,0.0003361333,3.9715226e-7,0.00012900913,0.051448062],"genre_scores_gemma":[0.95200646,0.000027250308,0.045947883,0.00034337025,0.000059933915,0.000024932226,0.0000017931955,0.0000042252527,0.0015841512],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988708,0.00009917669,0.00019031687,0.00028145316,0.00029209323,0.00026619452],"domain_scores_gemma":[0.9992279,0.00021939536,0.000029139674,0.0004328082,0.000040401104,0.000050378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066729024,0.00010526457,0.000099079545,0.00005415433,0.00013752944,0.00022043976,0.00082191295,0.000050520885,0.00032613633],"category_scores_gemma":[0.000058128233,0.000060398906,0.000048845715,0.00042138385,0.000042546006,0.00020627271,0.00005798465,0.00009948791,0.00051285594],"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.000003098928,0.000076290424,0.000097417775,0.0000014751909,0.0000018135684,0.00001286967,0.0026787699,0.000048900263,0.0000054290226,0.35506502,0.00047116593,0.6415377],"study_design_scores_gemma":[0.0036551098,0.00073509087,0.10740739,0.00015310288,0.00003655817,0.00019383653,0.00093462615,0.30167347,0.0020870904,0.3497203,0.23189081,0.0015125956],"about_ca_topic_score_codex":0.00014061842,"about_ca_topic_score_gemma":0.00036379276,"teacher_disagreement_score":0.82555723,"about_ca_system_score_codex":0.000039137936,"about_ca_system_score_gemma":0.000046514364,"threshold_uncertainty_score":0.65918964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014570412,0.0004325553,0.96786994,0.0019186873,0.00017586825,0.00023635218,4.480329e-7,0.0001268189,0.02778227],"genre_scores_gemma":[0.9678966,0.000019888952,0.03111757,0.00041630387,0.00007838652,0.000030166617,7.034485e-7,0.0000023869934,0.00043799749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995354,0.00003823882,0.00007286831,0.0001519237,0.0000871618,0.000114451635],"domain_scores_gemma":[0.99968266,0.0000550827,0.00003254069,0.00015875866,0.00003187656,0.000039048395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022600457,0.0000576308,0.000074342424,0.000016765802,0.00012863394,0.00011601802,0.00020408341,0.000028420805,0.000010569247],"category_scores_gemma":[0.000020081687,0.000027970054,0.00002556412,0.000068445464,0.00007914068,0.00021774536,0.000059771457,0.00005192275,0.00003994925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006004754,0.00003631494,0.00009078667,0.000002723392,0.000008235105,0.0000032198943,0.00070112234,0.000005617524,0.00003124567,0.6677712,0.00028620698,0.3310573],"study_design_scores_gemma":[0.030206446,0.00062202197,0.021505542,0.00010639447,0.000042175314,0.00031476977,0.00014756384,0.3012808,0.005893949,0.62293726,0.016282,0.0006610833],"about_ca_topic_score_codex":0.000012968303,"about_ca_topic_score_gemma":0.0000060651196,"teacher_disagreement_score":0.96643955,"about_ca_system_score_codex":0.000008327987,"about_ca_system_score_gemma":0.000023299617,"threshold_uncertainty_score":0.11405858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002838989,0.0006933793,0.976649,0.00020531238,0.0030967142,0.0004730918,0.0000067320802,0.00036207636,0.018229794],"genre_scores_gemma":[0.37991425,0.000012683361,0.61660004,0.00049421174,0.0016216191,0.00001990869,0.000020363635,0.000065625136,0.0012513277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495703,0.000054861477,0.0006844224,0.0020629356,0.00103703,0.001203698],"domain_scores_gemma":[0.9971107,0.00042716405,0.00045970007,0.0013648251,0.0004145122,0.00022305788],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00088665757,0.0008027551,0.0007592102,0.00075519754,0.00049792486,0.0011191104,0.0035888297,0.0004832824,0.000022440347],"category_scores_gemma":[0.00008997037,0.00071030704,0.0002407542,0.000790274,0.0015055145,0.0006802071,0.0017097142,0.0010365125,0.000060529703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032337844,0.000029570612,0.0006602476,0.000055679906,0.000018246563,0.0001931902,0.001223859,0.0017897472,0.00010569057,0.027036455,0.000081844046,0.9688022],"study_design_scores_gemma":[0.0012049823,0.0007011536,0.00044050597,0.0010042705,0.000059973052,0.0018032196,0.000004867016,0.69027895,0.0063860966,0.27371696,0.020139173,0.004259824],"about_ca_topic_score_codex":0.00008088001,"about_ca_topic_score_gemma":0.00041663164,"teacher_disagreement_score":0.9645424,"about_ca_system_score_codex":0.00044569725,"about_ca_system_score_gemma":0.00056494965,"threshold_uncertainty_score":0.9999178},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005753021,0.0009943163,0.9748605,0.001461016,0.002291212,0.0004633454,0.0000013497182,0.0004222721,0.019448485],"genre_scores_gemma":[0.32755673,0.00016773098,0.66113305,0.0056719966,0.0016925572,0.000015624488,0.00002197744,0.00008808013,0.003652284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949661,0.0000538587,0.00058490294,0.0020474733,0.0011653691,0.0011823212],"domain_scores_gemma":[0.9970126,0.00027737525,0.00034755628,0.0017259673,0.00034819244,0.0002882689],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009743605,0.00079511566,0.0007340396,0.00072424294,0.00040989037,0.001082814,0.004438567,0.00051483314,0.00002349587],"category_scores_gemma":[0.00006833955,0.0006579547,0.00023965687,0.00094694056,0.0007854074,0.000656698,0.0013894691,0.0010864012,0.00012840713],"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.0000031404134,0.00006541749,0.00008219077,0.000037763813,0.000017246672,0.0001921851,0.0012558177,0.008749274,0.00003810635,0.2419132,0.00006145719,0.7475842],"study_design_scores_gemma":[0.00034979265,0.00042405014,0.00018275311,0.0004965891,0.000020308891,0.00021233417,6.2177855e-7,0.29833913,0.00039371024,0.6904249,0.007829491,0.001326299],"about_ca_topic_score_codex":0.00001589459,"about_ca_topic_score_gemma":0.000096265365,"teacher_disagreement_score":0.7462579,"about_ca_system_score_codex":0.00032747994,"about_ca_system_score_gemma":0.00056922,"threshold_uncertainty_score":0.99995416},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011585575,0.13177544,0.029365445,0.02221133,0.0033935367,0.000978194,0.000008934447,0.00019567783,0.80048585],"genre_scores_gemma":[0.99448055,0.0007684059,0.0034068543,0.0010853242,0.00015703842,0.0000072697044,1.8512183e-7,0.0000032809353,0.00009111078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983946,0.000052455383,0.00028840418,0.000257265,0.0006433422,0.00036395143],"domain_scores_gemma":[0.9984379,0.0001167942,0.00024475082,0.0008131036,0.00025183352,0.00013561193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021945182,0.0001092066,0.00022372151,0.00007833435,0.00020967488,0.000021745796,0.0026276167,0.000023591656,0.000011627366],"category_scores_gemma":[0.00029397415,0.000068066336,0.00009149003,0.0013286836,0.0016543533,0.0009196645,0.00048608027,0.00009667755,0.000052949126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014042156,0.00016084456,0.0015872916,0.00022329947,0.000004453566,4.2635546e-7,0.0015243024,0.0000018388262,0.004117702,0.98106104,0.0019918585,0.009325553],"study_design_scores_gemma":[0.0011507997,0.0008228268,0.02855692,0.0034441792,0.00011858061,0.00015124479,0.000088263434,0.0027377796,0.18547466,0.585597,0.1902818,0.0015759423],"about_ca_topic_score_codex":0.000011066729,"about_ca_topic_score_gemma":4.9605615e-7,"teacher_disagreement_score":0.98289496,"about_ca_system_score_codex":0.000023649707,"about_ca_system_score_gemma":0.00014881388,"threshold_uncertainty_score":0.6095534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005413943,0.003251344,0.99262893,0.00017216546,0.0018983837,0.0006989204,0.000011693284,0.00019884823,0.0005983296],"genre_scores_gemma":[0.46290576,0.000064368774,0.53540164,0.0006530362,0.00052512425,0.000021031046,0.000024132309,0.000050864728,0.0003540273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568665,0.000031299816,0.0006075503,0.0019237038,0.0007395476,0.0010112361],"domain_scores_gemma":[0.9973423,0.0006361719,0.0003554779,0.0012514465,0.00024651564,0.00016809432],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009848505,0.0006590408,0.0006632039,0.0010915485,0.00032752095,0.00113543,0.0030748325,0.00033100665,0.0000052734563],"category_scores_gemma":[0.00030974855,0.00058082625,0.00016021405,0.00078197266,0.00043862232,0.0018673552,0.0013544008,0.0010177187,0.0000111267545],"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.000022251214,0.00011485787,0.0003937504,0.0005007825,0.000015668023,0.0007435489,0.0057200757,0.013689055,0.00089422945,0.06117606,0.000031266773,0.91669846],"study_design_scores_gemma":[0.0008146937,0.00013208388,0.00035471874,0.0024957003,0.0000146631955,0.00014258857,0.0000016639301,0.9383751,0.0021940516,0.053740125,0.00047488752,0.0012597048],"about_ca_topic_score_codex":0.00009248402,"about_ca_topic_score_gemma":0.0008106437,"teacher_disagreement_score":0.9246861,"about_ca_system_score_codex":0.0006210646,"about_ca_system_score_gemma":0.0008834712,"threshold_uncertainty_score":0.9999015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035904633,0.00042514602,0.9750828,0.0005548055,0.0017577689,0.00084258727,0.0000029989958,0.00046996074,0.020504845],"genre_scores_gemma":[0.46621192,0.000027954904,0.53138375,0.00042698998,0.0008201108,0.000037781218,0.000031828902,0.000087140936,0.00097253587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429655,0.000042099375,0.0005303386,0.0023005262,0.0015967918,0.0012337182],"domain_scores_gemma":[0.9968217,0.00027337123,0.00045119404,0.0015947884,0.00048587716,0.00037305572],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00078072737,0.0008943841,0.00070395466,0.00064444914,0.0006538239,0.0012728415,0.0034877125,0.0004316914,0.000018018753],"category_scores_gemma":[0.00008569635,0.0007077676,0.00021117386,0.0008677555,0.0011925161,0.0010114928,0.0011434011,0.0011879549,0.00009636592],"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.00014473607,0.00016009324,0.00021116917,0.0001037128,0.00006492055,0.0004171947,0.0019395272,0.010907865,0.000047065416,0.5726889,0.000027333814,0.4132875],"study_design_scores_gemma":[0.008613517,0.007856129,0.001013718,0.0077743563,0.00016152959,0.0012744467,0.00000610595,0.49071348,0.0055404217,0.46125337,0.008694227,0.0070987106],"about_ca_topic_score_codex":0.00005073917,"about_ca_topic_score_gemma":0.00061895204,"teacher_disagreement_score":0.4798056,"about_ca_system_score_codex":0.00076330436,"about_ca_system_score_gemma":0.0017544864,"threshold_uncertainty_score":0.9997639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01765295,0.00026769727,0.95117974,0.020260261,0.00028806247,0.00077278336,0.000015674088,0.00018469038,0.009378157],"genre_scores_gemma":[0.95457417,0.000012342304,0.041251663,0.0004425536,0.00019894204,0.00020032979,0.000019051084,0.000011985953,0.0032889897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986775,0.000066052875,0.0003433658,0.00033518355,0.00028582045,0.00029210545],"domain_scores_gemma":[0.9980184,0.00016191055,0.00024536857,0.0010166576,0.0004606681,0.00009698723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047421406,0.00013553395,0.00015468,0.00012806403,0.00028376875,0.00013805139,0.0012025128,0.00008951537,0.000024638925],"category_scores_gemma":[0.00037266282,0.000099691555,0.00014701845,0.0007775105,0.00006861316,0.00056262634,0.0002354877,0.00011157569,0.000057613015],"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.0000028772045,0.00039641932,0.0040368284,0.000033455304,0.000042157877,5.726338e-8,0.0026617113,0.00025734547,0.0003184818,0.9485798,0.011575157,0.032095715],"study_design_scores_gemma":[0.0011891598,0.00012046333,0.06561107,0.000038683822,0.00008165137,0.00001321355,0.000078585836,0.39953393,0.007800764,0.010959315,0.5141187,0.0004545029],"about_ca_topic_score_codex":0.000015359024,"about_ca_topic_score_gemma":0.000092613875,"teacher_disagreement_score":0.93762046,"about_ca_system_score_codex":0.000109236025,"about_ca_system_score_gemma":0.00024275981,"threshold_uncertainty_score":0.40653038},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056569586,0.00022596045,0.9158605,0.00002684829,0.00027740587,0.0005018538,0.000008767128,0.000103325954,0.07733841],"genre_scores_gemma":[0.8259267,0.0000064070814,0.17346065,0.00047791094,0.000017222214,0.000030561143,0.0000039741267,0.000009968703,0.00006658106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796474,0.0002886153,0.00037310983,0.0005087238,0.0003123678,0.0005524715],"domain_scores_gemma":[0.99855953,0.000091858245,0.00013554978,0.0006739355,0.0001511669,0.00038793575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585633,0.00023714846,0.00032975548,0.00013938647,0.00011710262,0.00009134257,0.00085276033,0.00009991667,0.00015679264],"category_scores_gemma":[0.00019724382,0.00021377108,0.00012962184,0.000423507,0.00030050325,0.00033406567,0.00009775264,0.000120514254,0.0000851223],"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.00001644037,0.0010304525,0.00085178606,0.00014476047,0.00006298232,0.00005064995,0.0024611184,0.0006740429,0.0010379002,0.84085923,0.00097069045,0.15183997],"study_design_scores_gemma":[0.03253066,0.008999288,0.039816726,0.0020732488,0.0005130437,0.0032977485,0.005259311,0.57704633,0.18717504,0.060367342,0.07162672,0.011294525],"about_ca_topic_score_codex":0.0000044930825,"about_ca_topic_score_gemma":0.0000013432573,"teacher_disagreement_score":0.82026976,"about_ca_system_score_codex":0.000052632153,"about_ca_system_score_gemma":0.00045738168,"threshold_uncertainty_score":0.8717332},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22559464,0.000070834154,0.7608224,0.00018836634,0.00026555682,0.00024150505,0.000005382943,0.00021472434,0.012596586],"genre_scores_gemma":[0.9716988,0.000022410324,0.027738862,0.0002041671,0.000041776264,0.00003147634,0.0000162872,0.000010427776,0.00023578624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982811,0.000043246902,0.0003859306,0.00055840454,0.00029620677,0.00043509615],"domain_scores_gemma":[0.9991095,0.00010826183,0.00009909267,0.00051531807,0.000029177236,0.00013866196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002062041,0.00019427655,0.00020039779,0.00020272184,0.00017561302,0.000241127,0.00076529704,0.00007940673,0.00007170388],"category_scores_gemma":[0.00006222736,0.00017325554,0.00006110305,0.00033774614,0.000023367911,0.0005558503,0.00039407137,0.00016096514,0.0001254736],"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.000014945156,0.00041900633,0.41549772,0.000014588126,0.000072401854,0.00014787742,0.019688636,0.0014580674,0.0034084774,0.55783206,0.00043743497,0.0010087597],"study_design_scores_gemma":[0.0131760575,0.00035594302,0.58772194,0.00029284132,0.000039716007,0.0000693748,0.018632635,0.06130003,0.032979913,0.28209394,0.0011649014,0.0021726668],"about_ca_topic_score_codex":0.0032495938,"about_ca_topic_score_gemma":0.0062952195,"teacher_disagreement_score":0.7461042,"about_ca_system_score_codex":0.00044531605,"about_ca_system_score_gemma":0.00009521364,"threshold_uncertainty_score":0.70651555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083928625,0.00091243343,0.9782267,0.000981851,0.001256857,0.00060643925,0.0000038872713,0.00014345699,0.017029064],"genre_scores_gemma":[0.8130724,0.000036664445,0.18314019,0.0025882774,0.0003511444,0.000024991386,0.0000038216117,0.00003675097,0.00074574386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471253,0.000077270306,0.00089827226,0.0021064267,0.0009984828,0.0012070293],"domain_scores_gemma":[0.9971642,0.0005918783,0.00021303259,0.0014620356,0.00024275138,0.00032608406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001229945,0.0007242981,0.0010150905,0.0018188799,0.00015302874,0.0004796038,0.004249632,0.00043775397,0.000028846991],"category_scores_gemma":[0.000134091,0.00067241146,0.00015002652,0.0014127935,0.000953783,0.0006418029,0.0019173668,0.0011198673,0.00016683318],"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.000024534547,0.00016038008,0.0011055947,0.00005990948,0.000009380638,0.0004426265,0.00689047,0.27390593,0.000065342014,0.068642266,0.00010752855,0.64858603],"study_design_scores_gemma":[0.00084411463,0.00021659772,0.0014757299,0.00097866,0.000005015677,0.00010782878,0.0000024889446,0.90032446,0.00046204138,0.08966462,0.0045804903,0.0013379201],"about_ca_topic_score_codex":0.00017879454,"about_ca_topic_score_gemma":0.006176287,"teacher_disagreement_score":0.81223315,"about_ca_system_score_codex":0.0009950501,"about_ca_system_score_gemma":0.0009629125,"threshold_uncertainty_score":0.9995727},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008702423,0.0026114916,0.0053921686,0.011227049,0.0034568773,0.00039341734,0.000011676776,0.00012802544,0.97590905],"genre_scores_gemma":[0.015569642,0.001761865,0.0008764676,0.002502112,0.001027942,0.00006359124,0.00013677626,0.00003623641,0.9780254],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99725056,0.00006117309,0.0006509214,0.000920904,0.00058735046,0.00052908534],"domain_scores_gemma":[0.998248,0.00032903277,0.00040258453,0.00027014824,0.00030381716,0.00044645366],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044882562,0.00041708245,0.000600574,0.00019773314,0.00025440037,0.00008350211,0.0008394024,0.0012188954,0.0028361029],"category_scores_gemma":[0.00032816263,0.00036335704,0.000062620624,0.00012603546,0.00050017383,0.00032944372,0.0004080571,0.000862434,0.000097465185],"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.000036090732,0.0001533971,0.0028705099,0.00019419039,0.00032754967,0.00031711056,0.0009028062,0.0000032408088,0.0000029736998,0.43052006,0.5401998,0.024472263],"study_design_scores_gemma":[0.002138263,0.00035968435,0.01085178,0.00019713149,0.00013975365,0.0058867554,0.00003331194,0.020365877,0.000017398845,0.027092023,0.93180674,0.001111291],"about_ca_topic_score_codex":0.041125737,"about_ca_topic_score_gemma":0.1382569,"teacher_disagreement_score":0.40342805,"about_ca_system_score_codex":0.00029974995,"about_ca_system_score_gemma":0.00083819544,"threshold_uncertainty_score":0.99988186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002132444,0.00027524238,0.9841341,0.00012471693,0.001185668,0.00090620184,0.0000031294571,0.00004473751,0.011193811],"genre_scores_gemma":[0.9512458,0.000012519058,0.047874093,0.00051820907,0.00019976479,0.000022963759,0.0000024030676,0.000030024052,0.000094234776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678695,0.0001494458,0.00040948714,0.0011548693,0.0007977413,0.00070151157],"domain_scores_gemma":[0.99137205,0.007004915,0.00016425874,0.0010718374,0.00029884718,0.0000880674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0058892434,0.00039888002,0.00052693347,0.00081179437,0.00018510624,0.00019206964,0.003047528,0.00029403585,0.000007695949],"category_scores_gemma":[0.0002866639,0.00027506505,0.00015873752,0.0007440582,0.0006495667,0.00022327683,0.0007585402,0.0007589411,0.000013228289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009349327,0.00010021181,0.00059478235,0.0002651238,0.000017026492,0.000058168425,0.0017717954,0.019062726,0.00025802408,0.5503694,0.000011708822,0.42739752],"study_design_scores_gemma":[0.0010961237,0.0009490389,0.003653976,0.002884442,0.000009330172,0.000037859525,7.1098583e-7,0.41060695,0.023372047,0.5559676,0.0004537331,0.00096814655],"about_ca_topic_score_codex":0.000030468023,"about_ca_topic_score_gemma":0.00010051343,"teacher_disagreement_score":0.94911337,"about_ca_system_score_codex":0.00029267257,"about_ca_system_score_gemma":0.00043130844,"threshold_uncertainty_score":0.99997014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017026488,0.00020051008,0.9727951,0.00009243348,0.0016449483,0.00028393685,0.000010894949,0.00024983272,0.007695841],"genre_scores_gemma":[0.9970455,0.0000015318968,0.0026284284,0.00004268706,0.00021877543,0.000016265047,0.000005263242,0.000010960866,0.0000305649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800235,0.0000762462,0.0006258071,0.00039460865,0.00058691064,0.00031404765],"domain_scores_gemma":[0.998761,0.00014059867,0.00026196992,0.000368668,0.00032561796,0.0001421405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046694005,0.00025097103,0.0004154609,0.00032446714,0.00005739033,0.00021491616,0.0009934065,0.00010449105,0.000007455298],"category_scores_gemma":[0.00007199814,0.00022123347,0.00012958114,0.00017264532,0.000018441078,0.00018268658,0.000053774074,0.00018916655,0.000019749541],"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.000020353964,0.000051431663,0.00028434247,0.00009963941,0.000053119817,0.00005333783,0.00023578486,0.30583593,0.0056025865,0.6872278,0.000021845293,0.00051380537],"study_design_scores_gemma":[0.0004572822,0.00016137012,0.00038269348,0.00093555794,0.0000070878878,0.000049346843,0.00014180191,0.9960819,0.001051485,0.00015043965,0.00035571662,0.0002253027],"about_ca_topic_score_codex":0.000024790374,"about_ca_topic_score_gemma":3.1583846e-7,"teacher_disagreement_score":0.98001903,"about_ca_system_score_codex":0.00029123973,"about_ca_system_score_gemma":0.00010112928,"threshold_uncertainty_score":0.9021639},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002843636,0.0012075688,0.983387,0.00020286161,0.0043503535,0.0007214209,0.000004077562,0.00039437064,0.009703896],"genre_scores_gemma":[0.35990155,0.00022119995,0.6335964,0.0011045873,0.0021714047,0.000094399984,0.00001290928,0.00008570866,0.002811807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611616,0.000037516842,0.0005184766,0.001726075,0.00073372485,0.0008680386],"domain_scores_gemma":[0.99715537,0.00055152504,0.0003736482,0.0012893457,0.0004257884,0.00020430009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007520974,0.00058911525,0.0007053509,0.0006961003,0.00055662706,0.00049238093,0.0031251602,0.0004517295,0.000006371286],"category_scores_gemma":[0.00013604372,0.0004976749,0.00025192506,0.0005793138,0.00047289568,0.0006139921,0.00078459614,0.0005749111,0.00008850091],"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.00002263966,0.00007432133,0.00005281467,0.00045426728,0.000036998284,0.00020878647,0.0015963205,0.012436112,0.00021518853,0.1737766,0.0005004214,0.81062555],"study_design_scores_gemma":[0.00083878107,0.00058457267,0.00010683192,0.00084718753,0.000030015177,0.0008777328,8.0357194e-7,0.8868011,0.0020000902,0.0893359,0.017103203,0.0014737663],"about_ca_topic_score_codex":0.000022553908,"about_ca_topic_score_gemma":0.0000867869,"teacher_disagreement_score":0.874365,"about_ca_system_score_codex":0.00071116496,"about_ca_system_score_gemma":0.00074552314,"threshold_uncertainty_score":0.9997475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07331135,0.00025286857,0.80760866,0.0007462908,0.0040349243,0.0007882794,0.0000052303994,0.0009501289,0.112302236],"genre_scores_gemma":[0.799059,0.0000014358397,0.1941684,0.00031957726,0.0003767632,0.00010180616,0.000008874989,0.00001995564,0.005944186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833685,0.0000296149,0.0002604706,0.0005555661,0.00033022047,0.00048725444],"domain_scores_gemma":[0.9985206,0.00032581232,0.00012047403,0.00050004566,0.00036697186,0.00016605465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084728486,0.00018349996,0.00021872371,0.000086531945,0.00034802398,0.00024189957,0.00076867896,0.00013681831,0.000040388422],"category_scores_gemma":[0.0005246394,0.00014888817,0.0000942972,0.0002465894,0.00005758554,0.00038172063,0.00024843815,0.00029489165,0.00006766967],"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.000057469748,0.00028819917,0.0029012905,0.000071000715,0.00005426086,0.0000172455,0.004292978,0.00064928766,0.016241707,0.9204771,0.028430546,0.026518896],"study_design_scores_gemma":[0.003429712,0.0005319844,0.014879646,0.00044359028,0.00003510248,0.00023842334,0.0001171785,0.8204523,0.017525267,0.029102312,0.11175735,0.0014871468],"about_ca_topic_score_codex":0.000053018583,"about_ca_topic_score_gemma":0.00012348192,"teacher_disagreement_score":0.8913748,"about_ca_system_score_codex":0.000027285876,"about_ca_system_score_gemma":0.00018052074,"threshold_uncertainty_score":0.60714835},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93288267,0.019895336,0.040840358,0.000717488,0.00097103725,0.000053604446,4.4158313e-7,0.00033889583,0.004300202],"genre_scores_gemma":[0.9860952,0.00065305753,0.0129706655,0.00005523794,0.000155592,0.0000010659318,5.950407e-7,0.000007821886,0.00006075643],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986178,0.00013516813,0.00043548862,0.00020992562,0.0002786283,0.00032293386],"domain_scores_gemma":[0.9990727,0.00014631906,0.0003260315,0.00017894852,0.00010578454,0.0001702346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071869505,0.00016286258,0.00035856038,0.00045264358,0.00007533865,0.00019587166,0.00046778156,0.00017902956,0.000038485436],"category_scores_gemma":[0.00028291822,0.00011461956,0.00011083538,0.00079555885,0.00004853224,0.0005035582,0.00014445321,0.0007902592,0.000005762428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056690016,0.0005066805,0.06578331,0.00002530213,0.00011315246,0.002379723,0.005767103,0.00067358545,0.0005794705,0.021719458,0.0030510207,0.8993445],"study_design_scores_gemma":[0.0022311257,0.00056743284,0.54562247,0.0010723446,0.00006242903,0.0061878036,0.00029987955,0.4320608,0.00032494526,0.003074351,0.007895595,0.00060079404],"about_ca_topic_score_codex":0.0000070893298,"about_ca_topic_score_gemma":0.0000060039188,"teacher_disagreement_score":0.8987437,"about_ca_system_score_codex":0.000058259917,"about_ca_system_score_gemma":0.000044171033,"threshold_uncertainty_score":0.467405},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008148235,0.0007643843,0.94815135,0.00062694075,0.0021030214,0.000505709,0.0000024758103,0.00030312725,0.04746148],"genre_scores_gemma":[0.63692594,0.00010162995,0.35664177,0.0019215064,0.0012207326,0.000027472459,0.000015307305,0.00007726258,0.0030683493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561155,0.000045644738,0.0006065949,0.0018329785,0.0010561198,0.0008471149],"domain_scores_gemma":[0.99695784,0.00029026595,0.00036451084,0.0016727613,0.00045874072,0.00025589493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008653329,0.0006536709,0.0005967867,0.0008740214,0.00043166857,0.0006873092,0.0037329737,0.0004260463,0.000052795323],"category_scores_gemma":[0.0001640486,0.00056360965,0.00018884649,0.0008397424,0.0010003765,0.0007787951,0.0012472281,0.00095676584,0.00027997728],"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.0000045444185,0.000058672475,0.000112162495,0.00007411111,0.000012663726,0.00015935916,0.0012567866,0.0055203866,0.000119845135,0.4594996,0.00001786826,0.533164],"study_design_scores_gemma":[0.00060916255,0.00038431233,0.00047778408,0.0008699556,0.000017722228,0.00021109654,2.870274e-7,0.11665006,0.0024647808,0.87417024,0.0028548785,0.0012896877],"about_ca_topic_score_codex":0.000039537535,"about_ca_topic_score_gemma":0.00015446213,"teacher_disagreement_score":0.63684446,"about_ca_system_score_codex":0.00048221523,"about_ca_system_score_gemma":0.0018468258,"threshold_uncertainty_score":0.99968153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014717692,0.00012967232,0.9894978,0.00020530848,0.0003760223,0.0065087397,0.0000021204837,0.0000994929,0.0030336725],"genre_scores_gemma":[0.047883347,0.0000046867704,0.9503575,0.0005521903,0.0005632135,0.00047417148,0.0000042741754,0.000026302614,0.00013434433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996582,0.000069942944,0.0005273055,0.0013115498,0.0008931437,0.00061606977],"domain_scores_gemma":[0.99739987,0.00008631179,0.00037730727,0.0015904221,0.0003961996,0.00014990682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012449156,0.00044903654,0.0004774214,0.0006609152,0.00031550645,0.0005818029,0.0038276867,0.00025492467,0.0000026007503],"category_scores_gemma":[0.00006444213,0.00031752183,0.0001726395,0.0014165449,0.0004821526,0.0003793002,0.0006956018,0.0005379481,0.000006383329],"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.000009918204,0.00010600608,0.00008986374,0.00007548553,0.000014322745,0.0000059007125,0.003996209,0.036734216,0.0005183094,0.06457331,0.000024207488,0.89385223],"study_design_scores_gemma":[0.00031311435,0.0004499207,0.0004984252,0.00051303254,0.000016835562,0.000092393864,8.7104127e-7,0.935581,0.001400175,0.04779937,0.01246045,0.0008743787],"about_ca_topic_score_codex":0.000023139419,"about_ca_topic_score_gemma":0.000022559954,"teacher_disagreement_score":0.8988468,"about_ca_system_score_codex":0.00014597224,"about_ca_system_score_gemma":0.0004582359,"threshold_uncertainty_score":0.9999277},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031145333,0.00016237698,0.9647293,0.0016972938,0.0014067771,0.00055877573,0.000012205765,0.0001965107,0.030925315],"genre_scores_gemma":[0.26879504,0.0000149604575,0.72805536,0.0015390898,0.0011421527,0.00003421011,0.0000082661745,0.000027742637,0.00038319494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959535,0.000054770353,0.0005047872,0.0018819674,0.0009040247,0.00070096157],"domain_scores_gemma":[0.9972843,0.00045928385,0.00020396804,0.0012788541,0.00046654022,0.0003070798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082977983,0.0005035268,0.0004741774,0.00075178564,0.00048715403,0.00051074877,0.0024997476,0.000308944,0.00007241375],"category_scores_gemma":[0.00024657673,0.00045778175,0.00014950642,0.00080199423,0.00067423977,0.0007010093,0.001450349,0.00087486976,0.0002246462],"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.0000056299955,0.00008873059,0.00009650408,0.00002489409,0.00001404084,0.000038233782,0.002698082,0.012960538,0.00019315157,0.34626248,0.00009796222,0.6375197],"study_design_scores_gemma":[0.00034771295,0.00046581324,0.0020309447,0.0006490061,0.000017542174,0.00021465748,5.633447e-7,0.08259662,0.0020179676,0.906758,0.0033824237,0.001518726],"about_ca_topic_score_codex":0.000038799808,"about_ca_topic_score_gemma":0.00014298382,"teacher_disagreement_score":0.636001,"about_ca_system_score_codex":0.0007574903,"about_ca_system_score_gemma":0.0010813822,"threshold_uncertainty_score":0.9997874},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.757225,0.00045359763,0.035599653,0.0009811993,0.0017520915,0.00040118708,0.0000064944593,0.000725694,0.2028551],"genre_scores_gemma":[0.9919882,0.000041459673,0.0028281184,0.001940601,0.00029976244,0.000020320344,0.0000040646196,0.000007970115,0.0028695068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984793,0.00003403642,0.00028269435,0.00030972096,0.00030085063,0.0005933902],"domain_scores_gemma":[0.9989579,0.000038667462,0.00023480399,0.0004669744,0.00011432569,0.00018733519],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022858621,0.00022044027,0.00022494547,0.000135629,0.00021923937,0.00020551564,0.0010406935,0.00011839014,0.000068302346],"category_scores_gemma":[0.000106220956,0.00017534218,0.0001041559,0.00035633723,0.000072124814,0.0018857331,0.00046821072,0.00020283564,0.0014064979],"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.00007976843,0.00059278007,0.05560541,0.00005688085,0.00012108798,0.00073367497,0.0055346433,0.0013076648,0.0004448631,0.8775944,0.00957936,0.048349444],"study_design_scores_gemma":[0.0036288558,0.0010004893,0.5879208,0.00012500172,0.000044665067,0.0013974854,0.00081493653,0.037648268,0.003622951,0.15648182,0.20486358,0.0024511928],"about_ca_topic_score_codex":0.000026631784,"about_ca_topic_score_gemma":0.000005491629,"teacher_disagreement_score":0.7211126,"about_ca_system_score_codex":0.000063949614,"about_ca_system_score_gemma":0.00006253147,"threshold_uncertainty_score":0.99937105},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02683329,0.006960704,0.94876134,0.004059337,0.0037109307,0.00038178702,0.0000014675771,0.00076044194,0.008530686],"genre_scores_gemma":[0.95997924,0.0002955203,0.038375165,0.00015627727,0.0004801048,0.0000041525727,4.3518736e-7,0.000017347249,0.0006917729],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985232,0.00009870543,0.00046582162,0.00017233509,0.00036393563,0.0003760106],"domain_scores_gemma":[0.9980156,0.0005392631,0.0005986464,0.00033406558,0.0003984799,0.000113944785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010355593,0.0001627145,0.0002600723,0.0001338666,0.00044573928,0.00031953896,0.00097353687,0.00011481418,0.000031633597],"category_scores_gemma":[0.00054500136,0.0001011023,0.00023344152,0.0004020251,0.00005628475,0.0005219286,0.00010718899,0.00030044877,0.000051429066],"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.00018375319,0.0013140183,0.003563041,0.00027540658,0.0016555941,0.00053871656,0.020357162,0.0414739,0.005361182,0.3157883,0.48344237,0.12604655],"study_design_scores_gemma":[0.00073547265,0.00024208252,0.0013539654,0.00013412152,0.000055669145,0.0006398631,0.00009674077,0.97758275,0.00048767807,0.0007249854,0.017801926,0.00014474361],"about_ca_topic_score_codex":0.0000056260915,"about_ca_topic_score_gemma":0.0000036703161,"teacher_disagreement_score":0.9361088,"about_ca_system_score_codex":0.00009700094,"about_ca_system_score_gemma":0.00006115922,"threshold_uncertainty_score":0.41228318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84395784,0.0023499592,0.14240606,0.0014922431,0.0004761128,0.0008045111,0.00001421434,0.000192186,0.008306872],"genre_scores_gemma":[0.99260026,0.00024018102,0.004748292,0.000007600172,0.00010646863,0.0000016497182,0.000023328033,0.000006239009,0.0022659663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99811816,0.0003077138,0.00012219718,0.00043433282,0.0005230412,0.0004945469],"domain_scores_gemma":[0.99826515,0.0001785542,0.00009614344,0.00065932766,0.0005999924,0.00020085952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019958287,0.00011355348,0.00016708499,0.0003038363,0.0007162889,0.000096984346,0.0006901843,0.00007854358,0.000034487242],"category_scores_gemma":[0.0004898746,0.00011587801,0.000042839074,0.00080955744,0.0005100003,0.001791806,0.00048122188,0.00024897433,0.00012737422],"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.00027972824,0.001341135,0.022213483,0.0003842438,0.00019914447,0.000026465696,0.090726286,0.000028504059,0.044367477,0.66136014,0.0254308,0.15364261],"study_design_scores_gemma":[0.0033833582,0.0010113745,0.44939286,0.00013751864,0.00007617089,0.0001534615,0.015247579,0.0045598424,0.0923352,0.04342985,0.38883543,0.0014373824],"about_ca_topic_score_codex":0.00071645126,"about_ca_topic_score_gemma":0.00013233951,"teacher_disagreement_score":0.6179303,"about_ca_system_score_codex":0.00019149709,"about_ca_system_score_gemma":0.00021410479,"threshold_uncertainty_score":0.55091876},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05160077,0.00021813624,0.3283558,0.00071454624,0.0016368901,0.00023533047,0.0000012152956,0.0006665069,0.61657083],"genre_scores_gemma":[0.975892,0.0000082027245,0.021956734,0.0010193803,0.00017000988,0.000013054987,0.000001985043,0.0000054100447,0.0009332113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988966,0.000019795545,0.00023262897,0.00021945707,0.00023344577,0.00039805696],"domain_scores_gemma":[0.9992893,0.000039088703,0.00007514362,0.00036748906,0.00007012119,0.0001588726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002719332,0.00014905678,0.0001536278,0.000070101094,0.00014811309,0.0001719412,0.00066698715,0.00011283449,0.000042359177],"category_scores_gemma":[0.00017801051,0.00010958624,0.00007993091,0.00033613405,0.00007760701,0.00079659914,0.00025762097,0.00021629012,0.0014198544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010862843,0.00005969888,0.0005632275,0.000007895963,0.0000081389035,0.000046152985,0.0018877866,0.00030850145,0.000033166547,0.9886734,0.00029992353,0.008101235],"study_design_scores_gemma":[0.008536361,0.004503079,0.06799152,0.00021787382,0.00006730749,0.0018239085,0.0003678286,0.042512793,0.014720032,0.65493906,0.20084713,0.0034731047],"about_ca_topic_score_codex":0.000032795204,"about_ca_topic_score_gemma":0.00001827267,"teacher_disagreement_score":0.92429125,"about_ca_system_score_codex":0.00006114877,"about_ca_system_score_gemma":0.00017154023,"threshold_uncertainty_score":0.99935764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017029417,0.00013598143,0.98654485,0.006524358,0.00083485886,0.00040032782,0.0000036865129,0.0005124403,0.0033405563],"genre_scores_gemma":[0.60678285,0.0000067032533,0.39003384,0.0018399911,0.00008448337,0.00012917434,0.00001631734,0.000012851445,0.0010937754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979449,0.00010932935,0.0003403672,0.00064703426,0.00050852064,0.0004498729],"domain_scores_gemma":[0.99801576,0.00059779565,0.00010622183,0.00056070485,0.0005316438,0.00018785796],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016847151,0.00028027626,0.00023311267,0.00020363051,0.0005587833,0.00028448942,0.0010137605,0.00013242185,0.00091183226],"category_scores_gemma":[0.000056556924,0.00023043402,0.00016427411,0.00073263573,0.00012378421,0.00059591763,0.00004427169,0.00032362176,0.0021253985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016876093,0.0012453755,0.00012532008,0.00002757179,0.000111012334,0.000040247374,0.00034374587,0.12185588,0.000117023636,0.51676714,0.0024037175,0.35694608],"study_design_scores_gemma":[0.0009812058,0.0005122596,0.020253446,0.000034377223,0.000024686058,0.00013569165,0.00004132777,0.11300915,0.00007935134,0.8547828,0.00945903,0.0006866544],"about_ca_topic_score_codex":0.000037467827,"about_ca_topic_score_gemma":0.000005354377,"teacher_disagreement_score":0.6050799,"about_ca_system_score_codex":0.00008357746,"about_ca_system_score_gemma":0.00013184205,"threshold_uncertainty_score":0.99865156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35531434,0.008391213,0.3429031,0.020816665,0.00077536685,0.008311314,0.00026971832,0.0011621179,0.26205614],"genre_scores_gemma":[0.98652565,0.00013553165,0.011581588,0.0013526417,0.00014180086,0.000051097744,0.00007613581,0.000018529281,0.00011702644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787414,0.000083086,0.0003968032,0.00084769144,0.0004646787,0.0003335792],"domain_scores_gemma":[0.9978583,0.00018553904,0.00034403705,0.0011951649,0.00026600657,0.00015095458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006064986,0.00028339165,0.00038955567,0.000088953755,0.00016032196,0.0000734656,0.0012965658,0.0001391452,0.00004606927],"category_scores_gemma":[0.00007728288,0.0001774469,0.000044070835,0.00031645433,0.00018192649,0.00008990749,0.00040000313,0.00020899608,0.00010529827],"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.00053552433,0.0046991273,0.000832015,0.00044197796,0.00024854374,0.000022583483,0.005721212,0.015121441,0.0026037507,0.39817154,0.14153102,0.43007126],"study_design_scores_gemma":[0.010111107,0.011904211,0.23169462,0.0008058073,0.00054611114,0.0006264459,0.0031136854,0.44459754,0.012440349,0.116416626,0.16135588,0.006387604],"about_ca_topic_score_codex":0.00007058072,"about_ca_topic_score_gemma":0.000009027617,"teacher_disagreement_score":0.6312113,"about_ca_system_score_codex":0.000014317521,"about_ca_system_score_gemma":0.000026224032,"threshold_uncertainty_score":0.7236075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005111401,0.0013402032,0.91565764,0.0007407653,0.0024135476,0.00048757409,0.0000029674982,0.00033506312,0.0789711],"genre_scores_gemma":[0.40675962,0.000031895674,0.58834577,0.001540753,0.0014847104,0.000033135253,0.000005474104,0.00007508455,0.0017235959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949547,0.000052673684,0.0005773972,0.0024228895,0.00086240243,0.0011299064],"domain_scores_gemma":[0.9967465,0.000500023,0.00023307336,0.0018398568,0.00022167996,0.00045887998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010902998,0.00082204846,0.000764753,0.0012512181,0.00045277298,0.0008296157,0.005220021,0.00029504948,0.000040925526],"category_scores_gemma":[0.00016917213,0.0007184881,0.00023439762,0.0012174023,0.0006035617,0.0006611091,0.0029052405,0.0008652752,0.00038602753],"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.0000041087096,0.000069788475,0.000041865667,0.000053377884,0.000013830278,0.0000868797,0.003093525,0.029112894,0.000041800886,0.3919993,0.000043874956,0.57543874],"study_design_scores_gemma":[0.001040942,0.00052475464,0.00017536731,0.0015706321,0.000030565327,0.00020883077,0.0000012411806,0.35949787,0.00457316,0.6151489,0.014362463,0.0028652952],"about_ca_topic_score_codex":0.00004470294,"about_ca_topic_score_gemma":0.0002701724,"teacher_disagreement_score":0.5725735,"about_ca_system_score_codex":0.00068456307,"about_ca_system_score_gemma":0.0013134972,"threshold_uncertainty_score":0.9995266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001675017,0.0005041477,0.9665429,0.00012052893,0.00041696872,0.0004024986,0.0000069130765,0.00008189973,0.031756647],"genre_scores_gemma":[0.3971353,0.00009781644,0.60117996,0.000772413,0.00035972282,0.000009692294,0.000018448447,0.000029925994,0.0003967321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751186,0.000030733336,0.00041343403,0.0011015167,0.0005796256,0.00036281682],"domain_scores_gemma":[0.9985397,0.00017130001,0.00019272816,0.0007364027,0.00020511054,0.00015474464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048292248,0.00033661668,0.00044004197,0.00068696873,0.00014649669,0.0002906905,0.0014118048,0.00022346481,0.0000075901694],"category_scores_gemma":[0.000045002616,0.00030618836,0.00006369721,0.0006173409,0.00033945774,0.00042947437,0.0006413415,0.00030032604,0.0000143180305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008885564,0.000056787263,0.00023193298,0.00007713009,0.000007796746,0.0000069345833,0.0034152088,0.012507661,0.00011379034,0.103631504,0.000026979891,0.8799154],"study_design_scores_gemma":[0.0004717941,0.0003712501,0.003331186,0.0005098078,0.000014186587,0.00011563401,3.3378416e-7,0.79231447,0.0008073355,0.19794242,0.003208035,0.0009135183],"about_ca_topic_score_codex":0.000010766663,"about_ca_topic_score_gemma":0.0000146985385,"teacher_disagreement_score":0.87900186,"about_ca_system_score_codex":0.000105341045,"about_ca_system_score_gemma":0.00022422092,"threshold_uncertainty_score":0.999939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046680827,0.0011685739,0.97241545,0.00096297136,0.0035824492,0.0006501175,0.000007502477,0.0003196544,0.020846577],"genre_scores_gemma":[0.14950864,0.00011036274,0.83647835,0.0038812347,0.0044028866,0.000049237984,0.000013116232,0.00010586042,0.0054502916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950849,0.00003754445,0.0006433943,0.0021706282,0.0009006039,0.0011629415],"domain_scores_gemma":[0.99639493,0.00091783423,0.00037364714,0.0016785243,0.0003446849,0.00029040547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012853967,0.000763038,0.0007906028,0.0007785939,0.0005645965,0.00095619174,0.0050566327,0.0004924403,0.000039545714],"category_scores_gemma":[0.00021314537,0.0006609556,0.00033108547,0.0005525415,0.0005868776,0.00090014644,0.0014547952,0.0009049751,0.000121838915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009828366,0.00003936171,0.00003839239,0.000058932503,0.000014981388,0.00003166972,0.0013848714,0.0057299654,0.00008232288,0.109560035,0.00022409491,0.88282555],"study_design_scores_gemma":[0.00093503133,0.0004983552,0.00018990698,0.0006160235,0.000022373173,0.00015888613,2.5642572e-7,0.59594077,0.0020373666,0.30687758,0.09091938,0.0018041002],"about_ca_topic_score_codex":0.000012722419,"about_ca_topic_score_gemma":0.00015488763,"teacher_disagreement_score":0.88102144,"about_ca_system_score_codex":0.0003831559,"about_ca_system_score_gemma":0.0005209384,"threshold_uncertainty_score":0.99958414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010274115,0.0005931534,0.9266266,0.00032336815,0.0014069434,0.00033139257,0.000008183158,0.0001362539,0.07047135],"genre_scores_gemma":[0.5394505,0.000036147663,0.45559236,0.0015009682,0.0004621614,0.000010188861,0.000011836756,0.000042559135,0.0028932432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535185,0.000039782248,0.00072313653,0.0016771196,0.0014751179,0.00073302194],"domain_scores_gemma":[0.9971249,0.00043005456,0.0005465587,0.0011179677,0.0005337039,0.00024679178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008953998,0.00055285793,0.00070840394,0.0011121603,0.00029822407,0.00045045113,0.0038468852,0.0003256778,0.00014404014],"category_scores_gemma":[0.00016454118,0.00049106264,0.00024778725,0.0010978233,0.0015365015,0.0005074326,0.0013343574,0.00063488074,0.00017285692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005996036,0.00014978819,0.00015327605,0.00007493301,0.000025550395,0.00029912553,0.0016643135,0.026208898,0.000047938636,0.6032732,0.00016653334,0.36793047],"study_design_scores_gemma":[0.0004124634,0.0003742802,0.00050493097,0.00038996976,0.000012071201,0.00033518835,2.1334293e-7,0.43558893,0.0002508723,0.55827904,0.0030987714,0.0007532971],"about_ca_topic_score_codex":0.000031626667,"about_ca_topic_score_gemma":0.00004795082,"teacher_disagreement_score":0.53934777,"about_ca_system_score_codex":0.00023260272,"about_ca_system_score_gemma":0.00092511065,"threshold_uncertainty_score":0.99975413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004656867,0.001193806,0.9905487,0.00047402747,0.002153336,0.0010090742,0.000004370217,0.00025453905,0.004315627],"genre_scores_gemma":[0.062213805,0.00009727415,0.93487316,0.0007777818,0.0009706488,0.00005118856,0.0000068505765,0.000060942977,0.0009483528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949896,0.00004005511,0.0006094334,0.0021876495,0.00095546606,0.0012178058],"domain_scores_gemma":[0.996317,0.0009234766,0.00027231898,0.0015539493,0.0006442841,0.00028895613],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001995474,0.0006799836,0.00070493546,0.0009434881,0.00061206176,0.0011055011,0.004762669,0.0006367257,0.000014882643],"category_scores_gemma":[0.00015965124,0.0005764363,0.00025513698,0.0006471104,0.000842258,0.0006187329,0.0017530676,0.0016573478,0.000050957173],"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.000009583401,0.00011668197,0.000039173872,0.00033636836,0.000026967784,0.000064033746,0.0037599674,0.26117712,0.0009879372,0.41706514,0.000018521328,0.3163985],"study_design_scores_gemma":[0.00019303501,0.0001600656,0.000002809085,0.0002390495,0.000006263977,0.000043359705,1.685568e-7,0.6259367,0.00077919714,0.37124655,0.0009117125,0.00048112756],"about_ca_topic_score_codex":0.0000342529,"about_ca_topic_score_gemma":0.0001387504,"teacher_disagreement_score":0.36475953,"about_ca_system_score_codex":0.00027640714,"about_ca_system_score_gemma":0.00087632216,"threshold_uncertainty_score":0.99993145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08717972,0.00016596627,0.7441723,0.0003141155,0.0007144298,0.00009621044,0.0000010974984,0.00038907278,0.16696712],"genre_scores_gemma":[0.9817957,0.000012451985,0.013870533,0.00028368973,0.00019194362,0.0000024751084,0.000005708977,0.000004525454,0.0038329265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991726,0.000015749272,0.00017402474,0.00026889384,0.00013346023,0.00023521807],"domain_scores_gemma":[0.99928296,0.00018785107,0.00005890166,0.00028952805,0.00008681766,0.000093941286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025885509,0.00009574346,0.000100637444,0.00004974356,0.00013874966,0.00015389358,0.00035540594,0.000068905734,0.00014929826],"category_scores_gemma":[0.00006244194,0.000074086325,0.000039433493,0.00019477705,0.000019031322,0.00036277744,0.00009567282,0.00008607276,0.00040041454],"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.000050920626,0.00058921817,0.052782465,0.000014407447,0.00009166497,0.00015569864,0.0047772406,0.00013710701,0.004316571,0.8512015,0.008682096,0.07720115],"study_design_scores_gemma":[0.0012241867,0.00015670627,0.39562392,0.00003740034,0.000012020879,0.000025768739,0.00008186713,0.09537456,0.028351193,0.005681001,0.47288737,0.00054400455],"about_ca_topic_score_codex":0.00025307058,"about_ca_topic_score_gemma":0.0010212365,"teacher_disagreement_score":0.894616,"about_ca_system_score_codex":0.000040819115,"about_ca_system_score_gemma":0.000024912917,"threshold_uncertainty_score":0.51466525},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3085825e-7,0.0006262893,0.18577339,0.0000584967,0.0008440121,0.00008369383,0.0000012089045,0.0006925959,0.81192017],"genre_scores_gemma":[0.000080843885,0.00005448229,0.036176443,0.0002645842,0.00037787523,0.000007047615,0.0000022981424,0.0000966909,0.96293974],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990999,0.000024404095,0.00009073638,0.00040337123,0.00012899283,0.00025258248],"domain_scores_gemma":[0.9990108,0.000013861641,0.00008022791,0.0007763144,0.00002088664,0.00009793784],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007267132,0.00019712385,0.00020702866,0.00013323656,0.000028542536,0.000073669515,0.0013344489,0.0002149157,0.013092746],"category_scores_gemma":[0.00001053302,0.00014313728,0.00008382847,0.000081768914,0.000038124457,0.00006633934,0.00032944386,0.00011882568,0.008212539],"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":[1.2973067e-7,0.000018259718,0.00002891516,0.000007247058,0.000012898631,0.000006351044,0.000256598,4.005097e-9,4.2974045e-7,0.2539612,0.7397455,0.005962456],"study_design_scores_gemma":[0.000084960586,0.000025356761,0.00003596717,0.00002644211,0.000005016564,0.0000056358317,0.000003031026,0.00007059908,0.000019626179,0.0065924977,0.9929055,0.0002253598],"about_ca_topic_score_codex":0.00042855783,"about_ca_topic_score_gemma":0.0004561433,"teacher_disagreement_score":0.25316,"about_ca_system_score_codex":0.00001565878,"about_ca_system_score_gemma":0.00006510091,"threshold_uncertainty_score":0.9925597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110208086,0.002047327,0.9813081,0.00019914549,0.0033811051,0.0010818678,0.000005632789,0.0003631341,0.011503448],"genre_scores_gemma":[0.20912486,0.000022425047,0.78781843,0.00049813313,0.0015323067,0.000108336055,0.000030979005,0.000085831656,0.00077870063],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949075,0.000044963886,0.0006720764,0.002302985,0.00083116425,0.0012413154],"domain_scores_gemma":[0.9969658,0.00054692006,0.00037096252,0.0013667907,0.00041278233,0.0003367431],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014535001,0.00083584496,0.00077341433,0.0008491157,0.0006504393,0.0010765038,0.0044224947,0.0005492228,0.000014286725],"category_scores_gemma":[0.00012217303,0.0007325901,0.00028616795,0.00067910436,0.0006575949,0.0007096369,0.0017903683,0.00089221983,0.000064093445],"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.00001725298,0.00010735009,0.00017434292,0.00022075749,0.000037242313,0.00014827332,0.013702495,0.008281325,0.00009781224,0.15234475,0.00008534418,0.824783],"study_design_scores_gemma":[0.0014053967,0.00078315666,0.000069499874,0.0024150067,0.000025660645,0.0001764399,0.0000034230472,0.12441243,0.0011597704,0.8470055,0.02052643,0.0020173064],"about_ca_topic_score_codex":0.000022170578,"about_ca_topic_score_gemma":0.0001769764,"teacher_disagreement_score":0.82276577,"about_ca_system_score_codex":0.000900304,"about_ca_system_score_gemma":0.0012209987,"threshold_uncertainty_score":0.9999605},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028309273,0.00044446398,0.00042391536,0.00019161747,0.0021514439,0.000714886,0.000026576907,0.0003608394,0.9954032],"genre_scores_gemma":[0.032366164,0.00013482643,0.0016964409,0.00043089176,0.0009580171,0.000119020726,0.000026734979,0.00011350827,0.9641544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99594295,0.00003876884,0.0007569104,0.0013293594,0.0009772731,0.000954722],"domain_scores_gemma":[0.99759233,0.00008989923,0.0005516893,0.0006499348,0.00081978086,0.00029634236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003394565,0.000803508,0.00077198,0.00043239607,0.00022899797,0.0004654034,0.0027786733,0.00057549455,0.00043188233],"category_scores_gemma":[0.00008166465,0.000734729,0.00016301138,0.00016981122,0.00027050776,0.00031066794,0.0010259259,0.0011468148,0.00009142278],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.000033049997,0.00010882313,0.0013782689,0.00013732899,0.00016264434,0.0005356437,0.0013627361,0.000009402408,0.00004238581,0.6273658,0.35472658,0.014137291],"study_design_scores_gemma":[0.0011630665,0.00009871741,0.005032126,0.00062697224,0.000035607554,0.0001121486,0.000056924204,0.0014029824,0.00014102028,0.021697262,0.9679664,0.0016668116],"about_ca_topic_score_codex":0.040420555,"about_ca_topic_score_gemma":0.16527365,"teacher_disagreement_score":0.61323977,"about_ca_system_score_codex":0.0011856963,"about_ca_system_score_gemma":0.005097566,"threshold_uncertainty_score":0.99951035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015356622,0.0007656201,0.3893866,0.0010969779,0.0003592416,0.00016578793,6.607848e-7,0.00040122587,0.59246725],"genre_scores_gemma":[0.96690005,0.00002842554,0.029890588,0.0016761767,0.0004645344,0.000009508421,0.0000026150824,0.0000037236737,0.0010243707],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895096,0.000017876368,0.000257733,0.00018105033,0.00020567,0.00038669675],"domain_scores_gemma":[0.9993603,0.000042136708,0.00009461012,0.00034268465,0.000055483208,0.000104775034],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003084787,0.00012809935,0.00012772383,0.00005295733,0.00016070624,0.0001672654,0.0007155947,0.000052021947,0.00012869129],"category_scores_gemma":[0.000060706952,0.00009628224,0.00007547511,0.00018866976,0.000029322873,0.00095906586,0.0003675296,0.00011972589,0.0015008457],"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.0000028428233,0.000026283788,0.001992737,0.000015886522,0.000008433712,0.000010048436,0.0017807058,0.00036040734,0.000024557,0.38050243,0.00044450467,0.61483115],"study_design_scores_gemma":[0.0010785698,0.0002993747,0.031443164,0.0000674279,0.0000149004945,0.00015314542,0.00017964105,0.23192497,0.0012063426,0.0056948643,0.7270247,0.0009129344],"about_ca_topic_score_codex":0.0000046297146,"about_ca_topic_score_gemma":0.0000064754836,"teacher_disagreement_score":0.95154345,"about_ca_system_score_codex":0.000043070377,"about_ca_system_score_gemma":0.000027917296,"threshold_uncertainty_score":0.9992766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06722477,0.00013582606,0.9306912,0.000017789856,0.00016401043,0.00024014442,0.0000022081044,0.000119923716,0.0014041492],"genre_scores_gemma":[0.8950993,0.00003912083,0.104215495,0.000027590026,0.000023206709,0.000020735893,0.000007882942,0.0000052253067,0.00056146644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896246,0.000045589262,0.00030811506,0.00034150254,0.000157486,0.0001848258],"domain_scores_gemma":[0.9987953,0.0005826368,0.00012652972,0.00023927787,0.00017612605,0.000080181606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005950289,0.00013313087,0.00023569145,0.00022203935,0.000185772,0.0001949975,0.00028048275,0.0000455988,0.000014685409],"category_scores_gemma":[0.0002165216,0.00009208377,0.00008967183,0.00041698525,0.000025096148,0.00043249928,0.000076657205,0.000059524067,0.000011112899],"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.0003175935,0.00039917076,0.0685516,0.00017934875,0.0014416242,0.00012109441,0.04019684,0.023437167,0.005752182,0.029716339,0.013915597,0.81597143],"study_design_scores_gemma":[0.00022733529,0.00012674798,0.009362941,0.000014722918,0.000035470966,0.000023825905,0.0000501406,0.9883513,0.00036001863,0.0012217618,0.000087826505,0.00013793028],"about_ca_topic_score_codex":0.00015562508,"about_ca_topic_score_gemma":0.00009764162,"teacher_disagreement_score":0.9649141,"about_ca_system_score_codex":0.000031378073,"about_ca_system_score_gemma":0.000049855928,"threshold_uncertainty_score":0.3755067},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012402073,0.13628367,0.06697753,0.00035405133,0.013158975,0.0013614075,0.000020573967,0.0010481931,0.7795554],"genre_scores_gemma":[0.17743471,0.04391275,0.18687782,0.005221454,0.018950816,0.00022298697,0.00014709982,0.0013669115,0.56586546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943024,0.0001950659,0.0012922116,0.0020930937,0.0008712633,0.0012459793],"domain_scores_gemma":[0.99579483,0.001088826,0.0007100105,0.0013230921,0.0008378023,0.00024543132],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0020282462,0.0013310099,0.002025972,0.00045924773,0.001165984,0.00038738723,0.0016909919,0.0004573321,0.0000220979],"category_scores_gemma":[0.0005123141,0.0011684997,0.00037924506,0.00029968016,0.0008793281,0.00036314616,0.0031093895,0.0011189289,0.00013750962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003584106,0.00018643738,0.0036046435,0.0013334956,0.001072508,0.0006369827,0.008934071,0.00045855728,0.000005848004,0.8614622,0.02391895,0.098350495],"study_design_scores_gemma":[0.0033811599,0.0005035105,0.001623108,0.004553697,0.0003307473,0.0002602402,0.0005840697,0.046153255,0.0000131471725,0.8785289,0.05994246,0.004125699],"about_ca_topic_score_codex":0.000057156856,"about_ca_topic_score_gemma":0.000052537438,"teacher_disagreement_score":0.21368995,"about_ca_system_score_codex":0.00031235904,"about_ca_system_score_gemma":0.0001759706,"threshold_uncertainty_score":0.9999441},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42586228,0.0009898352,0.5403551,0.0031754586,0.00091697695,0.00039729,0.0000021546527,0.000048405913,0.028252486],"genre_scores_gemma":[0.9792448,0.000039646922,0.020350356,0.0002071136,0.00010574258,0.0000042520837,6.0237585e-7,0.0000049976575,0.0000424865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841815,0.0001564938,0.0007409488,0.00016265333,0.0002739051,0.00024786138],"domain_scores_gemma":[0.99850714,0.00016721994,0.000636193,0.00022938388,0.00035214593,0.00010790897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066242,0.0001432402,0.00039901058,0.00032574456,0.00004878914,0.000104388586,0.00067445997,0.000105127125,0.00016854706],"category_scores_gemma":[0.000207507,0.00010052582,0.0001294168,0.00043222687,0.00012076026,0.0005545863,0.00012500335,0.00028832757,0.00006521142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019022387,0.00037426903,0.008162182,0.00006343134,0.000038650676,0.00015039473,0.003646474,0.000090825095,0.012708227,0.9676051,0.001928063,0.0052133603],"study_design_scores_gemma":[0.0012364873,0.00070054876,0.021410372,0.0002453886,0.00001503327,0.00086894043,0.00085000746,0.0050428677,0.0004969782,0.9684569,0.00042802823,0.00024843978],"about_ca_topic_score_codex":0.000028800541,"about_ca_topic_score_gemma":0.000019935655,"teacher_disagreement_score":0.5533825,"about_ca_system_score_codex":0.00009553418,"about_ca_system_score_gemma":0.00014241955,"threshold_uncertainty_score":0.40993237},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10016158,0.000066554196,0.88906884,0.0018792795,0.00093863346,0.00018581716,0.0000012808288,0.000119068056,0.007578957],"genre_scores_gemma":[0.98447317,0.000009299045,0.014776496,0.00023619551,0.00025242427,0.000025372497,0.0000030519184,0.0000040961554,0.00021992408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893475,0.00004513673,0.00021748815,0.00036800245,0.00019523363,0.00023936524],"domain_scores_gemma":[0.9992659,0.00013333384,0.00003198475,0.000399238,0.000053560216,0.00011600049],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001157712,0.00010702425,0.00012735261,0.0000986616,0.00010570476,0.00008543346,0.0004986608,0.00003550011,0.00016442488],"category_scores_gemma":[0.000049959413,0.00009328788,0.000041738127,0.00060445844,0.000036268437,0.00016222539,0.00009944308,0.00013662355,0.0026235613],"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.000048066275,0.00219666,0.004588803,0.0000032575003,0.000015980237,0.000032940203,0.023909155,0.00041476692,0.00006485792,0.4218707,0.015652698,0.53120214],"study_design_scores_gemma":[0.0009964284,0.001956407,0.37599885,0.0007960626,0.000040946758,0.000022457863,0.0017309041,0.12086824,0.010404472,0.4168546,0.06687384,0.0034567844],"about_ca_topic_score_codex":0.00010987452,"about_ca_topic_score_gemma":0.00039315614,"teacher_disagreement_score":0.88431156,"about_ca_system_score_codex":0.000052373332,"about_ca_system_score_gemma":0.00008671439,"threshold_uncertainty_score":0.99815303},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08744628,0.000086433174,0.38600084,0.00036881224,0.00037165912,0.00028690594,0.0000027531496,0.00038499435,0.5250513],"genre_scores_gemma":[0.95334905,0.000044490782,0.042993702,0.0011138215,0.00010377195,0.0000455402,0.000012153864,0.000014617683,0.0023228778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985325,0.000023747953,0.0003386758,0.00021534273,0.00035955448,0.0005301932],"domain_scores_gemma":[0.9988357,0.00010543774,0.0001623006,0.0006311063,0.00008712815,0.00017832367],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033682102,0.00023359484,0.00023461277,0.00011799272,0.00032092188,0.00056431047,0.00085002667,0.0000648651,0.00014753414],"category_scores_gemma":[0.000047039575,0.00016523384,0.000059248232,0.0005045962,0.0001298155,0.0017471557,0.00032152582,0.00018880365,0.0010827992],"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.00006632389,0.00012401707,0.044964276,0.000068043715,0.00009406841,0.000058353155,0.017003493,0.000056372028,0.000023371136,0.9071319,0.00477863,0.02563111],"study_design_scores_gemma":[0.0074338345,0.003220616,0.08041442,0.0009827415,0.00013784492,0.0021171584,0.007133685,0.12972505,0.0021990254,0.051147405,0.71195155,0.0035366572],"about_ca_topic_score_codex":0.000024686766,"about_ca_topic_score_gemma":0.000022042219,"teacher_disagreement_score":0.8659027,"about_ca_system_score_codex":0.00007179465,"about_ca_system_score_gemma":0.0001080207,"threshold_uncertainty_score":0.99969494},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004398507,0.00028461748,0.0070927846,0.0015223474,0.0013084374,0.000647913,0.0000084309295,0.00009531103,0.9846417],"genre_scores_gemma":[0.9340763,0.000023079667,0.001785837,0.00047771004,0.00020576752,0.00002679928,0.000010904507,0.000022063454,0.06337154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968375,0.00004338109,0.00078139274,0.00095039635,0.00089507294,0.00049228134],"domain_scores_gemma":[0.998069,0.00013932917,0.00045503,0.0010245614,0.00021602324,0.000096095835],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00083977415,0.00041430557,0.00053979066,0.0005572617,0.0002847505,0.00026365035,0.003006468,0.0002503645,0.000028263921],"category_scores_gemma":[0.000035095924,0.00032915754,0.00012398679,0.000506941,0.0031993985,0.0010784005,0.00085146097,0.00070874806,0.000058420155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000034484037,0.00013116741,0.012499466,0.00006722605,0.000007820633,0.00010003114,0.004729318,0.00026870248,0.00002954533,0.9802405,0.00017299056,0.0017187165],"study_design_scores_gemma":[0.00032779458,0.00031711804,0.029945673,0.0003266226,0.000010126773,0.00007144154,0.000009482054,0.00035235964,0.00003123343,0.9583927,0.009726413,0.0004890475],"about_ca_topic_score_codex":0.004041024,"about_ca_topic_score_gemma":0.11720109,"teacher_disagreement_score":0.9296778,"about_ca_system_score_codex":0.00087817723,"about_ca_system_score_gemma":0.0010657943,"threshold_uncertainty_score":0.9999161},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13715138,0.000040690928,0.8473354,0.000014305161,0.0009879903,0.001054943,0.000005754695,0.00034335285,0.013066204],"genre_scores_gemma":[0.99522495,0.000028814917,0.0022022745,0.000028465893,0.0001466899,0.000012143104,0.000025255125,0.00001972906,0.0023116567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818283,0.00017071306,0.00015469707,0.0010536761,0.000063145744,0.00037495443],"domain_scores_gemma":[0.99820536,0.0002150444,0.00028781267,0.000814031,0.0003323129,0.000145413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003302336,0.00031016965,0.00032237146,0.00027563554,0.00025962357,0.00013380658,0.0014422934,0.00031927027,0.0000129869],"category_scores_gemma":[0.00011323228,0.00032646017,0.0002351426,0.0004878529,0.00008445955,0.0004465796,0.0011874418,0.00038683842,0.00009166667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062991356,0.00012775518,0.0033336852,0.00020188687,0.00013287805,0.00006302262,0.0011809235,0.0017737248,0.000058839232,0.9890559,0.00018239976,0.0038259919],"study_design_scores_gemma":[0.0018437854,0.0004754218,0.011512395,0.00033987404,0.00025535605,0.00001034871,0.00012801366,0.48125678,0.0022972717,0.49844176,0.0020912383,0.001347756],"about_ca_topic_score_codex":0.00009146791,"about_ca_topic_score_gemma":0.000043758013,"teacher_disagreement_score":0.8580736,"about_ca_system_score_codex":0.0002279287,"about_ca_system_score_gemma":0.00017464695,"threshold_uncertainty_score":0.99991876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07245784,0.00397987,0.16311373,0.0019482757,0.0020735743,0.0007400995,0.0000019586037,0.0004700749,0.7552146],"genre_scores_gemma":[0.99016094,0.00018701087,0.0068328097,0.00039263867,0.000055695706,0.000029832594,4.5109712e-7,0.0000033850968,0.0023372236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990764,0.000020693293,0.00026355576,0.00013035987,0.00018977409,0.00031920036],"domain_scores_gemma":[0.99885297,0.00026159373,0.00015110351,0.00050882547,0.00016581299,0.000059711565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023006169,0.000102009726,0.00011687418,0.000025599278,0.00017366097,0.00011509119,0.0011704391,0.000049748553,0.000026175509],"category_scores_gemma":[0.0002225285,0.00005739978,0.00006320815,0.00023122152,0.00012697295,0.00085811154,0.00027525972,0.00012570762,0.00083880423],"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.0000041525236,0.000021900334,0.0009328707,0.000015886402,0.00001127764,0.000001804495,0.0005906596,0.00007791852,0.0001681577,0.83966863,0.004076022,0.15443069],"study_design_scores_gemma":[0.0011259837,0.00088322366,0.11371908,0.000079239064,0.000010733778,0.0001023818,0.00025442793,0.090485044,0.007882833,0.23333229,0.5512158,0.0009089462],"about_ca_topic_score_codex":0.000025463349,"about_ca_topic_score_gemma":0.000008686356,"teacher_disagreement_score":0.9177031,"about_ca_system_score_codex":0.000012809329,"about_ca_system_score_gemma":0.000046237747,"threshold_uncertainty_score":0.99993914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030319389,0.00009808909,0.7725206,0.0014739959,0.00070648413,0.0001561051,0.0000027167007,0.00026428213,0.19445834],"genre_scores_gemma":[0.7824287,0.000023970166,0.014661035,0.00045069898,0.00058812887,0.0000048438906,0.000010648639,0.000010252871,0.20182173],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939126,0.000022130975,0.00014469452,0.00017832265,0.00013577593,0.00012779432],"domain_scores_gemma":[0.9995595,0.000026578731,0.00006878612,0.00021658457,0.00005527558,0.000073280426],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000071838294,0.00007332197,0.000111240304,0.00006048688,0.000039704126,0.00004513257,0.0002866548,0.000043910706,0.003091392],"category_scores_gemma":[0.000020238529,0.00005980493,0.00005088384,0.00021112396,0.000012497714,0.0003193446,0.0000794896,0.000034507455,0.0011221858],"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.000020392787,0.00036423956,0.0016666511,0.000019855179,0.0000756779,0.000006694309,0.0023169012,0.000008804685,0.33788174,0.12693983,0.2012003,0.3294989],"study_design_scores_gemma":[0.003209386,0.0008900849,0.10284397,0.00006513667,0.000048527225,0.000096139534,0.000017395612,0.30527598,0.12315007,0.0032759923,0.45980653,0.0013207947],"about_ca_topic_score_codex":0.000013460708,"about_ca_topic_score_gemma":0.000001292987,"teacher_disagreement_score":0.7578596,"about_ca_system_score_codex":0.000013801768,"about_ca_system_score_gemma":0.000027793252,"threshold_uncertainty_score":0.99965554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.165097,0.03756973,0.7659598,0.0013566717,0.00046143497,0.013912194,0.00007453975,0.00017166373,0.015396962],"genre_scores_gemma":[0.99718523,0.000035811296,0.00072934444,0.000028988217,0.000013570078,0.0019395126,0.0000021610415,0.000007827923,0.00005752988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845856,0.00048532922,0.00038164118,0.00031605776,0.00019890114,0.00015950087],"domain_scores_gemma":[0.99733585,0.0005911972,0.0003085865,0.0014349741,0.0002470259,0.00008235069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007623157,0.00016324663,0.00034707502,0.00004442506,0.00020564644,0.000050142527,0.0010792669,0.0000596765,3.2598973e-7],"category_scores_gemma":[0.000042633357,0.00008243016,0.000028264114,0.0004215092,0.0004929244,0.00007035926,0.00045224972,0.0001302596,0.0000040421255],"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.000019349656,0.000997527,0.025960587,0.00019319954,0.000055412296,2.5545535e-7,0.019600268,0.00029459092,0.0002634836,0.9516894,0.00048190067,0.00044400716],"study_design_scores_gemma":[0.0148327835,0.0017389035,0.20382962,0.0031584438,0.00013448331,0.00025020455,0.07446822,0.5769903,0.0021797398,0.025362113,0.09433499,0.0027201714],"about_ca_topic_score_codex":0.00060958765,"about_ca_topic_score_gemma":0.0001461436,"teacher_disagreement_score":0.9263273,"about_ca_system_score_codex":0.000080882615,"about_ca_system_score_gemma":0.00008427937,"threshold_uncertainty_score":0.33614042},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002611729,0.0013917824,0.9733904,0.00086584844,0.0013316289,0.0012031555,0.00002356226,0.0005507767,0.020981658],"genre_scores_gemma":[0.10611263,0.00012944588,0.8871863,0.0013022957,0.001576779,0.00012024161,0.000031949898,0.00014900627,0.003391374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926092,0.000074422445,0.0010392675,0.0029418136,0.0015041559,0.0018311428],"domain_scores_gemma":[0.99439853,0.0013339914,0.00080674846,0.0021732615,0.0007420861,0.0005453616],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0016189622,0.0013229705,0.0012682867,0.0010152133,0.0008678187,0.0010802301,0.004791206,0.0008419654,0.00002904094],"category_scores_gemma":[0.0003845077,0.0010389789,0.0004088237,0.0010280949,0.0010999914,0.0020498247,0.0016061068,0.0015865597,0.00009426051],"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.000057027588,0.00010940259,0.00009414577,0.00012763054,0.000060897462,0.00015136895,0.0040251696,0.0039216853,0.000027629787,0.443048,0.00010899736,0.5482681],"study_design_scores_gemma":[0.002027157,0.0012146203,0.00025488363,0.0022563143,0.000075711,0.0006965314,0.0000020192515,0.7548854,0.0009716919,0.19061118,0.04428153,0.0027230077],"about_ca_topic_score_codex":0.000028569384,"about_ca_topic_score_gemma":0.00028284214,"teacher_disagreement_score":0.7509637,"about_ca_system_score_codex":0.00063152413,"about_ca_system_score_gemma":0.0011475969,"threshold_uncertainty_score":0.9999567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52835405,0.00006788262,0.43341592,0.0010153984,0.0015599815,0.0020182978,0.000019886733,0.00045113018,0.033097465],"genre_scores_gemma":[0.8695591,0.000009939344,0.12900496,0.0007388408,0.00010878351,0.00016172856,0.00002261779,0.0000113828155,0.00038265405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984542,0.000015462287,0.00047841825,0.0002611047,0.0002196611,0.00057116797],"domain_scores_gemma":[0.99882305,0.00012518813,0.00023763461,0.00045909855,0.00012128951,0.00023374526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049621036,0.0002471276,0.0002725638,0.00012779106,0.00031232444,0.0005911132,0.00066464586,0.000144283,0.000039026567],"category_scores_gemma":[0.00011454818,0.00019199787,0.00009343545,0.00021724086,0.0001640707,0.0011439873,0.00037324204,0.0002788806,0.000105908024],"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.000010824641,0.00012231762,0.0015456213,0.00022709636,0.000064735264,0.0000045222455,0.00635052,3.8268817e-7,0.0024201816,0.48050958,0.0006960391,0.5080482],"study_design_scores_gemma":[0.015002911,0.0032863212,0.013146152,0.0007742345,0.00013517604,0.0012067074,0.0045669265,0.31627345,0.03036632,0.17928585,0.43171704,0.004238903],"about_ca_topic_score_codex":0.000010006952,"about_ca_topic_score_gemma":0.000028454582,"teacher_disagreement_score":0.5038093,"about_ca_system_score_codex":0.000039155853,"about_ca_system_score_gemma":0.00010916609,"threshold_uncertainty_score":0.78294456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2719011,0.00010547731,0.71398175,0.0011813493,0.0006811379,0.0015295327,0.00020233977,0.0009841995,0.009433114],"genre_scores_gemma":[0.89220375,0.00008897819,0.09512572,0.00006227323,0.00025677818,0.000006101975,0.00020358499,0.00004198194,0.012010841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946743,0.0006474701,0.0004401321,0.0012585343,0.0013201139,0.0016594152],"domain_scores_gemma":[0.99653125,0.0003169154,0.00021851802,0.0009559017,0.001246836,0.0007306076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013728279,0.0004900403,0.00051339116,0.0009910214,0.0008186506,0.00026200246,0.0023929938,0.00040961753,0.000084708314],"category_scores_gemma":[0.00014296891,0.00047097378,0.00023697769,0.0021386542,0.0005060927,0.0012358875,0.0011769836,0.0014104038,0.00034526107],"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.0032555053,0.014415356,0.20796645,0.0016809179,0.0019732418,0.0096865455,0.08203579,0.042185944,0.0016445173,0.2835045,0.13022545,0.2214258],"study_design_scores_gemma":[0.0069522294,0.0025229235,0.08296031,0.0003724539,0.00014634465,0.0001951207,0.0027331326,0.8481066,0.00068107725,0.0153168095,0.037268657,0.002744343],"about_ca_topic_score_codex":0.0017178546,"about_ca_topic_score_gemma":0.002076488,"teacher_disagreement_score":0.80592066,"about_ca_system_score_codex":0.00029259702,"about_ca_system_score_gemma":0.00045541025,"threshold_uncertainty_score":0.9997742},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8495452,0.059846688,0.07312643,0.0005427715,0.0042179828,0.00031511768,0.000002379838,0.00004788068,0.012355555],"genre_scores_gemma":[0.9954845,0.0026056676,0.0010630946,0.000040990726,0.00037799767,0.0000014073062,1.900036e-7,0.0000062460936,0.00041990718],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986268,0.000101670514,0.0005422702,0.00014767624,0.00039923,0.0001823479],"domain_scores_gemma":[0.9983968,0.00012801755,0.0006855907,0.00021121404,0.00043710292,0.00014127247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006600349,0.0001294911,0.0003796824,0.00021672527,0.00009734353,0.000056644043,0.0005547504,0.000070614245,0.0000052430223],"category_scores_gemma":[0.00006800119,0.00008825321,0.00009472259,0.0002195036,0.000060587012,0.00024347905,0.00013581017,0.00013780518,0.000013241727],"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.00043735257,0.0029478415,0.31557968,0.0037957656,0.0015225334,0.002199684,0.12017701,0.0012805403,0.03496033,0.21504754,0.043655574,0.25839615],"study_design_scores_gemma":[0.005462647,0.019130796,0.14306596,0.011099744,0.0004155758,0.046455268,0.013440114,0.043013044,0.15629825,0.0070209694,0.5508709,0.00372675],"about_ca_topic_score_codex":0.00005249097,"about_ca_topic_score_gemma":0.000022470162,"teacher_disagreement_score":0.5072153,"about_ca_system_score_codex":0.000037946396,"about_ca_system_score_gemma":0.00007608143,"threshold_uncertainty_score":0.35988614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017910836,0.0002706279,0.6376617,0.0002957679,0.0011134807,0.0007141758,0.000015389347,0.0008135164,0.3412045],"genre_scores_gemma":[0.9467335,0.00010498899,0.043836895,0.0049681254,0.00044045466,0.00015751488,0.000042131825,0.000018658813,0.0036977823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970762,0.000026882604,0.0006916219,0.00039444794,0.0004130849,0.0013977523],"domain_scores_gemma":[0.9982986,0.00017261344,0.00028441616,0.0006776913,0.00028773383,0.00027897037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054434355,0.00041489318,0.00043469324,0.00022991581,0.00087668654,0.00018141858,0.0017865052,0.00029333416,0.00007956368],"category_scores_gemma":[0.00021305864,0.00031472428,0.00034203642,0.0004982417,0.00021913253,0.003776154,0.00067566364,0.00032105445,0.0007509226],"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.000084691754,0.00013946863,0.0025107414,0.00006246498,0.000036861984,0.00007766851,0.0030837073,0.00047188063,0.000039352988,0.9548372,0.0048578596,0.0337981],"study_design_scores_gemma":[0.00907814,0.007419776,0.074430026,0.00007750422,0.00007122188,0.0041689966,0.0008065969,0.14642687,0.003169959,0.060803637,0.68936014,0.0041871467],"about_ca_topic_score_codex":0.000014195087,"about_ca_topic_score_gemma":0.000019581823,"teacher_disagreement_score":0.92882264,"about_ca_system_score_codex":0.000055493052,"about_ca_system_score_gemma":0.0002538606,"threshold_uncertainty_score":0.9999305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003297626,0.0008300939,0.7437097,0.00014362416,0.00031806703,0.00012550967,8.400201e-7,0.00014282332,0.25143173],"genre_scores_gemma":[0.9953346,0.000024122275,0.0039925403,0.00020537226,0.000073458104,0.0000099632925,0.000001404528,0.0000035214482,0.00035501292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896264,0.0001678636,0.00018000227,0.00026595543,0.00022437857,0.00019913392],"domain_scores_gemma":[0.99917245,0.000119296805,0.00008750274,0.00032261392,0.00018890544,0.00010922808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006030982,0.000106205305,0.00019670672,0.000043086526,0.000063841864,0.000028915276,0.0005560572,0.00006779793,0.000029487896],"category_scores_gemma":[0.00039270578,0.00006988784,0.000057934558,0.0003486799,0.00011162216,0.000121176454,0.00033386832,0.00007023384,0.00012494413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011728607,0.00014735498,0.0031441362,0.000004968848,0.000013988438,0.00001157021,0.0016403436,0.000065189924,0.000025695568,0.9850127,0.0036861359,0.006236167],"study_design_scores_gemma":[0.0016774419,0.0014006223,0.023135979,0.000030283178,0.000032206346,0.000032575997,0.0008794865,0.006103671,0.0009221794,0.9121795,0.053046715,0.0005593243],"about_ca_topic_score_codex":0.000004192261,"about_ca_topic_score_gemma":0.000003150282,"teacher_disagreement_score":0.992037,"about_ca_system_score_codex":0.000026911195,"about_ca_system_score_gemma":0.00009369069,"threshold_uncertainty_score":0.28499436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37642854,0.016898217,0.47125,0.118223436,0.010075912,0.0007159953,0.000011729396,0.00010603556,0.0062901275],"genre_scores_gemma":[0.994799,0.000022851897,0.0025561685,0.00059172855,0.0018495091,0.000004882884,2.9269137e-7,0.000006975343,0.00016855945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896646,0.0001018126,0.00024625473,0.00020658427,0.00028659467,0.00019230663],"domain_scores_gemma":[0.99847746,0.0006450439,0.00020159845,0.00012427477,0.00036399488,0.00018761097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008476086,0.00013793093,0.00022264784,0.000078884696,0.00016776424,0.0001284954,0.0002801787,0.000091883376,0.000011761577],"category_scores_gemma":[0.0006844531,0.000075012234,0.00011135035,0.000098232005,0.00017301468,0.00035495343,0.00008599529,0.00034653384,0.0000044336653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003394361,0.00013574219,0.0013186405,0.000015789348,0.0001335666,0.000014120236,0.0005318967,0.00009920525,0.0009778044,0.9888738,0.002060745,0.005499275],"study_design_scores_gemma":[0.0024227798,0.00118288,0.016331753,0.000024708692,0.00007506492,0.0012898943,0.000113270675,0.013474787,0.00024545492,0.96019197,0.0044282796,0.00021916852],"about_ca_topic_score_codex":0.000001894986,"about_ca_topic_score_gemma":0.000001772996,"teacher_disagreement_score":0.6183705,"about_ca_system_score_codex":0.00005199125,"about_ca_system_score_gemma":0.000079369514,"threshold_uncertainty_score":0.30589104},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6065632,0.002266648,0.27112752,0.0009849812,0.00051381177,0.0010807707,0.0000028777797,0.00031206012,0.11714815],"genre_scores_gemma":[0.98997855,0.000029783567,0.009817426,0.000030270605,0.000031794483,0.000020986261,0.0000035720457,0.0000031234738,0.00008450721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999201,0.000055714474,0.00012152165,0.00024838152,0.00024141792,0.00013196655],"domain_scores_gemma":[0.9993798,0.000024542895,0.0001149134,0.00022709297,0.00017249864,0.00008113422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025621546,0.00008708964,0.00012687995,0.000035264922,0.000094007635,0.000044592565,0.00020034263,0.000041845917,0.000002749927],"category_scores_gemma":[0.000075681535,0.000055782974,0.000014899162,0.00021599316,0.00007787514,0.00017086732,0.00012802545,0.00004689818,0.000013754674],"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.0002410417,0.0017256092,0.08038244,0.00013500026,0.00017657151,0.00005708075,0.05293955,0.000058762656,0.0032487332,0.63042367,0.009486035,0.22112553],"study_design_scores_gemma":[0.005722639,0.0047684796,0.9154153,0.00019795485,0.00008170098,0.00005298244,0.00112524,0.017501226,0.007552416,0.029829916,0.016814686,0.00093747204],"about_ca_topic_score_codex":0.000011364173,"about_ca_topic_score_gemma":0.000014689878,"teacher_disagreement_score":0.8350328,"about_ca_system_score_codex":0.00002934156,"about_ca_system_score_gemma":0.0000841962,"threshold_uncertainty_score":0.22747636},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15056151,0.0011334183,0.33463436,0.002201066,0.002096862,0.00033834614,0.000008809208,0.0005926108,0.508433],"genre_scores_gemma":[0.99064696,0.000008494871,0.00739087,0.000033829914,0.00006292883,0.0000062382987,7.269674e-7,0.000004708859,0.0018452521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928343,0.00006205128,0.00014916365,0.00018438426,0.00016108318,0.00015990945],"domain_scores_gemma":[0.99911296,0.000101643265,0.00008924043,0.00046276057,0.000117706666,0.00011571255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032869948,0.00008296956,0.00014151381,0.000060435465,0.000039223767,0.000031128497,0.00055937195,0.00005489473,0.000015941694],"category_scores_gemma":[0.00026542315,0.00006343339,0.000057691177,0.00023665641,0.00006127795,0.00020289753,0.00015282801,0.000073927644,0.0002163824],"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.000026575042,0.0006646059,0.034363676,0.00009153984,0.00007883457,0.0000585802,0.008336575,0.00011530949,0.0044616153,0.86939156,0.02539696,0.05701416],"study_design_scores_gemma":[0.002425373,0.0012680967,0.013936507,0.0003932045,0.000090192676,0.0004453797,0.0032873428,0.051242143,0.07577115,0.38188538,0.46712247,0.0021327562],"about_ca_topic_score_codex":0.00007151693,"about_ca_topic_score_gemma":0.000021494296,"teacher_disagreement_score":0.84008545,"about_ca_system_score_codex":0.000037278885,"about_ca_system_score_gemma":0.00011454963,"threshold_uncertainty_score":0.27812302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000439998,0.00056182273,0.7170731,0.00015319754,0.0003685522,0.00036400583,0.0000016924171,0.00010903386,0.2813642],"genre_scores_gemma":[0.0041779173,0.0009975506,0.9849254,0.0010336097,0.00007091643,0.000059936734,0.000041721916,0.0000128925985,0.00868005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815065,0.000064421576,0.00075675757,0.00036722442,0.00030012036,0.0003608537],"domain_scores_gemma":[0.9964978,0.0005178047,0.00045061397,0.0017889502,0.00059941976,0.00014541465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038609596,0.00025938303,0.00031685748,0.0011141483,0.001169332,0.00076460844,0.0038271125,0.00017878722,0.0000070592378],"category_scores_gemma":[0.00011692122,0.0002527453,0.00009539263,0.00042255112,0.0008120284,0.0037889434,0.002661832,0.00055095024,0.00004237247],"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":[6.8361646e-7,0.000008964985,0.000011596299,0.000018421042,0.000004166774,1.2656517e-7,0.0016917831,0.000060595386,0.0000033816516,0.6201363,0.00020015352,0.37786382],"study_design_scores_gemma":[0.00029277353,0.0000901118,0.00023685036,0.00010202157,0.000006635758,0.000019393427,0.000021519769,0.30329132,0.000010286407,0.019859407,0.675743,0.00032673587],"about_ca_topic_score_codex":0.000008708131,"about_ca_topic_score_gemma":0.00001392574,"teacher_disagreement_score":0.67554283,"about_ca_system_score_codex":0.00019231737,"about_ca_system_score_gemma":0.00027861178,"threshold_uncertainty_score":0.9999925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019026764,0.00020353193,0.59960544,0.00026218762,0.00013133853,0.0002582581,4.0935345e-7,0.00007805215,0.380434],"genre_scores_gemma":[0.9391157,0.000009848343,0.05218853,0.00083315314,0.0000136598155,0.00000860113,2.389896e-7,0.00000444814,0.007825802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918824,0.00014902781,0.00014916278,0.00022718485,0.00012853276,0.00015786888],"domain_scores_gemma":[0.9992541,0.00013957905,0.000051610223,0.00034306163,0.00013518649,0.00007644772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063581957,0.00008161617,0.00013915419,0.000055783632,0.00004677867,0.000026672611,0.0003504386,0.000031912175,0.000098427605],"category_scores_gemma":[0.0002849001,0.00005680812,0.000037162994,0.00035120652,0.000029047236,0.00013754566,0.000105199986,0.000046625566,0.00013018763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048967586,0.000055015924,0.00037315802,0.000009184363,0.0000054610396,0.0000015757585,0.0019182818,0.0000015807866,0.0006635155,0.9838854,0.001615427,0.011466496],"study_design_scores_gemma":[0.0018622867,0.0025459987,0.008794761,0.00031950336,0.000023316472,0.000042562886,0.0010545765,0.0021062947,0.22970258,0.42350262,0.32899666,0.0010488522],"about_ca_topic_score_codex":0.00000458156,"about_ca_topic_score_gemma":0.0000031058185,"teacher_disagreement_score":0.92008895,"about_ca_system_score_codex":0.00001600481,"about_ca_system_score_gemma":0.00006912711,"threshold_uncertainty_score":0.23165679},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9687469,0.00023730972,0.0033277846,0.00084894896,0.00013270516,0.0002050765,0.0000062115,0.000056794408,0.026438262],"genre_scores_gemma":[0.99616677,0.000023702834,0.0021992226,0.00022580447,0.000016020922,3.5243713e-7,0.0000015521658,0.0000069294606,0.0013596268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9979824,0.00049952767,0.0001842115,0.0005240311,0.0004424055,0.00036742637],"domain_scores_gemma":[0.99820733,0.0005879186,0.00021304861,0.0006296058,0.0001627826,0.0001992876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095062493,0.00021640581,0.00036246306,0.00011555732,0.00044715652,0.000046548368,0.0012185803,0.00022535726,0.000433192],"category_scores_gemma":[0.0005116506,0.00016839823,0.00018428931,0.00044005108,0.0006106364,0.00043459563,0.00046925407,0.00042321088,0.00010112357],"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.000102643855,0.0003366749,0.062088054,0.000034497774,0.00007436305,0.00006261867,0.0036969031,0.00002012355,0.0027772014,0.92864245,0.0007349819,0.0014294725],"study_design_scores_gemma":[0.0050334604,0.0019948157,0.8638707,0.00020630384,0.00012057519,0.00015481979,0.0031247525,0.00090842234,0.0079328455,0.099510744,0.015943505,0.0011990542],"about_ca_topic_score_codex":0.000013726599,"about_ca_topic_score_gemma":0.000032981843,"teacher_disagreement_score":0.8291317,"about_ca_system_score_codex":0.000054518092,"about_ca_system_score_gemma":0.000080330174,"threshold_uncertainty_score":0.68670803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088975416,0.00009724068,0.9832696,0.00062746863,0.0017279449,0.00042829185,0.0000014626386,0.000035459125,0.01292282],"genre_scores_gemma":[0.9840466,0.000016401891,0.014070313,0.0012667897,0.00018453036,0.000011591568,0.0000017465755,0.000015417383,0.00038662177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794334,0.000105073574,0.00037764976,0.0006340645,0.0006201983,0.00031966297],"domain_scores_gemma":[0.9972179,0.0009644567,0.00031526084,0.0012715671,0.00018998359,0.0000408323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017083463,0.00029629227,0.00026447934,0.0003502046,0.00023706576,0.00021753479,0.0035205395,0.00027993423,0.000019939722],"category_scores_gemma":[0.00045672516,0.00015436258,0.000113740134,0.00064237416,0.0007413752,0.00034250034,0.00078449026,0.001005339,0.000013315316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044021363,0.000022450367,0.00005339805,0.000008715941,0.000002303529,0.0000023156167,0.0021823798,0.0025324838,0.00036544746,0.83514065,0.000009847372,0.1596756],"study_design_scores_gemma":[0.000128895,0.0000994233,0.0006084453,0.0003706591,0.0000037289187,0.000013482865,6.580873e-7,0.16838276,0.014219641,0.8155906,0.00032800628,0.00025370982],"about_ca_topic_score_codex":0.000018078506,"about_ca_topic_score_gemma":0.00046457493,"teacher_disagreement_score":0.98315686,"about_ca_system_score_codex":0.00011980443,"about_ca_system_score_gemma":0.0003254257,"threshold_uncertainty_score":0.6542097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016171021,0.0068925386,0.9704803,0.0007959898,0.0025993763,0.00035754836,0.0000025750287,0.00027172294,0.018438205],"genre_scores_gemma":[0.786612,0.0004069973,0.20748958,0.0030241734,0.0010580376,0.000018667815,0.000007767354,0.00006331916,0.0013194814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955721,0.00007600252,0.00058493385,0.0018292388,0.0007813415,0.0011563988],"domain_scores_gemma":[0.9968837,0.00071530574,0.00038838087,0.0014027068,0.00023776117,0.0003721576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013714297,0.00077025266,0.00082198106,0.00066710205,0.0004663546,0.000662643,0.00319332,0.0005319356,0.00003928073],"category_scores_gemma":[0.00014029517,0.00062092626,0.00015536151,0.000545146,0.0012086022,0.00080138934,0.0025466324,0.0010851909,0.00013885193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005336357,0.000054603537,0.00056647527,0.00009254128,0.00001738866,0.00012376295,0.0018189774,0.0008262832,0.00017275322,0.53408104,0.000037948885,0.46220288],"study_design_scores_gemma":[0.00060432043,0.00032822785,0.0007365955,0.0005582629,0.000026227232,0.0006402898,7.7684956e-7,0.095334776,0.0004307063,0.89642686,0.003317461,0.0015955319],"about_ca_topic_score_codex":0.0000200865,"about_ca_topic_score_gemma":0.00004278688,"teacher_disagreement_score":0.78645027,"about_ca_system_score_codex":0.00025666022,"about_ca_system_score_gemma":0.00032024446,"threshold_uncertainty_score":0.9996242},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43689638,0.0021855982,0.42101893,0.018711735,0.006586531,0.0030741934,0.000027078539,0.0015850822,0.10991446],"genre_scores_gemma":[0.98403305,0.00022383915,0.0109675815,0.0010926488,0.000625015,0.00022224408,0.000016468934,0.000034059674,0.0027851],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969811,0.00023187914,0.0005118905,0.0011590316,0.0004168316,0.0006992649],"domain_scores_gemma":[0.9970487,0.000112259666,0.00029492544,0.0020302401,0.00027534072,0.00023856993],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058425934,0.00045876284,0.0004544283,0.00014358923,0.0005394597,0.00022054525,0.0025883792,0.00031466695,0.000023755418],"category_scores_gemma":[0.00013813618,0.0003333713,0.00029985496,0.00039061415,0.00015208182,0.0001919684,0.0023158211,0.0008112166,0.0020412311],"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.000116911426,0.00201584,0.2468826,0.0009825065,0.00089849427,0.00076395855,0.08611243,0.002595694,0.0020229903,0.12569968,0.38068596,0.15122293],"study_design_scores_gemma":[0.002818476,0.0017409257,0.40988314,0.0017298793,0.00033294148,0.0011424074,0.00078198843,0.05314956,0.0026535012,0.09580266,0.42351735,0.006447177],"about_ca_topic_score_codex":0.00029316856,"about_ca_topic_score_gemma":0.0002464683,"teacher_disagreement_score":0.54713666,"about_ca_system_score_codex":0.00016092272,"about_ca_system_score_gemma":0.0004881181,"threshold_uncertainty_score":0.99991184},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13096227,0.002464556,0.8512444,0.0005882377,0.00018288531,0.00022330711,0.000007001437,0.00008026684,0.014247062],"genre_scores_gemma":[0.95085937,0.0007689799,0.048060298,0.00012405838,0.000021089858,0.0000038738967,7.4890727e-7,0.000006997866,0.00015457945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893606,0.000032819426,0.00037018,0.0002808162,0.00015651007,0.00022362346],"domain_scores_gemma":[0.99898046,0.00022341996,0.00014289745,0.00040022956,0.00013691424,0.000116054485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212652,0.00012703639,0.00022987687,0.000080935446,0.0001084615,0.00010975964,0.00025470115,0.000042073516,0.000026544476],"category_scores_gemma":[0.0005382959,0.000104708655,0.000045623914,0.000251644,0.00014207978,0.00023061705,0.00012665663,0.00007494341,0.00001852825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012433285,0.0001345501,0.00005471032,0.00008378179,0.000013573987,0.0000056338536,0.0011607625,0.000009292154,0.00048270304,0.9800669,0.00017424008,0.017812587],"study_design_scores_gemma":[0.000024626628,0.00016649334,0.00003336149,0.00013252854,0.000017404082,0.000039902872,0.0010046086,0.104740985,0.13793798,0.7539641,0.0016509688,0.00028700032],"about_ca_topic_score_codex":0.000017370354,"about_ca_topic_score_gemma":0.000016273812,"teacher_disagreement_score":0.8198971,"about_ca_system_score_codex":0.0000023146117,"about_ca_system_score_gemma":0.00003539234,"threshold_uncertainty_score":0.4269895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21578665,0.00089014694,0.7759067,0.0008148357,0.0022039628,0.00022234359,2.550172e-7,0.00040217696,0.0037729598],"genre_scores_gemma":[0.80928874,0.0000771726,0.18940902,0.0009939338,0.00014914661,0.000006100563,3.7117843e-7,0.0000044279645,0.00007108431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972571,0.00008640906,0.00030992844,0.0010007438,0.00053066225,0.0008151302],"domain_scores_gemma":[0.9986685,0.00020223593,0.00010079203,0.0006551868,0.00017606372,0.00019725261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011580467,0.0002546721,0.0002849536,0.00032013372,0.00034193753,0.0006742798,0.001783157,0.00009585853,0.0000052373184],"category_scores_gemma":[0.00011555764,0.00019586278,0.000052537085,0.0017639446,0.00049426634,0.0011175928,0.0012435915,0.0003177526,0.000053914137],"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.000011206422,0.000689015,0.043325294,0.00004131843,0.000018826338,0.001631188,0.007635103,0.0007332193,0.00029132655,0.6892843,0.00075001665,0.25558913],"study_design_scores_gemma":[0.00054885796,0.00023602859,0.0794902,0.000030865616,0.0000043830587,0.00093753694,0.000020428797,0.8728466,0.000097549084,0.043336228,0.001974302,0.00047702636],"about_ca_topic_score_codex":0.00003459227,"about_ca_topic_score_gemma":0.00003552828,"teacher_disagreement_score":0.8721134,"about_ca_system_score_codex":0.00011762255,"about_ca_system_score_gemma":0.00019553259,"threshold_uncertainty_score":0.7987052},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008859847,0.0010219725,0.9954419,0.00005221719,0.0006196003,0.0009481363,0.0000064630035,0.00007454887,0.0009491733],"genre_scores_gemma":[0.5774435,0.000041382766,0.42206568,0.0000926927,0.000103022365,0.000020803815,0.0000031508935,0.000026270414,0.0002035433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964224,0.000041408046,0.0006245524,0.0014556474,0.0006590262,0.0007969724],"domain_scores_gemma":[0.99768037,0.00034740733,0.0002650587,0.0012001195,0.00037769886,0.00012937479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017076333,0.0004671991,0.000698155,0.00091450615,0.00013686287,0.00020853773,0.0032927557,0.00037145903,0.000006975371],"category_scores_gemma":[0.00007519453,0.00040823914,0.00017824813,0.00056954805,0.00048794193,0.00049122074,0.0011811882,0.00072151254,0.000009942302],"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.000024399838,0.00033945014,0.0005726094,0.00083388516,0.000029803849,0.00008653377,0.028309148,0.5853718,0.0005088913,0.061896976,0.0000040022364,0.3220225],"study_design_scores_gemma":[0.00043841384,0.00014180892,0.000081791906,0.0005170476,0.0000056239874,0.000016333219,5.726726e-7,0.92257077,0.0013295888,0.07443617,0.00003469648,0.00042720177],"about_ca_topic_score_codex":0.0003478657,"about_ca_topic_score_gemma":0.0005319889,"teacher_disagreement_score":0.57655746,"about_ca_system_score_codex":0.00021839113,"about_ca_system_score_gemma":0.000543523,"threshold_uncertainty_score":0.9998369},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066382313,0.00046285536,0.05651035,0.0003603649,0.00048984296,0.0007083933,0.000003985493,0.00035574738,0.94110185],"genre_scores_gemma":[0.0053519174,0.000018939189,0.060969155,0.0007939187,0.00035997885,0.000040252933,0.000011212304,0.000059357415,0.9323953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99708956,0.000035935067,0.00043160105,0.0013810097,0.00046372644,0.0005981493],"domain_scores_gemma":[0.99773675,0.000106370826,0.00016088328,0.0015277084,0.00006627564,0.00040198246],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00050215056,0.00058083836,0.0006377305,0.00037533793,0.00026239516,0.00094718224,0.003985758,0.0001784127,0.0013511356],"category_scores_gemma":[0.000020462041,0.0004763427,0.00021310241,0.00020666837,0.000066171786,0.00019433037,0.002274076,0.00043716741,0.004069786],"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.0000074129025,0.00003973573,0.0000034578084,0.000008214183,0.000030181465,0.000031429965,0.00034840108,0.00034852885,6.7753587e-7,0.9387088,0.0076844506,0.05278871],"study_design_scores_gemma":[0.0004859721,0.00011921348,0.000022182276,0.00029136153,0.000029841176,0.00004507559,0.000007945536,0.016094847,0.00008190615,0.04360675,0.93806404,0.0011508535],"about_ca_topic_score_codex":0.00010339185,"about_ca_topic_score_gemma":0.00034215194,"teacher_disagreement_score":0.9303796,"about_ca_system_score_codex":0.00015482867,"about_ca_system_score_gemma":0.00021387267,"threshold_uncertainty_score":0.99976885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047294925,0.00081229425,0.96838975,0.0052955407,0.0045352965,0.00039503627,0.0000019425356,0.0002566981,0.020266155],"genre_scores_gemma":[0.065694176,0.000112814414,0.9086091,0.0053824675,0.012681045,0.000029013807,0.0000056063077,0.000063679756,0.007422125],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99562913,0.00003510306,0.00054641237,0.00214783,0.0008586878,0.0007828338],"domain_scores_gemma":[0.9970596,0.0002018231,0.00023027412,0.0018361879,0.00037612126,0.00029599923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008344516,0.0005712203,0.00057679595,0.000865152,0.00030683263,0.00057186576,0.0035299538,0.00031425938,0.00007681143],"category_scores_gemma":[0.00018806307,0.0005182306,0.00014951987,0.000916967,0.00042084837,0.00072364265,0.0014415084,0.0007615947,0.0005359328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052920905,0.000027938597,0.00002437107,0.000020630387,0.000006554835,0.000036634872,0.0009002994,0.015898207,0.00012184417,0.057999678,0.00080967334,0.92414886],"study_design_scores_gemma":[0.00074360415,0.00080499635,0.0007433648,0.0006751857,0.000024408777,0.00049697584,3.677793e-7,0.30940315,0.0038849097,0.296475,0.38362116,0.0031269018],"about_ca_topic_score_codex":0.000013337866,"about_ca_topic_score_gemma":0.00015961533,"teacher_disagreement_score":0.921022,"about_ca_system_score_codex":0.0004806928,"about_ca_system_score_gemma":0.0005351038,"threshold_uncertainty_score":0.99972695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5422618,0.0026296608,0.2772825,0.014441655,0.029870544,0.0060845586,0.00017449503,0.0025400105,0.12471477],"genre_scores_gemma":[0.9966425,0.000022311313,0.0018806395,0.00026340407,0.000030316609,0.00008079632,0.000020509626,0.000012611785,0.0010469363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862653,0.00007322489,0.00021830645,0.00044299715,0.00028242005,0.00035654777],"domain_scores_gemma":[0.9984741,0.00043713916,0.00012902525,0.00055925915,0.00026738466,0.00013304123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004058635,0.00017876501,0.00018913437,0.00007511687,0.0010038322,0.000101811085,0.00084494066,0.00010571711,0.000052028772],"category_scores_gemma":[0.00037967454,0.00015412326,0.000101405036,0.00036836375,0.000043794364,0.0003025792,0.0010600737,0.00014601985,0.00014827578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006948469,0.00039121325,0.00012578667,0.000008958657,0.000016316004,0.0000025129773,0.0019326512,0.000006405911,0.00032168822,0.97240007,0.007842295,0.01694516],"study_design_scores_gemma":[0.0019566044,0.00064050633,0.0011452596,0.000029787476,0.000021913977,0.0000029587527,0.000022095812,0.28027803,0.0021183034,0.69521695,0.01822099,0.0003466134],"about_ca_topic_score_codex":0.0000126910845,"about_ca_topic_score_gemma":0.000005549974,"teacher_disagreement_score":0.4543807,"about_ca_system_score_codex":0.00014691621,"about_ca_system_score_gemma":0.000040907373,"threshold_uncertainty_score":0.7720767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45648777,0.024863267,0.16529241,0.00044532272,0.0020629524,0.00076414825,0.000003381105,0.0005527504,0.34952798],"genre_scores_gemma":[0.97318876,0.00033623294,0.02413726,0.000025381509,0.00025253123,0.000022727914,0.0000056922836,0.000018803561,0.0020126316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980051,0.00019941614,0.00046624357,0.0005018892,0.00026660837,0.0005607603],"domain_scores_gemma":[0.9983257,0.00032780107,0.00027867508,0.00056046766,0.00020312676,0.00030419827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000829387,0.00025329227,0.00037843932,0.00021389648,0.00027942244,0.000105559135,0.000565721,0.00013315958,0.000020284315],"category_scores_gemma":[0.00050313905,0.0002183381,0.00015184958,0.00047656204,0.00013161101,0.00096958264,0.000699671,0.00019645558,0.000072475355],"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.000020580574,0.00040107456,0.16860595,0.00013733207,0.000092932605,0.0000069849107,0.011867706,0.00012366303,0.002304955,0.7300126,0.00014037428,0.08628585],"study_design_scores_gemma":[0.0040177107,0.000370304,0.60108835,0.00082591956,0.00019545275,0.00073179614,0.0016395899,0.27730605,0.043344483,0.004305105,0.06405449,0.002120725],"about_ca_topic_score_codex":0.000035359393,"about_ca_topic_score_gemma":0.000023193044,"teacher_disagreement_score":0.7257075,"about_ca_system_score_codex":0.00006908526,"about_ca_system_score_gemma":0.00013615942,"threshold_uncertainty_score":0.8903569},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032453125,0.00009548604,0.9782361,0.0048345984,0.00019754515,0.0003234149,0.0000040537293,0.000112178626,0.012951324],"genre_scores_gemma":[0.90196884,0.000026315898,0.0969623,0.00034379974,0.0003441234,0.000054377488,0.0000027772471,0.000007847427,0.00028963023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817747,0.000060336064,0.00033258912,0.0005692844,0.0005023201,0.00035801635],"domain_scores_gemma":[0.9979953,0.0008015443,0.00009865077,0.00022969767,0.0007628423,0.00011191858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096452085,0.00015027176,0.0001524644,0.00014918092,0.00035558315,0.00048943964,0.0005948741,0.00011243073,0.00006720248],"category_scores_gemma":[0.0013526914,0.00014120294,0.00005788861,0.0003037931,0.000109215594,0.00041078648,0.00017937346,0.00026133258,0.00011700014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008458258,0.00006072026,0.000059002927,0.000010485134,0.0000058582486,5.2969983e-7,0.0009449069,0.00068750407,0.00055325194,0.84168094,0.00007571036,0.15591262],"study_design_scores_gemma":[0.000019650271,0.00006729896,0.000108025466,0.000049530812,0.0000016614739,0.000004450539,0.00007024685,0.4523407,0.0075875674,0.5384727,0.0011322561,0.00014589743],"about_ca_topic_score_codex":0.000013671708,"about_ca_topic_score_gemma":0.000049617327,"teacher_disagreement_score":0.89872354,"about_ca_system_score_codex":0.00006389032,"about_ca_system_score_gemma":0.00020946919,"threshold_uncertainty_score":0.5758089},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073202193,0.0036719972,0.99037653,0.00020142908,0.0005742646,0.00042579413,0.0000017120299,0.000118291086,0.0038979687],"genre_scores_gemma":[0.5948467,0.002569917,0.40088603,0.00036369188,0.0004926173,0.000010686931,0.0000142429135,0.00004390135,0.00077222456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971638,0.00003818148,0.0004954954,0.0011887493,0.00068375835,0.0004300601],"domain_scores_gemma":[0.9977164,0.00031001813,0.00043842936,0.0010526562,0.00034430178,0.0001381464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042225048,0.00038340938,0.0005816532,0.0004988328,0.00019264643,0.00026824707,0.0015993064,0.00025082735,0.0000043687814],"category_scores_gemma":[0.00014401803,0.0003260081,0.00011248793,0.0007013021,0.0010134337,0.00047210947,0.0010297509,0.00041163218,0.000010918785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050519325,0.000048257356,0.0016622121,0.000114729184,0.000016334105,0.00011059808,0.002380102,0.0007351272,0.000071805174,0.019691225,0.00004217877,0.9751224],"study_design_scores_gemma":[0.0011032092,0.0010506407,0.0023246612,0.0030346874,0.000054900276,0.001042053,0.0000014681241,0.7605139,0.0074485643,0.21490583,0.006466635,0.002053436],"about_ca_topic_score_codex":0.000022609238,"about_ca_topic_score_gemma":0.000021024718,"teacher_disagreement_score":0.97306895,"about_ca_system_score_codex":0.00007128733,"about_ca_system_score_gemma":0.00020441439,"threshold_uncertainty_score":0.9999192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038877618,0.00047288008,0.8269154,0.00030889735,0.00017094666,0.00006914218,9.500618e-8,0.00018285644,0.1330022],"genre_scores_gemma":[0.9137241,0.00003715242,0.083671644,0.00014038697,0.00008398077,3.3313876e-7,2.6150923e-7,0.000003445587,0.0023386588],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995421,0.000018331335,0.000052495303,0.00013070651,0.000076972065,0.00017936024],"domain_scores_gemma":[0.99962264,0.00003897535,0.000021208427,0.00018907126,0.00003213623,0.00009595705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012465968,0.000060974868,0.00006557919,0.000032390843,0.00013897913,0.000085413354,0.00008678151,0.000024647426,0.000012857385],"category_scores_gemma":[0.00001233979,0.000038817416,0.000012251966,0.00014716868,0.00002017196,0.000489777,0.00009544814,0.000051926643,0.00005812482],"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.00000639156,0.00014565155,0.015151207,0.000032868367,0.000026273703,0.0000071354607,0.0046431716,0.000006623043,0.0020798296,0.4425943,0.0075141597,0.5277924],"study_design_scores_gemma":[0.0018702011,0.00076180283,0.080195665,0.00030511478,0.00007123693,0.0012278634,0.00087668985,0.07356397,0.023149472,0.0052491855,0.81108505,0.001643765],"about_ca_topic_score_codex":0.000023848104,"about_ca_topic_score_gemma":0.000017540027,"teacher_disagreement_score":0.8748465,"about_ca_system_score_codex":0.000010299143,"about_ca_system_score_gemma":0.000013217328,"threshold_uncertainty_score":0.15829282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011157925,0.0002485088,0.9847206,0.0009715862,0.00013074867,0.0004434494,0.0000017181551,0.0002471499,0.0020782985],"genre_scores_gemma":[0.68220586,0.0000047148947,0.31673247,0.00044004055,0.00002303942,0.00002821774,0.000001372353,0.0000065665636,0.0005577375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998767,0.00017719532,0.00017372001,0.00045131092,0.000121735095,0.00030902133],"domain_scores_gemma":[0.99899197,0.00037637755,0.00005354514,0.0002966488,0.00008845481,0.00019301353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000588892,0.00015348538,0.00021338144,0.000031599095,0.0001915008,0.00017922277,0.00027945678,0.00008599985,0.000023554865],"category_scores_gemma":[0.00026749112,0.00011506024,0.000041858635,0.00012285488,0.00009217132,0.00021718805,0.00009231716,0.00005810975,0.000009328442],"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.000015624757,0.000086238855,0.00036406834,0.00002752509,0.0000085528145,0.0000039435445,0.00006184991,0.000022496219,0.0005805932,0.99510837,0.0022615744,0.0014591761],"study_design_scores_gemma":[0.001338848,0.0003099398,0.008156562,0.000010555442,0.000011064137,0.0000152434195,0.00000531226,0.92367107,0.0060563465,0.05455399,0.005625128,0.00024596113],"about_ca_topic_score_codex":0.0000018221956,"about_ca_topic_score_gemma":0.000015391695,"teacher_disagreement_score":0.9405544,"about_ca_system_score_codex":0.000017322254,"about_ca_system_score_gemma":0.00010957043,"threshold_uncertainty_score":0.46920204},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09536953,0.000370813,0.19445427,0.000593045,0.00078292267,0.0004611009,0.00001142727,0.00042780425,0.70752907],"genre_scores_gemma":[0.95283854,0.000046977195,0.045889508,0.000497568,0.000048814767,0.000022580078,0.000008510716,0.00000766111,0.0006398616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869996,0.000048315804,0.0004476106,0.00017543817,0.00026313195,0.0003655476],"domain_scores_gemma":[0.99883115,0.00003910033,0.00020491375,0.0006943866,0.000075106684,0.00015536169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027844243,0.00015779653,0.00027124796,0.00011197964,0.00009514408,0.00011479304,0.0009800225,0.00008406168,0.00045431496],"category_scores_gemma":[0.00005737553,0.00012909288,0.000073605464,0.00025227305,0.000101543636,0.001314616,0.0002650225,0.00011509104,0.00037685558],"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.000012637531,0.0005062484,0.0022665462,0.00020878843,0.000060358867,0.000009136968,0.029020734,0.00001559925,0.00012228763,0.6771304,0.007734655,0.2829126],"study_design_scores_gemma":[0.0028599992,0.002150778,0.0098322965,0.00013547149,0.000049666116,0.00028213992,0.001584439,0.8337727,0.006275035,0.021471642,0.12044624,0.00113956],"about_ca_topic_score_codex":0.000036772264,"about_ca_topic_score_gemma":0.000012032137,"teacher_disagreement_score":0.85746896,"about_ca_system_score_codex":0.000053287393,"about_ca_system_score_gemma":0.000029026209,"threshold_uncertainty_score":0.5264255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45080823,0.004550966,0.11978811,0.006958595,0.0059408518,0.0020266685,0.000015466358,0.000978488,0.40893263],"genre_scores_gemma":[0.9838784,0.001342051,0.0010006601,0.000016784821,0.0003179115,0.0000058160394,0.0000037725106,0.0000139617005,0.013420691],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963176,0.0003287854,0.0002952428,0.00087867863,0.001081766,0.001097899],"domain_scores_gemma":[0.99677825,0.0008725633,0.0001408408,0.0010169302,0.00080022414,0.00039118627],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002655375,0.0002732295,0.0004623021,0.0012376519,0.00054559927,0.0001111927,0.0027272608,0.00024118657,0.004568035],"category_scores_gemma":[0.00054177694,0.0002988274,0.00019101313,0.003080589,0.0007785268,0.001989671,0.0015061666,0.0009169962,0.000121781864],"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.0003592021,0.0030614792,0.01490774,0.00011985867,0.00016057411,0.0005823971,0.15041403,0.00007866507,0.0045543904,0.15729785,0.54681945,0.12164433],"study_design_scores_gemma":[0.0147502,0.004786583,0.014224439,0.0012941652,0.000075658274,0.00008050638,0.052892175,0.28920567,0.004743593,0.31266254,0.30185446,0.0034300217],"about_ca_topic_score_codex":0.00022326148,"about_ca_topic_score_gemma":0.0001485724,"teacher_disagreement_score":0.53307015,"about_ca_system_score_codex":0.00040647393,"about_ca_system_score_gemma":0.00016503544,"threshold_uncertainty_score":0.99994636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014613297,0.00015141648,0.9704286,0.0010188749,0.00023929439,0.000113482914,4.063126e-8,0.000015157621,0.013419842],"genre_scores_gemma":[0.9771792,0.0000059478953,0.022385614,0.0003021012,0.000105829655,0.000004127971,8.137262e-7,0.0000022567015,0.0000140910515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912965,0.000060588645,0.0002782112,0.00009364954,0.0003227423,0.00011513174],"domain_scores_gemma":[0.99923843,0.00007657595,0.00027997524,0.00016526743,0.00018902755,0.000050695362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014271181,0.000070551,0.00011636829,0.000103977414,0.00004292915,0.00009950564,0.0005140431,0.000049510305,0.0000020434918],"category_scores_gemma":[0.00012877937,0.00004203837,0.00003053876,0.0004230506,0.00001983355,0.00028045932,0.00003644757,0.00015927266,0.00004699652],"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.00005444142,0.00029538112,0.00021603772,0.000014845957,0.000013456552,0.000033666558,0.016221404,0.16217408,0.00072316744,0.7232797,0.002987036,0.09398675],"study_design_scores_gemma":[0.002016402,0.000517001,0.020489585,0.000039100152,0.000028728871,0.0002721435,0.001344278,0.53498065,0.0011760303,0.43738765,0.0014773136,0.00027111443],"about_ca_topic_score_codex":0.0000051863935,"about_ca_topic_score_gemma":0.000009108546,"teacher_disagreement_score":0.9625659,"about_ca_system_score_codex":0.00009755579,"about_ca_system_score_gemma":0.00013063825,"threshold_uncertainty_score":0.17142749},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83451986,0.00027903187,0.07541823,0.00018355141,0.00047985883,0.00014018368,0.000001123989,0.0001642745,0.0888139],"genre_scores_gemma":[0.9977827,0.000029665933,0.0019766525,0.000060226546,0.000017981061,0.000004641518,2.0449409e-7,0.0000031578254,0.00012478507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99938697,0.000022850296,0.00010645362,0.00023414141,0.0000855916,0.0001639681],"domain_scores_gemma":[0.9996257,0.00006769125,0.00004390351,0.00016387837,0.0000348848,0.0000639825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087606415,0.00007475841,0.000088472,0.000054088676,0.00008241651,0.00003145054,0.00019167668,0.000049255512,0.000044944616],"category_scores_gemma":[0.00007220089,0.000068214074,0.000017726848,0.00010718406,0.00023477765,0.00030630708,0.00006898925,0.00010252714,0.00007802965],"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.000029914403,0.0006311774,0.2558788,0.000057418358,0.000044080913,0.0038022161,0.03753427,0.00005181006,0.034609925,0.43983623,0.0036802546,0.22384389],"study_design_scores_gemma":[0.0013556305,0.00010680148,0.971783,0.000109956345,0.0000031694633,0.0022617704,0.00048184898,0.0027785345,0.0057803774,0.013249223,0.0015506337,0.00053908373],"about_ca_topic_score_codex":0.000012058249,"about_ca_topic_score_gemma":0.0000070566302,"teacher_disagreement_score":0.7159042,"about_ca_system_score_codex":0.000016625643,"about_ca_system_score_gemma":0.000059440878,"threshold_uncertainty_score":0.27816892},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8916001,0.00030146868,0.0047451975,0.00012484424,0.00031166183,0.00024861892,0.0000093430035,0.00010897078,0.102549806],"genre_scores_gemma":[0.9638093,0.00011604605,0.0028614271,0.000010131382,0.00003019314,9.377628e-7,0.00006513426,0.000011467708,0.03309537],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99872804,0.00007427617,0.00017112875,0.00057021866,0.00021075575,0.00024557556],"domain_scores_gemma":[0.99904084,0.00007049865,0.00028961434,0.00042518572,0.00009140172,0.00008243234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020890888,0.00021105158,0.00036386854,0.00039179667,0.0001980703,0.0000449144,0.000793765,0.0003060448,0.00012260751],"category_scores_gemma":[0.000025852605,0.00025423005,0.00012282688,0.00034559556,0.00010479558,0.0002513664,0.00021497127,0.00034520624,0.000104398816],"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.00059347984,0.0020376632,0.1995706,0.0027917158,0.0005343509,0.0008129019,0.3389512,0.00030758494,0.0053905896,0.3063124,0.006023664,0.13667382],"study_design_scores_gemma":[0.0021470306,0.00015158961,0.91625285,0.00074933213,0.000092927025,0.000029597726,0.024575917,0.0024020225,0.00056600146,0.032848794,0.018865163,0.0013188003],"about_ca_topic_score_codex":0.0017898576,"about_ca_topic_score_gemma":0.004149618,"teacher_disagreement_score":0.71668226,"about_ca_system_score_codex":0.00008900788,"about_ca_system_score_gemma":0.00008464003,"threshold_uncertainty_score":0.999991},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28219104,0.0038501066,0.043208364,0.21063136,0.001765905,0.0006146901,0.000009051967,0.00016525533,0.45756423],"genre_scores_gemma":[0.9930697,0.00019415349,0.0031703727,0.0025530842,0.0007693661,0.0000018172743,2.5453664e-7,0.000009510494,0.0002317354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977569,0.0002923814,0.00068649446,0.00026486782,0.0006602311,0.0003391246],"domain_scores_gemma":[0.9980465,0.0005432595,0.00045178138,0.00054128474,0.0002225301,0.00019460639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010560481,0.00022462064,0.00047063298,0.00012379463,0.00014674953,0.000073969975,0.0017414836,0.00017409676,0.00042007543],"category_scores_gemma":[0.00032082383,0.00011589469,0.00037891886,0.0004075618,0.00022188367,0.00025783648,0.00013378356,0.0007812716,0.00009816483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014331155,0.00046010697,0.00019190008,0.000017513868,0.0000537635,0.00017968728,0.0001978728,0.00037373597,0.0002204945,0.9853902,0.0014455584,0.011325864],"study_design_scores_gemma":[0.0005851638,0.0016948638,0.0031770647,0.00009570477,0.000022882163,0.00040187224,0.000009297148,0.0029233443,0.0002972595,0.98844236,0.0021644717,0.00018571953],"about_ca_topic_score_codex":0.0000020409484,"about_ca_topic_score_gemma":4.846629e-7,"teacher_disagreement_score":0.7108787,"about_ca_system_score_codex":0.000056966586,"about_ca_system_score_gemma":0.00012811954,"threshold_uncertainty_score":0.47260484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05680574,0.0016620222,0.9397311,0.0009705273,0.00041977383,0.00012616735,1.4719691e-7,0.000023321565,0.00026120114],"genre_scores_gemma":[0.12622912,0.00013360631,0.8732972,0.00015552058,0.0001433118,0.0000052099867,6.3472385e-8,0.0000057690895,0.000030203373],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967047,0.0010456577,0.00083337154,0.0005147398,0.00038646904,0.00051504053],"domain_scores_gemma":[0.99650365,0.0024418915,0.00038352062,0.00020789352,0.00017268576,0.0002903772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012379769,0.00021227224,0.00051153306,0.00050433475,0.00015440368,0.00022134074,0.00066536374,0.00013899786,0.000018591803],"category_scores_gemma":[0.0017947567,0.000118773845,0.0000951042,0.0009984407,0.0006067276,0.00094107015,0.0005665276,0.00043488992,0.0000016430706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012475939,0.00008271385,0.010716364,0.000012193584,0.000007738572,0.000052377025,0.00045163013,0.0000035378184,0.0025559682,0.103841856,0.0000050450076,0.8822581],"study_design_scores_gemma":[0.0031627733,0.0013323389,0.18779172,0.00060905854,0.00002495535,0.0017240781,0.00008475939,0.018081311,0.0032801076,0.77576256,0.0074136704,0.0007326651],"about_ca_topic_score_codex":0.0000033342062,"about_ca_topic_score_gemma":0.0000025220309,"teacher_disagreement_score":0.88152546,"about_ca_system_score_codex":0.00007980516,"about_ca_system_score_gemma":0.00014344114,"threshold_uncertainty_score":0.48434567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011153048,0.00015885443,0.984601,0.0023757122,0.00026051316,0.00026761994,0.000004590949,0.00014178894,0.0010368639],"genre_scores_gemma":[0.9314735,0.00000925173,0.06788866,0.00034867917,0.00015017122,0.00008710659,0.000006935243,0.000006858597,0.000028859251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884576,0.000029957448,0.0002377821,0.00041341264,0.00016657583,0.00030653446],"domain_scores_gemma":[0.9990992,0.00029185938,0.000065816275,0.00021924508,0.0002208805,0.000103005856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030644043,0.00014326663,0.00013615651,0.000050137638,0.00047093537,0.00023350737,0.00032195766,0.00007517128,0.000036776637],"category_scores_gemma":[0.00039420294,0.00011824862,0.000060472685,0.0002658741,0.0002369781,0.00026947938,0.00007585249,0.00009380431,0.00007021648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023226361,0.00011033565,0.00016293621,0.000012441974,0.000005514824,0.0000051276547,0.0005507009,0.0021038,0.00015528029,0.9871186,0.000024453144,0.009727564],"study_design_scores_gemma":[0.000069009715,0.00026352768,0.00024898243,0.000046166002,0.000007188963,0.000011171201,0.00007792222,0.07026698,0.030755227,0.897495,0.00054529874,0.00021354845],"about_ca_topic_score_codex":0.0000251138,"about_ca_topic_score_gemma":0.00011695346,"teacher_disagreement_score":0.92032045,"about_ca_system_score_codex":0.000041207244,"about_ca_system_score_gemma":0.00013445181,"threshold_uncertainty_score":0.48220387},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3754808,0.0010076037,0.5715987,0.00025761797,0.0021302525,0.00009929396,0.0000022174918,0.000074566975,0.04934896],"genre_scores_gemma":[0.9354322,0.00015946815,0.06405941,0.000071344664,0.00020605304,0.0000017975108,4.868396e-7,0.00000675602,0.000062500185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881893,0.00006816081,0.00038349815,0.00016150909,0.0003890696,0.0001788226],"domain_scores_gemma":[0.9987264,0.00007993572,0.00041658845,0.00014452112,0.0005081812,0.00012434082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092723966,0.000120214616,0.00021357003,0.00015363237,0.00006468935,0.0001732642,0.0009873302,0.000049555452,0.000029940416],"category_scores_gemma":[0.00018084532,0.00009281941,0.00010233874,0.00010094386,0.000059830767,0.00092568184,0.00024815465,0.00018106471,0.000006883665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004946273,0.00039365725,0.036412388,0.000037186623,0.0005018007,0.0014142247,0.013506414,0.000016027563,0.0004321541,0.8268434,0.00035624747,0.11959187],"study_design_scores_gemma":[0.03510336,0.0017112744,0.32513747,0.002546172,0.00031374994,0.069021635,0.0023828177,0.15048541,0.04845704,0.34176812,0.019806786,0.0032661918],"about_ca_topic_score_codex":0.000021363932,"about_ca_topic_score_gemma":0.0000019303566,"teacher_disagreement_score":0.5599514,"about_ca_system_score_codex":0.00004469813,"about_ca_system_score_gemma":0.00007846933,"threshold_uncertainty_score":0.3785066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83862215,0.0015748261,0.11561506,0.008648104,0.0006146183,0.0020528785,0.000025911004,0.0004589154,0.03238752],"genre_scores_gemma":[0.98786294,0.00010441647,0.003987378,0.000017517048,0.000088242086,0.0000030315514,0.000029112385,0.0000099812105,0.007897352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708015,0.0004669203,0.0001979514,0.00074011576,0.00083267695,0.0006821821],"domain_scores_gemma":[0.996851,0.00026265468,0.00012967293,0.0011658256,0.0013573723,0.00023345745],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016991185,0.00017350855,0.00027998837,0.0004324081,0.00070050504,0.00017815971,0.0020358318,0.00010390482,0.0001664632],"category_scores_gemma":[0.0006385667,0.00017006016,0.000106008825,0.0011802372,0.00088839355,0.0014564185,0.001079638,0.00041979994,0.0011565455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012007916,0.0010396403,0.00506951,0.00047027456,0.00025753805,0.00017922278,0.06988646,0.000048939135,0.037238557,0.6893007,0.08772896,0.108660094],"study_design_scores_gemma":[0.0067308308,0.0028163714,0.16325527,0.0004853906,0.000084118736,0.0002880157,0.019746793,0.016688606,0.061110325,0.52650195,0.19909753,0.003194777],"about_ca_topic_score_codex":0.0032740585,"about_ca_topic_score_gemma":0.0002492505,"teacher_disagreement_score":0.16279875,"about_ca_system_score_codex":0.00026274825,"about_ca_system_score_gemma":0.00044311272,"threshold_uncertainty_score":0.99962115},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17336926,0.00013055338,0.81021374,0.00093280326,0.00029442218,0.0002868058,0.000002804257,0.000092395574,0.014677228],"genre_scores_gemma":[0.93699527,0.000037292968,0.06264378,0.000051562416,0.000061199964,0.000016052589,0.0000010982747,0.000006901638,0.00018685228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990029,0.000013578321,0.00030504478,0.00023626459,0.00020549296,0.00023672468],"domain_scores_gemma":[0.99895453,0.0001201899,0.00014604442,0.00036192927,0.00030576048,0.000111552705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052442995,0.00012836068,0.00019065056,0.000059162372,0.00013819287,0.000144179,0.00034504844,0.000058427933,0.00006174237],"category_scores_gemma":[0.00009890952,0.00008962881,0.00005121036,0.00023352212,0.00030531202,0.00017682607,0.00009226034,0.00015270333,0.000048504073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002835401,0.0003327842,0.00007886007,0.000038280614,0.000017859737,0.0000029412365,0.0011762029,0.0000070166043,0.0017084504,0.8334092,0.000080650345,0.16314492],"study_design_scores_gemma":[0.00005080051,0.0007771197,0.00006498066,0.00016553329,0.000028748056,0.00009989781,0.0013012715,0.12062985,0.1631077,0.70908856,0.0042327894,0.00045274015],"about_ca_topic_score_codex":0.000015477164,"about_ca_topic_score_gemma":0.000086194006,"teacher_disagreement_score":0.76362604,"about_ca_system_score_codex":0.0000015548165,"about_ca_system_score_gemma":0.00006540042,"threshold_uncertainty_score":0.36549568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4882199,0.004524014,0.30568022,0.0003462423,0.003657239,0.000518006,0.0000010717249,0.0006289665,0.19642437],"genre_scores_gemma":[0.9955309,0.000007532521,0.0026599606,0.00008103262,0.00026180607,0.000007870406,7.121578e-7,0.000007999701,0.0014421991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998783,0.000059330832,0.00021446594,0.00033930427,0.00017349151,0.00043038925],"domain_scores_gemma":[0.99927694,0.000101742415,0.000069984104,0.00039178063,0.000056618574,0.00010294906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000663951,0.00012626231,0.00018183517,0.00014210337,0.000078796176,0.000106310334,0.0005604414,0.000071452654,0.000008854691],"category_scores_gemma":[0.0000884817,0.00011042384,0.000044775075,0.00048405863,0.000033412725,0.00031616093,0.00015086007,0.00017315058,0.00013503537],"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.000012519131,0.00010594988,0.020295031,0.000027232123,0.0000128040365,0.00023569517,0.0074661314,0.0002177328,0.0004469116,0.945962,0.00090591714,0.024312085],"study_design_scores_gemma":[0.0044313273,0.0007560207,0.45721278,0.00058633,0.000036032176,0.0010930701,0.0037955653,0.41484493,0.006332842,0.041149016,0.066623636,0.003138456],"about_ca_topic_score_codex":0.00029540085,"about_ca_topic_score_gemma":0.00009177861,"teacher_disagreement_score":0.904813,"about_ca_system_score_codex":0.0000873601,"about_ca_system_score_gemma":0.000035207166,"threshold_uncertainty_score":0.45029536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94064665,0.0012012454,0.031271294,0.011808584,0.0015598295,0.000085785636,2.3582953e-7,0.000034475084,0.013391906],"genre_scores_gemma":[0.9821184,0.0001272515,0.015498317,0.00065419724,0.00026169102,3.5177337e-7,1.8690477e-8,0.0000049474766,0.0013348027],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932146,0.000057930625,0.00015783933,0.000081120175,0.00023076276,0.00015090381],"domain_scores_gemma":[0.998696,0.000049564936,0.00023427962,0.0007897169,0.00015688523,0.00007351813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033408374,0.00007655352,0.00012502534,0.000037753638,0.0001104625,0.000115206145,0.003336279,0.000029184845,0.000013472314],"category_scores_gemma":[0.0003472379,0.00003323522,0.0000831481,0.0002843112,0.00003813587,0.00029271012,0.0005295991,0.00019089141,0.000022902934],"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.0004284223,0.0012812694,0.44890365,0.00005325067,0.00075907924,0.0035188184,0.015049363,0.0048053707,0.0062023513,0.13167334,0.19490051,0.19242458],"study_design_scores_gemma":[0.006277125,0.0034770044,0.16486098,0.0008367259,0.00019863226,0.025143724,0.00048774516,0.008522926,0.025232984,0.19954783,0.5640287,0.0013856278],"about_ca_topic_score_codex":0.0000025863026,"about_ca_topic_score_gemma":0.0000065182453,"teacher_disagreement_score":0.3691282,"about_ca_system_score_codex":0.00003204584,"about_ca_system_score_gemma":0.00009512847,"threshold_uncertainty_score":0.6199692},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021394037,0.000030145407,0.97260606,0.00042093327,0.00029075402,0.00039958223,0.0000059669633,0.0001644357,0.0046880865],"genre_scores_gemma":[0.62805146,0.0000029444254,0.37134,0.00030707032,0.0000105156705,0.000067073015,0.000021317002,0.000007833855,0.00019176092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836206,0.00014400316,0.00034168828,0.000506448,0.00035394984,0.00029186832],"domain_scores_gemma":[0.99896026,0.00014464968,0.00013085295,0.0004284863,0.0002182113,0.00011753674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024703992,0.00020878327,0.00023362899,0.00027454516,0.00021410723,0.00009673979,0.0006768834,0.00009233691,0.00001778127],"category_scores_gemma":[0.00005653512,0.00018726273,0.00013759933,0.00073548005,0.000056139885,0.0002826552,0.000017901744,0.00016803277,0.000063374115],"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.00003420579,0.0029253606,0.00023788137,0.00009550198,0.0001017418,0.000011729163,0.0018319276,0.1876355,0.0022198828,0.5835656,0.000047488964,0.22129318],"study_design_scores_gemma":[0.0015863389,0.0014472383,0.018938083,0.00008084651,0.00005392421,0.00028467955,0.00018506807,0.6603329,0.0020259926,0.31257215,0.0014503915,0.0010423927],"about_ca_topic_score_codex":0.000006740702,"about_ca_topic_score_gemma":0.0000033766962,"teacher_disagreement_score":0.60665745,"about_ca_system_score_codex":0.00009922346,"about_ca_system_score_gemma":0.00010100776,"threshold_uncertainty_score":0.7636352},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37090474,0.00086693646,0.50148517,0.00054152304,0.00065751286,0.00027799953,0.0000012235425,0.00037959058,0.12488528],"genre_scores_gemma":[0.99146724,0.00006974011,0.0076909256,0.0001854118,0.00009370198,0.000016868167,8.9626e-7,0.0000057956913,0.00046942566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842626,0.00010097968,0.00036265026,0.00048576685,0.00020502126,0.0004193425],"domain_scores_gemma":[0.9992387,0.00014744618,0.00005543124,0.0004156879,0.00005308149,0.00008960322],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032192757,0.00015682154,0.00017100232,0.000096823285,0.00013895577,0.0002551609,0.0010223628,0.000086572894,0.00058050785],"category_scores_gemma":[0.00010039441,0.00013335662,0.000055980396,0.00057294965,0.000106213934,0.0005145587,0.00011010238,0.00018273124,0.0014454147],"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.000009724455,0.00012634673,0.0006699209,0.0000050969197,0.000002683618,0.000026544129,0.0026085335,0.00093390816,0.00062460115,0.17932041,0.000074439355,0.8155978],"study_design_scores_gemma":[0.000039313385,0.00015735801,0.0024365473,0.00009264892,0.0000040722884,0.000019053734,0.00032588805,0.12183957,0.060073487,0.81158596,0.002902733,0.00052334805],"about_ca_topic_score_codex":0.00020330638,"about_ca_topic_score_gemma":0.00036539786,"teacher_disagreement_score":0.81507444,"about_ca_system_score_codex":0.000034367364,"about_ca_system_score_gemma":0.000062520056,"threshold_uncertainty_score":0.9993321},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020029042,0.000029175362,0.97518826,0.0021164375,0.00014445477,0.0003212606,0.0000010547178,0.00015481646,0.0020154796],"genre_scores_gemma":[0.9226236,0.000001784607,0.076429956,0.000808738,0.000035373025,0.00002812197,0.000011144507,0.000008660698,0.000052626758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854356,0.0002098797,0.0002067242,0.00039794433,0.00036906498,0.0002728185],"domain_scores_gemma":[0.99817574,0.0011447057,0.000070564056,0.0003999825,0.00015502721,0.000053979184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003634844,0.0001850889,0.00013829037,0.00023820081,0.0003888438,0.00017075265,0.0005438717,0.00006520627,0.000013318883],"category_scores_gemma":[0.00004285612,0.00012351674,0.00007422692,0.0010192656,0.00006729205,0.00018706977,0.0000068234986,0.00027878812,0.000103041886],"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.00007024954,0.0008133386,0.000109853354,0.000010441771,0.00001824063,0.00007219181,0.0020083012,0.6840578,0.000007897092,0.050463144,0.00003807498,0.2623305],"study_design_scores_gemma":[0.0015532051,0.0009316435,0.007354265,0.00009379749,0.000020621597,0.00014951918,0.00018860745,0.9306037,0.000079742545,0.057861697,0.00079117244,0.0003720392],"about_ca_topic_score_codex":0.000020805164,"about_ca_topic_score_gemma":0.00016418827,"teacher_disagreement_score":0.90259457,"about_ca_system_score_codex":0.000115363335,"about_ca_system_score_gemma":0.0001509995,"threshold_uncertainty_score":0.50368667},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018362612,0.000116950585,0.9440327,0.0023217194,0.0015671822,0.00021719401,0.000001315122,0.0003002766,0.033079997],"genre_scores_gemma":[0.9850421,0.0000049143678,0.01372457,0.0006357828,0.00022016148,0.000009487337,0.0000012010571,0.000008234339,0.0003535576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984843,0.00010338845,0.0003258861,0.0004376677,0.00030433078,0.000344402],"domain_scores_gemma":[0.9986447,0.000340541,0.000055122586,0.0004871192,0.000215882,0.0002566467],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004561654,0.00015437792,0.00015784104,0.00008958819,0.00021713304,0.00028604345,0.00043252672,0.00007171139,0.000052726544],"category_scores_gemma":[0.0009788702,0.00013509733,0.000074342024,0.00027132462,0.0001048536,0.00028950485,0.00017899887,0.00018167144,0.0030627325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005205716,0.00016841205,0.000109080465,0.0000020207285,0.0000073564843,0.000049469938,0.0023115892,0.0006342635,0.00023239251,0.94907355,0.0017367731,0.04566987],"study_design_scores_gemma":[0.000084606036,0.0005191067,0.00032210836,0.00005705631,0.00001566408,0.00009273389,0.0005790561,0.3889104,0.10045444,0.4989456,0.009393097,0.0006261198],"about_ca_topic_score_codex":0.000051631498,"about_ca_topic_score_gemma":0.00015582936,"teacher_disagreement_score":0.96667945,"about_ca_system_score_codex":0.00006288259,"about_ca_system_score_gemma":0.00024375734,"threshold_uncertainty_score":0.9977135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43061188,0.001535626,0.50837874,0.0030588412,0.0005834118,0.0004011675,0.000003702812,0.00095392275,0.05447269],"genre_scores_gemma":[0.976288,0.000007659125,0.022894308,0.00028359907,0.000048128823,0.0000034575164,0.0000015459322,0.000008015697,0.0004652806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881685,0.00007187593,0.00015519396,0.00040370005,0.00020556855,0.00034681094],"domain_scores_gemma":[0.99913806,0.000082853054,0.00009091141,0.0005457323,0.00004096039,0.00010146784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000190444,0.00018828943,0.00020686204,0.00008322832,0.00014486648,0.00015692387,0.0008032914,0.00006884106,0.000023386954],"category_scores_gemma":[0.00006736479,0.00012411104,0.00006150708,0.00024415733,0.00005723264,0.00031649758,0.00007200937,0.00016994608,0.00006398941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007124922,0.0002214893,0.00806657,0.000066691784,0.000063511136,0.00036991428,0.0045135925,0.00045537308,0.00597673,0.70934075,0.0005158876,0.27033824],"study_design_scores_gemma":[0.0014586997,0.0012674845,0.11043532,0.00035454344,0.00004359108,0.0009703614,0.00029366446,0.07526276,0.0036376494,0.80077004,0.0036733137,0.0018325918],"about_ca_topic_score_codex":0.000027026139,"about_ca_topic_score_gemma":0.00005057555,"teacher_disagreement_score":0.5456761,"about_ca_system_score_codex":0.000050884828,"about_ca_system_score_gemma":0.00006176577,"threshold_uncertainty_score":0.50611013},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46875802,0.021255612,0.034778226,0.05724445,0.0035122621,0.0008067857,0.0000064441274,0.002098708,0.4115395],"genre_scores_gemma":[0.9936147,0.000112393674,0.0035571167,0.00065190875,0.0012309337,0.000021383028,0.0000012544568,0.000010639464,0.00079971476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984839,0.00007141206,0.00025068905,0.0004807212,0.0003094216,0.00040385345],"domain_scores_gemma":[0.9992302,0.00014572954,0.000069489965,0.0003483557,0.00010856086,0.00009764768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001908661,0.00022614353,0.00030794778,0.00006496741,0.00032850544,0.00009137911,0.00064723426,0.000078685574,0.00001374125],"category_scores_gemma":[0.00012561145,0.00016176392,0.00012481218,0.00028785245,0.00020461951,0.00021376915,0.00045520737,0.0001627666,0.00038666005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044274043,0.00010145475,0.0025798108,0.000010327074,0.000049060487,0.00006279109,0.00025136798,0.00001281335,0.00016890517,0.992629,0.002535942,0.0015941187],"study_design_scores_gemma":[0.0002844131,0.000118142925,0.004742942,0.000012874513,0.000012450914,0.000021832495,0.000007189334,0.0006328498,0.0007373106,0.98837185,0.0047952016,0.00026296862],"about_ca_topic_score_codex":0.000039423572,"about_ca_topic_score_gemma":0.000011410597,"teacher_disagreement_score":0.5248566,"about_ca_system_score_codex":0.00006748969,"about_ca_system_score_gemma":0.000024838168,"threshold_uncertainty_score":0.65965414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07192456,0.013703249,0.8768162,0.00025925133,0.021990944,0.0041193445,0.00095965335,0.002587637,0.0076391236],"genre_scores_gemma":[0.94101304,0.00006540693,0.057107087,0.000012289365,0.0006653691,0.00035537605,0.0005393531,0.00006540387,0.00017668738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756354,0.00006342433,0.00054962747,0.0008498347,0.00019968249,0.00077391946],"domain_scores_gemma":[0.9960417,0.0010877623,0.00011443063,0.0023822088,0.00017122335,0.0002026791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017158418,0.0003577741,0.00038323514,0.00014729596,0.00028536725,0.00044770236,0.002568144,0.00011227165,0.0000032407934],"category_scores_gemma":[0.0008591687,0.00027721483,0.00009797751,0.00044913215,0.0000981108,0.0009895324,0.0010931254,0.00047985232,0.00004680631],"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.000066834604,0.00084574346,0.009182418,0.003307548,0.0003199284,0.00015098094,0.003266337,0.00006354248,0.0190269,0.62732846,0.011394652,0.32504663],"study_design_scores_gemma":[0.0007315585,0.000051555013,0.0021815414,0.00040603714,0.000031662927,0.00009638934,0.00026393455,0.64995944,0.0008074042,0.00003382256,0.34482095,0.00061568664],"about_ca_topic_score_codex":0.000052428542,"about_ca_topic_score_gemma":0.0011901414,"teacher_disagreement_score":0.8690885,"about_ca_system_score_codex":0.000083063474,"about_ca_system_score_gemma":0.00021998801,"threshold_uncertainty_score":0.999968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8128927,0.004606377,0.014805625,0.0016241045,0.0010437085,0.0003550985,0.000019457013,0.0003941061,0.16425885],"genre_scores_gemma":[0.99554175,0.00015991046,0.002391636,0.0007039987,0.00021105894,0.000022418099,8.2062576e-7,0.000006386118,0.0009620326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885225,0.00014416165,0.00019181299,0.00046629892,0.000041130847,0.00030432356],"domain_scores_gemma":[0.9990872,0.0002792515,0.000081806495,0.00039570598,0.000013590125,0.0001424529],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005691287,0.00015019572,0.00020751085,0.0000396307,0.0001266778,0.00011042719,0.0005174611,0.00008679778,0.0005656973],"category_scores_gemma":[0.00005708707,0.00013106104,0.000055861467,0.0000381348,0.0002709366,0.0003541353,0.00027296168,0.0001196146,0.0007885054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097698,0.000048197697,0.0017728854,0.000008159854,0.000015348214,0.000046410052,0.0015467994,0.0000029654711,0.000044613866,0.96544445,0.001123102,0.029937306],"study_design_scores_gemma":[0.0029035218,0.0010226284,0.10559485,0.00007876439,0.000049599297,0.0015477134,0.00040974023,0.09344711,0.0012735807,0.7057984,0.08553383,0.0023402665],"about_ca_topic_score_codex":0.0000127330395,"about_ca_topic_score_gemma":0.000009938071,"teacher_disagreement_score":0.25964606,"about_ca_system_score_codex":0.00005757154,"about_ca_system_score_gemma":0.000018552731,"threshold_uncertainty_score":0.9999895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8145744,0.010071719,0.15097205,0.0007755364,0.002026409,0.00013307114,7.23848e-7,0.000057855246,0.021388182],"genre_scores_gemma":[0.988385,0.000074994845,0.011195388,0.000090421236,0.0002025276,5.433032e-7,1.6864707e-8,0.0000018604327,0.000049256054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875957,0.00014162877,0.0003986071,0.00018820101,0.00029938773,0.00021259065],"domain_scores_gemma":[0.9993487,0.000115595656,0.00021969664,0.00011253386,0.00008766232,0.000115793395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011693855,0.00010469222,0.00027128783,0.00024757494,0.00012750477,0.00039526768,0.0006915772,0.00003761749,0.0000057206153],"category_scores_gemma":[0.000016062373,0.00006668023,0.000061283456,0.00037881875,0.00016092703,0.00060594786,0.00011181522,0.00011777681,0.000008542265],"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.000011142268,0.00037540027,0.102490194,0.00031770024,0.00009166356,0.0025961327,0.031582817,0.0016126581,0.0004249348,0.45109847,0.006902061,0.40249684],"study_design_scores_gemma":[0.002834051,0.0020895337,0.032097645,0.0022676934,0.000022522796,0.013055849,0.0053516617,0.9344437,0.0008670967,0.0014427443,0.0045519965,0.0009754916],"about_ca_topic_score_codex":0.0000107233545,"about_ca_topic_score_gemma":0.0000071974337,"teacher_disagreement_score":0.93283105,"about_ca_system_score_codex":0.000032832504,"about_ca_system_score_gemma":0.000058411948,"threshold_uncertainty_score":0.38115755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11131493,0.0000666567,0.88591975,0.000745911,0.00020582564,0.00010552296,0.0000012004018,0.00004367032,0.0015965126],"genre_scores_gemma":[0.93948555,0.00002741822,0.060224645,0.0001682418,0.000048843194,0.000006077623,0.0000011102992,0.0000044699136,0.00003362282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990982,0.000019548626,0.00032817517,0.00020282101,0.00017478155,0.0001764811],"domain_scores_gemma":[0.99908876,0.00014582179,0.00016009732,0.00029246428,0.00023574612,0.000077085395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060852314,0.00010651496,0.00015884622,0.000080767364,0.000098887365,0.00012456105,0.00031824765,0.000072510644,0.000034714358],"category_scores_gemma":[0.00033896285,0.00008680612,0.00006049924,0.00019469886,0.000104377854,0.00021182555,0.00007292576,0.000113682574,0.000043486947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021454944,0.00020419835,0.000018628614,0.000038481085,0.0000041714006,0.0000017142193,0.0011272437,0.000035919205,0.018151563,0.91750056,0.000059230868,0.062856145],"study_design_scores_gemma":[0.000011088586,0.00008232919,0.00006231383,0.000024675772,0.0000039051624,0.0000038517796,0.00010713646,0.4200479,0.14120035,0.43822512,0.0001277873,0.00010351889],"about_ca_topic_score_codex":0.000020960624,"about_ca_topic_score_gemma":0.000065722554,"teacher_disagreement_score":0.82817066,"about_ca_system_score_codex":0.000002301923,"about_ca_system_score_gemma":0.000036850488,"threshold_uncertainty_score":0.35398507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1685386,0.0007333896,0.4394941,0.0027501164,0.003045061,0.0002515672,3.1530163e-7,0.00013672512,0.38505012],"genre_scores_gemma":[0.96705484,0.000023047505,0.03097596,0.00081284443,0.0010417305,0.0000027635847,1.8176661e-7,0.0000080179825,0.00008062883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885094,0.00008328571,0.00030868966,0.00016808198,0.00035790246,0.00023112174],"domain_scores_gemma":[0.9988768,0.00013179747,0.00042868068,0.0002754303,0.00017121482,0.00011605268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016096834,0.00012866527,0.00018739223,0.00010156651,0.00019073546,0.00017159295,0.00077008404,0.00006632662,0.0000046376676],"category_scores_gemma":[0.00013065926,0.000068968904,0.00009889009,0.00025987814,0.00004744457,0.00016885054,0.00010920032,0.00037015724,0.000072450704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099804805,0.00010383799,0.000029510242,0.000006097221,0.000033187396,0.000032667424,0.0068659843,0.0032699297,0.00455899,0.93045515,0.005285498,0.049259372],"study_design_scores_gemma":[0.0016470948,0.001012401,0.0003441942,0.00007348164,0.000051412953,0.00096383196,0.0016938179,0.01014413,0.014383022,0.9396793,0.029558107,0.00044915394],"about_ca_topic_score_codex":0.000002749166,"about_ca_topic_score_gemma":0.0000013487188,"teacher_disagreement_score":0.7985162,"about_ca_system_score_codex":0.00013383996,"about_ca_system_score_gemma":0.00012966989,"threshold_uncertainty_score":0.28124705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70444345,0.0005007243,0.26848927,0.00007706987,0.00049905555,0.0004950869,0.0000028323614,0.00034228768,0.025150202],"genre_scores_gemma":[0.9937856,0.00066449353,0.0044883518,0.000018493727,0.000050263876,9.2745046e-7,0.000007363926,0.0000112233,0.00097325764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998378,0.00012437269,0.000175899,0.0009835898,0.00006122353,0.00027696427],"domain_scores_gemma":[0.99870634,0.00008498657,0.00029578217,0.00061436,0.00012863059,0.0001699008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023777281,0.00025025915,0.0002760428,0.00014150534,0.00018984116,0.00018370031,0.00051431323,0.00024888717,0.000006522415],"category_scores_gemma":[0.00005460649,0.00026003039,0.00007914283,0.00024965007,0.00029595874,0.00034385486,0.0016483936,0.00041466297,0.000013687062],"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.000016901853,0.000093844974,0.076404534,0.00019192023,0.00013459622,0.0005016932,0.0037850544,0.00028214158,0.0000429742,0.9005301,0.00006272765,0.017953515],"study_design_scores_gemma":[0.0015025747,0.00021630873,0.011231211,0.00070419704,0.00026743647,0.00014127106,0.0006163015,0.52229834,0.0006231829,0.46047398,0.0006312286,0.0012939745],"about_ca_topic_score_codex":0.00013580365,"about_ca_topic_score_gemma":0.000043609063,"teacher_disagreement_score":0.52201617,"about_ca_system_score_codex":0.00004785448,"about_ca_system_score_gemma":0.000085171414,"threshold_uncertainty_score":0.9999852},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032172427,0.003644748,0.05596946,0.0008499554,0.00037440623,0.00051305024,0.0000050354606,0.00062022003,0.9058507],"genre_scores_gemma":[0.93585795,0.000060874467,0.03986383,0.00018717443,0.00011247446,0.000019950885,0.0000014759948,0.000007111395,0.023889184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898505,0.000027799491,0.0002000765,0.00032449726,0.00021561986,0.00024692543],"domain_scores_gemma":[0.9989757,0.0000737013,0.00007782839,0.00069130916,0.00009864118,0.00008280192],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013240197,0.0001244495,0.00016404937,0.00010662728,0.00007251549,0.00006117031,0.00092331495,0.00006198589,0.0005909845],"category_scores_gemma":[0.00003214894,0.00009683066,0.00008820837,0.0006020025,0.00005265993,0.00019804001,0.00021241113,0.0001307558,0.0009872526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027302035,0.00059996947,0.0013227839,0.00006733697,0.000049960458,0.00005614619,0.002469051,0.0000028005484,0.03190373,0.34080297,0.048736736,0.5739858],"study_design_scores_gemma":[0.0021422154,0.00025778214,0.0027361345,0.00006014126,0.000044884535,0.0004320281,0.0004975223,0.49044955,0.09586675,0.006046874,0.4001128,0.0013533208],"about_ca_topic_score_codex":0.000025212992,"about_ca_topic_score_gemma":0.00006783741,"teacher_disagreement_score":0.9036855,"about_ca_system_score_codex":0.000024154337,"about_ca_system_score_gemma":0.000038549322,"threshold_uncertainty_score":0.9997906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73943204,0.00128332,0.25665665,0.000036531466,0.00090983044,0.00010022438,3.213003e-7,0.00041615922,0.0011649131],"genre_scores_gemma":[0.8451947,0.000018265897,0.15435313,0.00004143908,0.0003409506,5.711451e-7,4.607996e-7,0.000021278407,0.000029202436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767095,0.000101690726,0.00076933583,0.0002687712,0.00051131705,0.00067795505],"domain_scores_gemma":[0.9980382,0.00017914729,0.0007935509,0.00031445778,0.00039496497,0.0002797109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019367277,0.00025280984,0.00040717723,0.00045254454,0.00027303706,0.0003500698,0.00084149925,0.0001496094,0.000009029505],"category_scores_gemma":[0.0003463748,0.00020547785,0.0002091831,0.00083488843,0.00006319574,0.0007125559,0.00019365919,0.00039476482,0.000009359329],"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.0002011122,0.0009882543,0.24004658,0.00026376703,0.0011735769,0.005924863,0.031172464,0.03687591,0.15971145,0.015498462,0.0012386708,0.5069049],"study_design_scores_gemma":[0.0022664098,0.0007836327,0.102186404,0.001463708,0.00015912198,0.007137577,0.00080264086,0.8507912,0.026785728,0.00054278347,0.0060346266,0.001046149],"about_ca_topic_score_codex":0.000024605226,"about_ca_topic_score_gemma":0.000018592758,"teacher_disagreement_score":0.8139153,"about_ca_system_score_codex":0.00018151487,"about_ca_system_score_gemma":0.00022146423,"threshold_uncertainty_score":0.8379143},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018918138,0.0061898786,0.02103132,0.008603462,0.0014060145,0.0005919414,0.0000041549197,0.0010830874,0.942172],"genre_scores_gemma":[0.98779106,0.00018562398,0.008068799,0.0015242159,0.00096735195,0.000047405065,0.000001086359,0.0000064859682,0.0014079977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987951,0.00004897921,0.00014930399,0.00040765846,0.00019834217,0.0004006487],"domain_scores_gemma":[0.99925107,0.00006519215,0.00006270265,0.00044001636,0.00006517272,0.00011582234],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021686382,0.0001577045,0.00018376487,0.000055339468,0.00022422694,0.000080661106,0.0008379434,0.00006372157,0.00009067196],"category_scores_gemma":[0.00004511646,0.000113731905,0.0000797285,0.0003371974,0.000046332472,0.0003087454,0.00046515296,0.00012613338,0.001417095],"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.0000057122343,0.0005800689,0.007072048,0.000013817347,0.000055380842,0.00006257439,0.008172947,0.0000072987555,0.00011333008,0.6840823,0.040105186,0.2597293],"study_design_scores_gemma":[0.0007132934,0.00038744637,0.12189291,0.000015484367,0.000015942545,0.0000276444,0.00009037204,0.0011417251,0.0002324389,0.0063220044,0.8685946,0.0005661249],"about_ca_topic_score_codex":0.000013830916,"about_ca_topic_score_gemma":0.0000535722,"teacher_disagreement_score":0.9688729,"about_ca_system_score_codex":0.00004508591,"about_ca_system_score_gemma":0.000030522704,"threshold_uncertainty_score":0.99936044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44994602,0.006882268,0.29647198,0.015399673,0.00047707162,0.00073685055,0.000009419148,0.0006299989,0.22944671],"genre_scores_gemma":[0.9882945,0.0003423399,0.008872933,0.0022771494,0.00004146448,0.000014049026,0.0000032840617,0.000005320642,0.00014899693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875766,0.000024564517,0.00023604369,0.00043496152,0.00016971276,0.00037705738],"domain_scores_gemma":[0.99929446,0.000057319667,0.00011338252,0.0003456331,0.00006360328,0.00012558608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026625124,0.00019145139,0.00030935006,0.00007057281,0.00012187067,0.000058843543,0.0005855887,0.00016116878,0.000030325984],"category_scores_gemma":[0.000031775682,0.00013426047,0.00009080536,0.00025705242,0.00017678758,0.00011258543,0.0002694066,0.00016166465,0.00007070661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008495204,0.00012774707,0.00005544951,0.00001664885,0.000012925229,0.000015697877,0.00026356484,0.00008053468,0.0010982683,0.9892764,0.0002508639,0.008793385],"study_design_scores_gemma":[0.00043787734,0.00034104445,0.0036748154,0.0000124718445,0.0000071778077,0.000032817265,0.00009225133,0.00018776493,0.0034039742,0.99014187,0.0014119756,0.00025597968],"about_ca_topic_score_codex":0.000006111426,"about_ca_topic_score_gemma":0.000010949235,"teacher_disagreement_score":0.53834844,"about_ca_system_score_codex":0.000008593856,"about_ca_system_score_gemma":0.00003745865,"threshold_uncertainty_score":0.5474983},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013789765,0.014260712,0.93652886,0.004214946,0.0030201427,0.00055250316,0.0000033765639,0.00028888363,0.02734083],"genre_scores_gemma":[0.9093807,0.0013500383,0.056904238,0.00016265195,0.0007142814,0.00006394363,0.000011052619,0.000043057815,0.031370074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967999,0.00014315115,0.0007402611,0.0009020582,0.00029628203,0.0011183827],"domain_scores_gemma":[0.99778557,0.00015287964,0.00024632548,0.00096389663,0.0004776037,0.00037372072],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008655319,0.00039608206,0.00036877653,0.00015971965,0.0005895039,0.0006440814,0.0011278951,0.0002664153,0.00041242316],"category_scores_gemma":[0.00041229007,0.0004103523,0.00026348358,0.001499187,0.00066296075,0.0012000023,0.00033102653,0.00038822248,0.007453329],"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.0000075050075,0.0005606928,0.0001616413,0.0001970695,0.000020833337,0.000082435305,0.011041716,0.084920466,0.0005445273,0.4539504,0.00023142096,0.44828126],"study_design_scores_gemma":[0.00023840641,0.0009860757,0.0005217211,0.0015643877,0.00007108553,0.0006539911,0.0014371587,0.53026253,0.097097486,0.30088893,0.06508976,0.0011884463],"about_ca_topic_score_codex":0.00037876068,"about_ca_topic_score_gemma":0.0003168337,"teacher_disagreement_score":0.8955909,"about_ca_system_score_codex":0.00035685487,"about_ca_system_score_gemma":0.00029972137,"threshold_uncertainty_score":0.99983484},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8398871,0.0005799749,0.14048748,0.00059905887,0.0009132581,0.00011642058,0.0000018596601,0.0001924199,0.017222455],"genre_scores_gemma":[0.97132987,0.0000046958253,0.028348155,0.00014004807,0.000084836494,0.0000019926688,4.4741634e-7,0.0000048457805,0.00008509344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992606,0.000020564805,0.0001066294,0.0002534835,0.00011852139,0.00024018553],"domain_scores_gemma":[0.9995786,0.000026737838,0.000032611686,0.0002873046,0.000018230041,0.000056493536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010184149,0.00009099668,0.00010771437,0.000096798474,0.000053800773,0.00007119677,0.000535445,0.000063919055,0.000016719338],"category_scores_gemma":[0.00005773043,0.00007675789,0.000033934983,0.0003842433,0.000020141184,0.0002209435,0.00015443559,0.00014315787,0.000051565148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017674471,0.00003671597,0.0056437645,0.000015737569,0.000006358608,0.000073042036,0.001113518,0.00019271969,0.004305162,0.96703523,0.000136833,0.021439167],"study_design_scores_gemma":[0.0019431255,0.00015672472,0.0776359,0.00022627556,0.00000869484,0.00021006378,0.00015069876,0.0028996042,0.07541535,0.831771,0.008679181,0.0009033931],"about_ca_topic_score_codex":0.000093376526,"about_ca_topic_score_gemma":0.00011413566,"teacher_disagreement_score":0.13526423,"about_ca_system_score_codex":0.00009001476,"about_ca_system_score_gemma":0.000060383165,"threshold_uncertainty_score":0.3130096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2810158,0.000059012487,0.6803555,0.0013973754,0.00056618237,0.0004786917,5.27211e-7,0.0002608448,0.035866052],"genre_scores_gemma":[0.9693941,0.0000023446096,0.029476896,0.00027976924,0.00003596424,0.0000128739985,0.0000018182709,0.0000041968456,0.000792061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990746,0.00007765412,0.00017393372,0.00029136523,0.00013502035,0.00024746542],"domain_scores_gemma":[0.99926907,0.00007626587,0.00004026997,0.00039448956,0.00012340593,0.00009651358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060503767,0.0001017121,0.00013058924,0.00010579772,0.00010236993,0.00018383385,0.00047553657,0.00006748913,0.000036061832],"category_scores_gemma":[0.00015038202,0.000079147954,0.000025294516,0.0006863698,0.00002218411,0.00041475968,0.00028690012,0.00021315468,0.00026768696],"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.000028479471,0.0012272149,0.023079261,0.00013172464,0.000016726442,0.00003940018,0.019810969,0.00032662682,0.07061198,0.5148085,0.01268386,0.3572353],"study_design_scores_gemma":[0.002531394,0.0010403607,0.15671793,0.00039426846,0.000008527789,0.000088585,0.000056380326,0.66843927,0.006368702,0.04402937,0.11894291,0.0013823413],"about_ca_topic_score_codex":0.00023396299,"about_ca_topic_score_gemma":0.0022999782,"teacher_disagreement_score":0.6883783,"about_ca_system_score_codex":0.000032960634,"about_ca_system_score_gemma":0.000047947746,"threshold_uncertainty_score":0.34406638},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071158414,0.00004300266,0.9872185,0.0018492902,0.00015952408,0.00083349016,0.000005658409,0.00021726819,0.0025574241],"genre_scores_gemma":[0.6680886,0.0000031230234,0.33012864,0.0010908316,0.000030997628,0.00054690085,0.000011278147,0.000009975043,0.00008965355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983252,0.00008873502,0.00027136426,0.00057587994,0.0003302598,0.00040854613],"domain_scores_gemma":[0.99897635,0.00019343,0.000051725237,0.00045371475,0.00015656823,0.00016820803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000219281,0.00022006748,0.00020417309,0.00033378534,0.00019599087,0.000181591,0.0008943233,0.0000973487,0.00004805807],"category_scores_gemma":[0.00002933995,0.00019437475,0.00009547072,0.00082545006,0.000057653222,0.00048713855,0.000037109894,0.00024384049,0.00037527023],"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.000011655082,0.00094914273,0.00014272676,0.000033058743,0.000022983771,0.000005265157,0.006134407,0.61857,0.000013507838,0.23050313,0.00014826203,0.14346585],"study_design_scores_gemma":[0.0003423255,0.00016420413,0.0024921468,0.000019116165,0.0000053224444,0.000019898918,0.000053818963,0.8291731,0.000012734899,0.16731048,0.00015342394,0.0002534247],"about_ca_topic_score_codex":0.0000768109,"about_ca_topic_score_gemma":0.000020780606,"teacher_disagreement_score":0.6609728,"about_ca_system_score_codex":0.00009704497,"about_ca_system_score_gemma":0.00006665019,"threshold_uncertainty_score":0.7926372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019706,0.0012494387,0.8653484,0.009033621,0.0061558643,0.00013578562,4.783234e-7,0.00014881454,0.09822163],"genre_scores_gemma":[0.9875014,0.000049537855,0.009545993,0.0010670888,0.0016910055,6.183037e-7,2.717272e-7,0.000006467185,0.00013765253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981869,0.00009642419,0.00062300963,0.00023339436,0.00048694471,0.00037332298],"domain_scores_gemma":[0.99820286,0.00035685473,0.0004749311,0.00027866132,0.00039588643,0.0002907972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016487819,0.0001748536,0.00034081395,0.00024152776,0.00013009574,0.00009729248,0.0009233523,0.00019135486,0.000044036806],"category_scores_gemma":[0.00060813024,0.00012011385,0.00025678388,0.00047089186,0.00009142048,0.00039430536,0.00015342797,0.00063482876,0.000109169916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014627112,0.00071445963,0.0014012787,0.000018993027,0.0000679309,0.0017500027,0.0005819813,0.00014103699,0.0018426586,0.9454055,0.00281942,0.04511047],"study_design_scores_gemma":[0.0009014966,0.0018978735,0.0064397226,0.000057993107,0.00003250721,0.0039477297,0.00003949522,0.002668745,0.0010658404,0.9759272,0.0066863843,0.0003350166],"about_ca_topic_score_codex":0.0000019994752,"about_ca_topic_score_gemma":0.0000025752017,"teacher_disagreement_score":0.9677954,"about_ca_system_score_codex":0.00012205798,"about_ca_system_score_gemma":0.00008852345,"threshold_uncertainty_score":0.48981005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012125533,0.0018811985,0.9298158,0.0045588,0.0006768806,0.0029344542,0.0000023376313,0.0006708636,0.047334075],"genre_scores_gemma":[0.6194152,0.000027792992,0.37932453,0.0007675759,0.00014277751,0.00012647956,0.0000051425463,0.000016899985,0.00017357586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968329,0.0009919357,0.00043411733,0.0006743306,0.00039317203,0.00067355006],"domain_scores_gemma":[0.99617857,0.0019336146,0.00040986718,0.00093191594,0.0003273592,0.00021865357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008296142,0.00033619732,0.00037577323,0.00009567721,0.0005029298,0.0007199288,0.0012146779,0.00019991897,0.0000064045403],"category_scores_gemma":[0.0021216725,0.00020872192,0.00012290126,0.00080826844,0.00047434182,0.00084229687,0.0006199978,0.0007369464,0.000018831417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007232889,0.00046888203,0.0000650465,0.0000707846,0.000058457048,0.000007991532,0.0028118931,0.0000060430903,0.0002354717,0.64445275,0.000024853616,0.35172552],"study_design_scores_gemma":[0.0018227383,0.0037447135,0.0012726097,0.0003313962,0.00084174454,0.003513767,0.0166071,0.0046673045,0.00090927863,0.6503403,0.31371877,0.0022302556],"about_ca_topic_score_codex":0.000018679884,"about_ca_topic_score_gemma":0.000008394013,"teacher_disagreement_score":0.60728973,"about_ca_system_score_codex":0.000016011963,"about_ca_system_score_gemma":0.000088752815,"threshold_uncertainty_score":0.8511433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29407778,0.00018248957,0.69907326,0.0010602596,0.0024098735,0.000081670136,0.00001175401,0.00003338559,0.003069521],"genre_scores_gemma":[0.9969947,0.00033245623,0.001293741,0.00061878876,0.0005912078,0.0000028548632,0.000004348287,0.0000074850004,0.00015443961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845695,0.000103586775,0.00057873264,0.00022807386,0.00045120253,0.00018143488],"domain_scores_gemma":[0.99830526,0.00019298897,0.00037882366,0.00010116488,0.00087641453,0.000145356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038683158,0.00014312661,0.00016975276,0.0002456577,0.00010873235,0.0006593648,0.00070631184,0.000063686195,0.0006788465],"category_scores_gemma":[0.00033551367,0.00012384204,0.00009651143,0.00016561463,0.00009973383,0.0013537174,0.00014011603,0.00026182205,0.00028353956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118838525,0.0002151954,0.0018372454,0.0000043688074,0.000068491994,0.0001861587,0.0040584696,0.00004942118,0.0003267525,0.0015708964,0.0006617761,0.99100935],"study_design_scores_gemma":[0.0011635739,0.0018695684,0.013653133,0.0017798732,0.0001222898,0.0024758726,0.0043517826,0.703022,0.11550389,0.14296308,0.010904529,0.002190383],"about_ca_topic_score_codex":0.000028127426,"about_ca_topic_score_gemma":0.00004164386,"teacher_disagreement_score":0.98881894,"about_ca_system_score_codex":0.000048827544,"about_ca_system_score_gemma":0.00002059163,"threshold_uncertainty_score":0.74328935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007137998,0.0001835042,0.95013195,0.00043402353,0.0015113816,0.00037978205,0.0000013187954,0.00024241395,0.039977655],"genre_scores_gemma":[0.96770185,0.0000042798374,0.02881937,0.000120918725,0.00015777262,0.000113989474,0.0000011165583,0.000007971302,0.0030727412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896574,0.000016635548,0.0001963912,0.0003445266,0.00015180097,0.00032491673],"domain_scores_gemma":[0.99887806,0.00013424749,0.00005790847,0.00063091377,0.00015382783,0.00014503836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309994,0.00012743387,0.00016931412,0.00004202524,0.00016600118,0.00023547371,0.0005986014,0.00008723242,0.000013217403],"category_scores_gemma":[0.00004980325,0.00009142283,0.00011819777,0.00010548343,0.000033437038,0.0003404185,0.00013545078,0.0000989952,0.00011383835],"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.0000021785952,0.00005815057,0.0000980368,0.000026661368,0.000016447972,0.000004458953,0.00025619502,0.00056622294,0.00032849584,0.99177176,0.00396191,0.002909474],"study_design_scores_gemma":[0.0003253846,0.000059772156,0.00012924074,0.0000085226775,0.000009040646,0.00003271755,0.000021290974,0.959166,0.0007532971,0.019192873,0.020119954,0.000181919],"about_ca_topic_score_codex":0.000039502123,"about_ca_topic_score_gemma":0.00014368056,"teacher_disagreement_score":0.9725789,"about_ca_system_score_codex":0.000014852923,"about_ca_system_score_gemma":0.00004823114,"threshold_uncertainty_score":0.37281147},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25527588,0.00006865319,0.728252,0.00028760397,0.0014186676,0.00012054322,0.0000011027485,0.00023006539,0.014345497],"genre_scores_gemma":[0.9799225,0.000010677675,0.019548124,0.0001026267,0.00030969994,0.0000022671136,8.825771e-7,0.0000072886164,0.000095961426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880266,0.000033429405,0.00026030847,0.00042261637,0.00015312506,0.0003278517],"domain_scores_gemma":[0.9991346,0.00020553751,0.00007344644,0.00038452173,0.00007216199,0.0001297478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003702143,0.00013714071,0.00013963494,0.000070611764,0.00026162658,0.000302873,0.0006359881,0.00007967214,0.00003951884],"category_scores_gemma":[0.00017390323,0.00012350423,0.000039196653,0.00024825256,0.00012304641,0.0002843139,0.0003073819,0.00030244747,0.00024962734],"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.0000037648388,0.000043528245,0.0013083323,0.0000065449294,0.000005319371,0.00001236591,0.0025562474,0.0000279807,0.008824262,0.6460552,0.000077310986,0.34107912],"study_design_scores_gemma":[0.00006731407,0.00018967835,0.008271938,0.000054054562,0.000012852256,0.00014915707,0.000567842,0.5000758,0.20001474,0.27940297,0.010330082,0.00086353853],"about_ca_topic_score_codex":0.000045716104,"about_ca_topic_score_gemma":0.00033433994,"teacher_disagreement_score":0.72464657,"about_ca_system_score_codex":0.000009514912,"about_ca_system_score_gemma":0.000035902383,"threshold_uncertainty_score":0.50363564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00941344,0.000023321585,0.8374037,0.001164374,0.00019590581,0.00024449284,3.3776166e-7,0.0002739078,0.15128049],"genre_scores_gemma":[0.4420886,0.000005170133,0.55605584,0.0012631346,0.000045370565,0.00005607142,0.0000021998324,0.000021081503,0.00046253644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988677,0.000023394614,0.00025271176,0.00032050666,0.00023470749,0.00030101291],"domain_scores_gemma":[0.9988598,0.00013448267,0.00012763099,0.0007579797,0.000032273492,0.00008780901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038465596,0.00016511879,0.00017712021,0.00007069697,0.00013786329,0.00012767936,0.000658571,0.00005970716,0.000029937853],"category_scores_gemma":[0.0000623211,0.00014239733,0.000056462377,0.0003028149,0.0000641239,0.000117102594,0.00007481524,0.00013447733,0.000757108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.1960215e-7,0.000072898954,0.000012249435,0.000025038353,0.0000116252195,0.0000035605535,0.0012359496,0.000010982482,0.020366685,0.97252643,0.0051729977,0.0005611678],"study_design_scores_gemma":[0.0023442167,0.00008537801,0.0005275261,0.0000717444,0.00008506544,0.00017078454,0.0006788779,0.010751721,0.106253,0.80776304,0.06924894,0.0020197332],"about_ca_topic_score_codex":8.792165e-7,"about_ca_topic_score_gemma":8.121702e-7,"teacher_disagreement_score":0.43267515,"about_ca_system_score_codex":0.0000432346,"about_ca_system_score_gemma":0.000049936127,"threshold_uncertainty_score":0.97313434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94773984,0.0006328444,0.03989581,0.00046210364,0.0011031195,0.00010677895,0.0000010454303,0.00001866696,0.010039788],"genre_scores_gemma":[0.99559647,0.000046261328,0.0036009839,0.0002080564,0.00019284654,0.0000012829275,1.8613147e-7,0.0000046389246,0.00034926133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985777,0.00012304707,0.00045498356,0.0001375155,0.0005061964,0.0002005282],"domain_scores_gemma":[0.99873155,0.00008990447,0.0005416094,0.0002726683,0.00028086413,0.00008340401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044065286,0.00011171567,0.00026322497,0.000094419636,0.00018336778,0.000027857917,0.0009992038,0.00006589404,0.000025410201],"category_scores_gemma":[0.00013205959,0.00006206572,0.00016059406,0.00032291608,0.00013529231,0.0002517078,0.00018434413,0.00023115224,0.000015359059],"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.00015713062,0.002865265,0.18229416,0.00019331154,0.00066719076,0.0011343413,0.03142737,0.0014538894,0.07340049,0.6716806,0.0155190015,0.019207228],"study_design_scores_gemma":[0.0034177203,0.0015133744,0.90740794,0.00043606886,0.0000892959,0.008294296,0.00038066224,0.006623406,0.032994423,0.03535335,0.002851436,0.00063800183],"about_ca_topic_score_codex":0.0000068418763,"about_ca_topic_score_gemma":8.766149e-7,"teacher_disagreement_score":0.7251138,"about_ca_system_score_codex":0.000048645667,"about_ca_system_score_gemma":0.00021002346,"threshold_uncertainty_score":0.25309667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7022856,0.0026260598,0.25773874,0.001600823,0.0008394718,0.00026346283,4.929296e-7,0.0001502176,0.03449516],"genre_scores_gemma":[0.9825247,0.00028861428,0.0152349435,0.001544003,0.0003167347,0.0000014924328,3.0855742e-7,0.0000061192964,0.000083114144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866986,0.00003837612,0.00041951978,0.00027439406,0.00028251368,0.00031530857],"domain_scores_gemma":[0.998933,0.00006848036,0.00045383078,0.0002569682,0.00011290731,0.00017480973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046038587,0.00019749526,0.00036182863,0.00014747107,0.00015169529,0.00017680487,0.0006172148,0.000120381905,0.000017547733],"category_scores_gemma":[0.000031313084,0.00014505752,0.000107546926,0.00024911284,0.000056719004,0.0003723255,0.0000701958,0.00036002084,0.000057436147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020426055,0.00036406756,0.00051969703,0.00003589172,0.00005970012,0.00018124517,0.0015327876,0.00058132474,0.01939941,0.75942117,0.0043868395,0.21331358],"study_design_scores_gemma":[0.0030686576,0.0013521898,0.054729033,0.00008601087,0.00007915632,0.0013623586,0.00026609472,0.009683073,0.0082098935,0.909238,0.011157367,0.0007681685],"about_ca_topic_score_codex":0.0000013003337,"about_ca_topic_score_gemma":0.0000029223254,"teacher_disagreement_score":0.2802391,"about_ca_system_score_codex":0.00007763538,"about_ca_system_score_gemma":0.0000685243,"threshold_uncertainty_score":0.5915274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050477977,0.0004259617,0.96552294,0.0011456702,0.000774773,0.00027973004,1.3294256e-7,0.00004322872,0.026759777],"genre_scores_gemma":[0.9901298,0.000073962954,0.008134703,0.0007478622,0.0005241555,0.000028686403,9.553817e-7,0.000010222563,0.00034964897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998476,0.00016990126,0.00046723962,0.00023895543,0.00029100184,0.00035690144],"domain_scores_gemma":[0.99749976,0.0012387807,0.00048903486,0.00032559116,0.00031698451,0.00012983507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026437629,0.00018392625,0.00030859985,0.00008645642,0.00042364866,0.00032007866,0.0010715778,0.00010507036,0.000018451552],"category_scores_gemma":[0.00044796438,0.00009904758,0.00018554892,0.000220632,0.00012528326,0.00021741398,0.000112428796,0.00029029723,0.000101862184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091676666,0.00005851771,0.000007440322,0.000007407901,0.000030051808,0.000006584292,0.000588345,0.00008998754,0.0006595801,0.952414,0.0007934816,0.045252945],"study_design_scores_gemma":[0.00070478406,0.00057410094,0.00022981987,0.0000038552917,0.00003003829,0.0001807746,0.00016797207,0.0045856982,0.0006571259,0.973023,0.019688189,0.00015466448],"about_ca_topic_score_codex":0.0000017722673,"about_ca_topic_score_gemma":0.000004628481,"teacher_disagreement_score":0.98508203,"about_ca_system_score_codex":0.00010253837,"about_ca_system_score_gemma":0.00019007524,"threshold_uncertainty_score":0.40390432},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011756442,0.3410607,0.4675445,0.048176378,0.006800525,0.0020382653,0.0000015371957,0.00038843765,0.13281403],"genre_scores_gemma":[0.11731782,0.39084837,0.44998333,0.0075997896,0.03268987,0.00035705004,0.000008887746,0.00006812129,0.0011267752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982508,0.00052711996,0.00048118713,0.00027950873,0.00023439455,0.00022702484],"domain_scores_gemma":[0.9986281,0.0002510462,0.00018817022,0.0007937944,0.000087642584,0.000051287727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020154493,0.00015108733,0.00051989965,0.00006950946,0.00007920881,0.000009921507,0.0009771498,0.00005694742,0.00009295994],"category_scores_gemma":[0.00056320877,0.00008284463,0.00014959864,0.0006804715,0.00017474467,0.00015281819,0.00022416898,0.00019879566,0.00017588958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002327253,0.00022873396,0.000059336206,0.0026687498,0.000021295724,0.000009990773,0.0011585706,0.000003166997,0.00020029694,0.93872684,0.024690956,0.032229725],"study_design_scores_gemma":[0.00042227225,0.00021728853,0.0013482268,0.0031600518,0.000058787715,0.0006986446,0.000020855006,0.001558652,0.0012917063,0.85418016,0.13656297,0.00048039196],"about_ca_topic_score_codex":0.0000036538281,"about_ca_topic_score_gemma":1.4938712e-7,"teacher_disagreement_score":0.13168725,"about_ca_system_score_codex":0.000035178356,"about_ca_system_score_gemma":0.000055577617,"threshold_uncertainty_score":0.33783057},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036172606,0.05407053,0.74765605,0.00095912913,0.0031597563,0.000332426,0.000011661121,0.0002599709,0.15737785],"genre_scores_gemma":[0.91117406,0.0021377201,0.016575716,0.00016261548,0.0009780432,0.00004074512,0.0000049748387,0.00004705315,0.068879046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961327,0.0006148742,0.00068860484,0.0007587605,0.0002776958,0.001527407],"domain_scores_gemma":[0.996969,0.00078634016,0.00022046093,0.0011681848,0.0002756878,0.00058032613],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017705844,0.0004856228,0.00047018423,0.00015245844,0.0004600698,0.00042324993,0.0014293253,0.0005037694,0.0009402436],"category_scores_gemma":[0.0005278131,0.00048372758,0.00032788445,0.00097620673,0.0010209312,0.0017724867,0.00066622504,0.00067285233,0.006253147],"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.000012779299,0.0009582553,0.0036611287,0.00034891695,0.000043045646,0.000059483624,0.020078417,0.0072811786,0.0012222967,0.651487,0.0024928383,0.31235465],"study_design_scores_gemma":[0.00007940594,0.00027683622,0.00097134034,0.0007042637,0.0000597513,0.0007059776,0.0020257714,0.6338098,0.06422769,0.05179111,0.24432014,0.0010279284],"about_ca_topic_score_codex":0.00016790889,"about_ca_topic_score_gemma":0.000046991056,"teacher_disagreement_score":0.8750015,"about_ca_system_score_codex":0.00019395849,"about_ca_system_score_gemma":0.00019376031,"threshold_uncertainty_score":0.99997306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10299989,0.0003748451,0.059105568,0.0007985942,0.0006067773,0.00018062074,0.0000027668839,0.00020247303,0.83572847],"genre_scores_gemma":[0.9914467,0.000013367085,0.0045955116,0.00010931905,0.00002895888,0.000001491412,6.3058155e-7,0.0000051335032,0.0037989276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991022,0.00005811241,0.00016553758,0.00024034992,0.00019376785,0.00024005899],"domain_scores_gemma":[0.9990725,0.000107907035,0.000065408,0.000560906,0.000094978175,0.00009828302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002509794,0.000095270836,0.0001787253,0.00007216465,0.000056157576,0.00004968165,0.00056839857,0.000053914802,0.00014325642],"category_scores_gemma":[0.00021224277,0.00007911803,0.00009662646,0.00042041796,0.00005970312,0.0002265019,0.00009617062,0.000083243605,0.00012577028],"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.000006262947,0.0002754796,0.009185562,0.000034476074,0.00012495583,0.00003162033,0.0010738388,0.000010465776,0.005169661,0.95206535,0.028664343,0.003357973],"study_design_scores_gemma":[0.0035551414,0.0010953839,0.06921096,0.00016395234,0.0002792179,0.00015714212,0.00039651574,0.107568465,0.1167776,0.10444843,0.5940885,0.0022586763],"about_ca_topic_score_codex":0.000023156565,"about_ca_topic_score_gemma":0.000014261106,"teacher_disagreement_score":0.88844675,"about_ca_system_score_codex":0.000021323734,"about_ca_system_score_gemma":0.00010234187,"threshold_uncertainty_score":0.32263395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27352703,0.0058466583,0.62797904,0.0002841532,0.0002488033,0.0002732127,0.000008328278,0.00024549913,0.09158731],"genre_scores_gemma":[0.92979765,0.001683172,0.06752228,0.00006655004,0.00004406644,0.000014490872,0.0000054410502,0.0000059519066,0.0008604244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936855,0.000025839183,0.00016923796,0.00017325902,0.00010566286,0.00015743688],"domain_scores_gemma":[0.99953824,0.000117269956,0.000042973817,0.0002453185,0.000017590035,0.00003859748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023348282,0.00008115563,0.00012459757,0.000015133416,0.000053128268,0.00004871777,0.0002412788,0.000032851123,0.000045501023],"category_scores_gemma":[0.00007114817,0.00006669364,0.000018263949,0.0001710833,0.00005412304,0.0004894798,0.0000584113,0.00006561152,0.00005590412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014413034,0.00012264772,0.0013512443,0.00007903802,0.0000024591113,0.0000072532625,0.0016377827,0.00003029601,0.0000075698244,0.79299563,0.00009011301,0.20367453],"study_design_scores_gemma":[0.00028448808,0.000036905414,0.0052128406,0.000062315,0.0000037530533,0.000030673,0.00006540527,0.024151014,0.00024548935,0.94047296,0.029232647,0.00020153329],"about_ca_topic_score_codex":0.0000018209576,"about_ca_topic_score_gemma":0.00001051881,"teacher_disagreement_score":0.6562706,"about_ca_system_score_codex":0.00002161117,"about_ca_system_score_gemma":0.000010041681,"threshold_uncertainty_score":0.27196878},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01688435,0.0012363092,0.976629,0.0012162055,0.00044984595,0.00016038297,0.000007884194,0.00021645916,0.0031995326],"genre_scores_gemma":[0.9839628,0.00006893883,0.015384961,0.00033740766,0.000060244158,0.000035775425,0.0000071507307,0.0000070794954,0.00013566956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989423,0.000067763445,0.00017862144,0.00030232104,0.00024538807,0.00026360736],"domain_scores_gemma":[0.9987559,0.00069630187,0.0000687782,0.00022447656,0.0001321757,0.0001224043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014449548,0.0001756874,0.00014913021,0.000117244745,0.00027620178,0.00021443373,0.00037606247,0.0000597387,0.000040927454],"category_scores_gemma":[0.000049083974,0.00014260235,0.00004874982,0.00027372563,0.00009606236,0.0007461292,0.000014779254,0.0001680771,0.00012668617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001897068,0.00070554944,0.0003179495,0.00012349177,0.00005936933,0.0000048628453,0.0022609988,0.037557088,0.00002040756,0.8623512,0.00030170486,0.09627846],"study_design_scores_gemma":[0.0020401163,0.0013595084,0.031699356,0.00027041067,0.000070395654,0.0003316737,0.0012075943,0.030012786,0.0010218689,0.92548376,0.005203025,0.0012995024],"about_ca_topic_score_codex":0.000004755713,"about_ca_topic_score_gemma":0.000004966448,"teacher_disagreement_score":0.96707845,"about_ca_system_score_codex":0.000040915234,"about_ca_system_score_gemma":0.00014206908,"threshold_uncertainty_score":0.5815155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2468885,0.00033305763,0.69725746,0.00043426687,0.0011783798,0.0006647696,7.665294e-7,0.00061253033,0.052630264],"genre_scores_gemma":[0.99403775,0.000008106889,0.0055837985,0.0001226004,0.0001430735,0.000038828588,0.000002067103,0.000008092306,0.00005569257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865735,0.00002063367,0.00017376008,0.00055142347,0.00022855029,0.00036829265],"domain_scores_gemma":[0.9989436,0.00023785116,0.00008028116,0.00045662784,0.00006239329,0.00021924362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010986174,0.00021896126,0.00022101184,0.000045649595,0.00019809412,0.00034090973,0.00080242334,0.00015640617,0.000067209025],"category_scores_gemma":[0.00016122524,0.0001568997,0.000030935335,0.00027361207,0.00022853853,0.00013590162,0.00034619856,0.00041414966,0.00003880824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033102701,0.000014664438,0.0007667917,0.000013038382,0.000005709969,0.0000043812433,0.00037884808,0.000020849706,0.0032448298,0.96311635,0.00010039982,0.032330837],"study_design_scores_gemma":[0.00021818148,0.00004548093,0.02288006,4.077647e-7,0.000008373217,0.000031257692,0.00002361739,0.0040430976,0.0010976123,0.96944624,0.0019181592,0.0002875088],"about_ca_topic_score_codex":0.000040997835,"about_ca_topic_score_gemma":0.000113168375,"teacher_disagreement_score":0.7471492,"about_ca_system_score_codex":0.000016943095,"about_ca_system_score_gemma":0.000059753056,"threshold_uncertainty_score":0.63981843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17532334,0.00039741033,0.44745874,0.0042955168,0.00077385124,0.0007549286,0.000002065299,0.0008080438,0.3701861],"genre_scores_gemma":[0.951697,0.0000013117466,0.04644483,0.00029801184,0.00021094181,0.000050785944,0.0000011854369,0.00001078657,0.0012851458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826795,0.00009442812,0.00040042083,0.00043801585,0.00028345754,0.0005157342],"domain_scores_gemma":[0.998557,0.000548605,0.0000754925,0.0006135726,0.00004439156,0.00016095625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038326313,0.00021228274,0.00032497177,0.00010062237,0.000072551346,0.00016607306,0.0009244409,0.00012462608,0.00028006884],"category_scores_gemma":[0.0001878315,0.00016394725,0.00010887518,0.00033751706,0.00006752146,0.00037950158,0.000083366125,0.00020935644,0.0025551321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000178653,0.00058818574,0.00007212616,0.000053712716,0.000012693548,0.00003537982,0.005802648,0.0000067828832,0.00012381143,0.9532784,0.0005726571,0.039435744],"study_design_scores_gemma":[0.005953605,0.002726265,0.0030032361,0.00019486841,0.000029399418,0.00009508221,0.0006149742,0.1435019,0.0004595967,0.8286386,0.013536518,0.00124594],"about_ca_topic_score_codex":0.000011476152,"about_ca_topic_score_gemma":0.000099202196,"teacher_disagreement_score":0.7763737,"about_ca_system_score_codex":0.00009027577,"about_ca_system_score_gemma":0.000037541176,"threshold_uncertainty_score":0.9982215},"labels":[],"label_agreement":null},{"id":"W2017468133","doi":"10.1093/logcom/exm046","title":"A General Framework for Expressing Preferences in Causal Reasoning and Planning","year":2007,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Library science; Computer science; Operations research; Information retrieval; World Wide Web; Sociology; Mathematics","score_opus":0.046648173634884736,"score_gpt":0.3304637165551217,"score_spread":0.283815542920237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017468133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41471884,0.00095247134,0.5839078,0.00003820714,0.00014251626,0.000032981578,7.547495e-8,0.0000065348418,0.00020059863],"genre_scores_gemma":[0.7025121,0.000018246372,0.29723194,0.000051909465,0.00017821403,5.811016e-7,2.5401926e-7,0.0000018815605,0.0000048954525],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930674,0.000038448874,0.00026519867,0.00012552529,0.00011073239,0.00015333324],"domain_scores_gemma":[0.9991985,0.0003523662,0.00025245748,0.00003532331,0.0000984517,0.00006287956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074861373,0.00007587017,0.00015596538,0.00012487032,0.00009467959,0.00013606866,0.00010765897,0.000065137305,3.989081e-7],"category_scores_gemma":[0.00015850144,0.000057815938,0.00002424895,0.00011104166,0.00002621297,0.0003135306,0.000043124193,0.0001365115,1.0647444e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002409562,0.00015079784,0.14239712,0.000108683256,0.000049995648,0.00018857063,0.026886988,0.00965799,0.00077555486,0.3254587,0.00026755978,0.49381706],"study_design_scores_gemma":[0.0011962637,0.00069123803,0.23482838,0.000571062,0.00001656957,0.00032190423,0.0011389969,0.18662988,0.00028360836,0.5739718,0.00010449697,0.00024580513],"about_ca_topic_score_codex":0.0000036988229,"about_ca_topic_score_gemma":0.0000022042943,"teacher_disagreement_score":0.49357125,"about_ca_system_score_codex":0.00001933381,"about_ca_system_score_gemma":0.00003278426,"threshold_uncertainty_score":0.23576654},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033429808,0.001270101,0.9449874,0.0005018172,0.0006716496,0.00019583368,0.0000016916891,0.0000746485,0.04895384],"genre_scores_gemma":[0.69927,0.0000072832513,0.2996924,0.00039666492,0.0005281962,0.000013187804,9.2928263e-7,0.000010652684,0.00008070535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856216,0.000036790774,0.00054347015,0.00025487735,0.00023252064,0.00037017182],"domain_scores_gemma":[0.99790925,0.0008361997,0.0005264147,0.00030740415,0.00030301,0.00011771922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006810413,0.0002008648,0.00040697167,0.00020469436,0.00020700552,0.0001427892,0.0007996757,0.00013284908,0.000026266005],"category_scores_gemma":[0.000149482,0.00014939919,0.00028048732,0.00037388367,0.00008102854,0.00013891041,0.00007638752,0.00026730399,0.000032617307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005170667,0.00026097143,0.0001394719,0.000040888124,0.000022168262,0.000022190889,0.00016745653,0.0006543369,0.0007541534,0.9863011,0.004370771,0.007214757],"study_design_scores_gemma":[0.0017797503,0.00046700164,0.0007855666,0.0001365777,0.00007135122,0.00007606688,0.00010830395,0.013486965,0.0073554167,0.9276739,0.04761549,0.0004436534],"about_ca_topic_score_codex":0.0000023664031,"about_ca_topic_score_gemma":0.000005342976,"teacher_disagreement_score":0.695927,"about_ca_system_score_codex":0.00007801726,"about_ca_system_score_gemma":0.00032714062,"threshold_uncertainty_score":0.6092322},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010825321,0.0014393853,0.9677943,0.00014041094,0.00044845493,0.00020031513,0.0000023756434,0.00012629994,0.019023128],"genre_scores_gemma":[0.9539167,0.00019960655,0.04547087,0.00014448368,0.00005723162,0.000004715727,0.0000019896179,0.000010169175,0.00019419346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832714,0.000072771916,0.00055423286,0.00043478934,0.00025443616,0.00035665373],"domain_scores_gemma":[0.9987062,0.00011027767,0.00020857266,0.00066041725,0.00018949929,0.0001249969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137761,0.00017445772,0.0002608539,0.00007269565,0.00014359398,0.00006780051,0.0010739965,0.00008881096,0.00016604002],"category_scores_gemma":[0.00020074558,0.00014995843,0.000118580465,0.00044926754,0.00012237624,0.00045542972,0.00027412007,0.00013928651,0.00041793825],"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.000018342882,0.00019580963,0.00019926568,0.000034265984,0.000013787356,0.000011558065,0.005452082,0.000013104769,0.0013801345,0.5083279,0.001795331,0.4825584],"study_design_scores_gemma":[0.00008807015,0.0008553188,0.00043168667,0.00040103213,0.0000348681,0.000043344065,0.00041005228,0.04713413,0.5147312,0.40952715,0.02534619,0.0009969112],"about_ca_topic_score_codex":0.00008916912,"about_ca_topic_score_gemma":0.000013056278,"teacher_disagreement_score":0.9430914,"about_ca_system_score_codex":0.00002330948,"about_ca_system_score_gemma":0.00005111588,"threshold_uncertainty_score":0.6115128},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006392378,0.82627,0.04797911,0.016533585,0.00029233706,0.0008841691,0.0000011354675,0.00024360158,0.10140369],"genre_scores_gemma":[0.702321,0.28799522,0.004869755,0.004406856,0.00009215696,0.000008331831,0.0000016228291,0.000004883814,0.00030014926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891835,0.00015060784,0.00030977727,0.00024605962,0.00018240948,0.00019280706],"domain_scores_gemma":[0.99888796,0.00016886125,0.00021857556,0.0005887169,0.00008448905,0.000051418276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045098,0.00013517351,0.0003244416,0.000028313301,0.00010309203,0.000026910473,0.0006655969,0.00005152675,0.000014823722],"category_scores_gemma":[0.00036127443,0.000074108044,0.00008055115,0.00037502495,0.00008513744,0.000184053,0.00011348011,0.00013538974,0.00006006842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001057528,0.00002794719,0.00009235702,0.0003690478,0.000005298849,0.0000025819518,0.00023051996,0.0000013778763,0.00007900404,0.86357754,0.0007217639,0.13489152],"study_design_scores_gemma":[0.00046235544,0.00055635435,0.051022176,0.0039290953,0.00009534344,0.00030962756,0.00001894283,0.002402883,0.0003447619,0.89095086,0.049384166,0.00052344234],"about_ca_topic_score_codex":0.000002363036,"about_ca_topic_score_gemma":3.6964835e-7,"teacher_disagreement_score":0.69592863,"about_ca_system_score_codex":0.000017021659,"about_ca_system_score_gemma":0.000031348212,"threshold_uncertainty_score":0.30220383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5738916,0.000009251605,0.42482015,0.00011523767,0.00038035316,0.0001528877,0.0000010932545,0.000020882222,0.00060856953],"genre_scores_gemma":[0.99875695,0.000004474223,0.001049007,0.000021009893,0.000059061196,0.000010474571,0.0000015301817,0.000005647406,0.000091851245],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990308,0.000057043842,0.00031827387,0.00022911227,0.00020754698,0.00015721573],"domain_scores_gemma":[0.99886286,0.00007136408,0.00023092303,0.00049900135,0.00029450352,0.00004136889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794861,0.00010404094,0.00014616044,0.0000614695,0.0000902387,0.000037478283,0.00062633434,0.00005877891,0.000025834453],"category_scores_gemma":[0.00010585693,0.00006678567,0.000057908623,0.000571395,0.00015885774,0.0001995392,0.00014558621,0.00013137571,0.000038976574],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017656384,0.00034228235,0.002907355,0.000039853447,0.000016489008,0.0000011161081,0.008992702,0.000056366287,0.52806616,0.38321906,0.0000061210903,0.07633483],"study_design_scores_gemma":[0.000027710688,0.00012392747,0.015504699,0.000055670807,0.0000138679525,0.0000059076283,0.00007223616,0.07402309,0.90427196,0.0055693905,0.00020938792,0.00012212392],"about_ca_topic_score_codex":0.0000482354,"about_ca_topic_score_gemma":0.00051482295,"teacher_disagreement_score":0.42486537,"about_ca_system_score_codex":0.000013010378,"about_ca_system_score_gemma":0.00012102112,"threshold_uncertainty_score":0.27234408},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009356597,0.00020326898,0.86072797,0.00041686854,0.00029951922,0.00006893726,1.3112823e-7,0.00027758523,0.12864915],"genre_scores_gemma":[0.9631241,0.000012756974,0.032598387,0.00080830377,0.00009922486,0.0000023829875,0.0000010473182,0.0000021686772,0.003351642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926615,0.000031460644,0.000107409884,0.0002518548,0.00012903968,0.00021411318],"domain_scores_gemma":[0.99946654,0.00002286286,0.00004251366,0.0003222206,0.00006751148,0.000078379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101242156,0.00009567858,0.000094209434,0.000041423315,0.00009208492,0.00013757042,0.0004840218,0.000059263075,0.000054198903],"category_scores_gemma":[0.00002925475,0.0000698774,0.00004881992,0.00016099378,0.000017956601,0.0004605764,0.00008035077,0.0000717949,0.00041427987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063651805,0.00019659694,0.0009813494,0.0000043724135,0.0000076558945,0.00004138474,0.0018337092,0.00003807803,0.0145417405,0.72476995,0.022117233,0.2354616],"study_design_scores_gemma":[0.0014761519,0.0011891496,0.080160126,0.00004837936,0.000019665224,0.00017658065,0.00014300711,0.13032596,0.04987068,0.673682,0.061623853,0.0012844532],"about_ca_topic_score_codex":0.00000668622,"about_ca_topic_score_gemma":0.000005403125,"teacher_disagreement_score":0.9537675,"about_ca_system_score_codex":0.000029807565,"about_ca_system_score_gemma":0.000018801451,"threshold_uncertainty_score":0.5324868},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069421805,0.0000718174,0.9260843,0.00037106837,0.00034801982,0.00013102227,4.7463615e-7,0.00025812956,0.0033134096],"genre_scores_gemma":[0.6429008,0.0000025063039,0.35680458,0.00021243725,0.00006932621,0.0000026520788,1.9219412e-7,0.0000041523117,0.0000033149263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748266,0.00005669377,0.00022794842,0.00086742453,0.000615721,0.00074958097],"domain_scores_gemma":[0.9987999,0.00009685102,0.00008258015,0.00049762806,0.00019149212,0.00033154903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013217208,0.00022028164,0.00021324998,0.00009740555,0.0007435834,0.0006979098,0.0013018064,0.00006041998,0.000005679982],"category_scores_gemma":[0.000095594456,0.00016292512,0.000036001205,0.0012608825,0.0014606431,0.0008987685,0.001036287,0.00017683381,0.00003272842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055689325,0.00003105163,0.000048550435,0.0000076239576,0.0000028980858,0.00002032246,0.0004070605,0.0005492663,0.0010490462,0.98712045,8.289934e-7,0.010757333],"study_design_scores_gemma":[0.0006099168,0.0004811884,0.00059983024,0.00014302865,0.000009114657,0.00033173664,0.000028043321,0.34680858,0.019043818,0.63155645,0.000011921161,0.00037637388],"about_ca_topic_score_codex":0.000015523492,"about_ca_topic_score_gemma":0.000006117311,"teacher_disagreement_score":0.573479,"about_ca_system_score_codex":0.00016290728,"about_ca_system_score_gemma":0.00023927963,"threshold_uncertainty_score":0.672996},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01868761,0.0075812577,0.41375986,0.0015429371,0.0024114796,0.00033245905,0.000013031725,0.00006681068,0.5556046],"genre_scores_gemma":[0.99148375,0.000050666946,0.0076872967,0.00013812562,0.0005964584,0.000002818147,0.0000014461106,0.0000025860188,0.000036869504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957436,0.000040455685,0.00012742795,0.000090330745,0.000083929066,0.000083495266],"domain_scores_gemma":[0.99935347,0.00032591942,0.000074234864,0.00012046126,0.00007949744,0.000046390564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032442756,0.00005646816,0.00009473023,0.000024460693,0.00008400542,0.000024082841,0.00010158302,0.00003221792,0.0000018940757],"category_scores_gemma":[0.0006567868,0.000036021953,0.000022239188,0.000061613646,0.00012925602,0.000033648554,0.00009020082,0.00006303082,0.0000028793424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012044061,0.0000138320465,0.0025124985,0.000011707392,0.000007819377,1.8434018e-7,0.0018048681,0.000002690053,0.0000024060696,0.99440694,0.000038924132,0.001186108],"study_design_scores_gemma":[0.0004461058,0.000037962043,0.004167604,0.000025273383,0.000015074536,0.0000046962145,0.000007319992,0.026488157,0.00003138443,0.9628411,0.005860133,0.00007520587],"about_ca_topic_score_codex":0.0000039675365,"about_ca_topic_score_gemma":5.4360845e-7,"teacher_disagreement_score":0.97279614,"about_ca_system_score_codex":0.0000039420065,"about_ca_system_score_gemma":0.000009411945,"threshold_uncertainty_score":0.14689326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042463883,0.00038771133,0.9783598,0.00024145599,0.0005476163,0.0005328815,0.0000033618414,0.00017415144,0.019328393],"genre_scores_gemma":[0.8480442,0.0000077111,0.15068541,0.0006821096,0.00013472635,0.00025752882,0.0000046179393,0.000012335081,0.00017132975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984038,0.00008486493,0.000312435,0.0005477384,0.00018742624,0.0004637586],"domain_scores_gemma":[0.99879146,0.00022619145,0.000094787094,0.0005512748,0.00020177422,0.00013453623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005737065,0.00018446667,0.00020312128,0.000096908756,0.00027830066,0.0001604101,0.0006882597,0.000094951036,0.000032507687],"category_scores_gemma":[0.00039306594,0.00016568202,0.00014213761,0.0004655912,0.00012828968,0.00024093619,0.000055862678,0.00010654964,0.00015882874],"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.000007052035,0.00020980257,0.00009802264,0.000020534702,0.0000069193843,0.000002885166,0.00078458246,0.00010025589,0.00022020635,0.94358605,0.00016850146,0.05479521],"study_design_scores_gemma":[0.00013285087,0.00054571993,0.000077699806,0.000033987828,0.000027092627,0.00002164997,0.0004194283,0.54558194,0.15464047,0.2679626,0.029698372,0.00085817894],"about_ca_topic_score_codex":0.00002998464,"about_ca_topic_score_gemma":0.000031316493,"teacher_disagreement_score":0.8476196,"about_ca_system_score_codex":0.000036476944,"about_ca_system_score_gemma":0.00015127758,"threshold_uncertainty_score":0.6756317},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31639504,0.0034966671,0.59473383,0.010926128,0.004557969,0.006808461,0.00037359283,0.0014673269,0.061240956],"genre_scores_gemma":[0.98255515,0.00026748766,0.010726634,0.0046109604,0.00060502905,0.00023830713,0.000078844605,0.000028892046,0.00088872225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977655,0.00006987941,0.00075795193,0.00028989502,0.00042201835,0.0006947845],"domain_scores_gemma":[0.99820507,0.00018125438,0.00034134524,0.00079694216,0.00027608563,0.000199334],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010820299,0.00035474604,0.000425229,0.00016425815,0.000606174,0.0011311587,0.0014695694,0.00016810988,0.000027163618],"category_scores_gemma":[0.00013031875,0.00023559172,0.00020200676,0.0004021503,0.00025288953,0.0046065347,0.00081299536,0.0003491709,0.0002832353],"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.00020843052,0.00054496876,0.0083951065,0.0005855179,0.00031701606,0.000009251927,0.107405424,0.000025635263,0.000025369738,0.7277454,0.013573694,0.1411642],"study_design_scores_gemma":[0.015036462,0.0003784839,0.0085105635,0.0002544413,0.00010713527,0.00028370533,0.0010013004,0.38160932,0.00054967427,0.008736038,0.58218515,0.0013477288],"about_ca_topic_score_codex":0.000032775188,"about_ca_topic_score_gemma":0.000110355766,"teacher_disagreement_score":0.71900934,"about_ca_system_score_codex":0.00008172161,"about_ca_system_score_gemma":0.00004434908,"threshold_uncertainty_score":0.99990577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22428405,0.000037271733,0.7743079,0.0004156595,0.00020345536,0.00026262525,0.0000015547092,0.00012391532,0.0003635591],"genre_scores_gemma":[0.98707664,0.0000668964,0.01247353,0.00007691703,0.00005762072,0.00006261234,0.00000450926,0.000011872335,0.00016937796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837166,0.00012793927,0.0003452113,0.00057581376,0.00027602664,0.0003033524],"domain_scores_gemma":[0.99925625,0.00025874685,0.00008694701,0.00018658639,0.00012921392,0.00008224748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040691235,0.00020703507,0.00021364771,0.00033108634,0.00014154961,0.00018972195,0.00024372502,0.00007636596,0.000011935029],"category_scores_gemma":[0.000015297748,0.00017921967,0.00004073515,0.00061452016,0.00012477752,0.0006500311,0.0000046934683,0.00029055605,0.000020129806],"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.00004372744,0.000281418,0.0016961399,0.00003693034,0.000018852843,0.000009103321,0.003166214,0.65318304,0.00010012007,0.0022696136,0.000017900617,0.33917695],"study_design_scores_gemma":[0.0002957408,0.0006253533,0.0069586514,0.0003096821,0.000011504325,0.000075836615,0.000604955,0.97864956,0.00371878,0.008222137,0.00013805149,0.0003897251],"about_ca_topic_score_codex":0.00014708094,"about_ca_topic_score_gemma":0.0002552116,"teacher_disagreement_score":0.76279265,"about_ca_system_score_codex":0.000057529956,"about_ca_system_score_gemma":0.000092560105,"threshold_uncertainty_score":0.73083663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19949782,0.0031697315,0.7741383,0.006773927,0.003158982,0.0005066051,0.0000052168066,0.00023383215,0.012515604],"genre_scores_gemma":[0.9713296,0.00065515906,0.014247748,0.00030060537,0.00088940543,0.0001191107,0.00002347243,0.000043785207,0.012391112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964034,0.00070761685,0.0008825627,0.00073131826,0.0003141136,0.00096098107],"domain_scores_gemma":[0.9979119,0.0002466679,0.00042981573,0.0006969906,0.00036768575,0.0003469949],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023973137,0.00045136642,0.0004266759,0.0002300763,0.00048168714,0.00041171376,0.000714453,0.00040665918,0.000363222],"category_scores_gemma":[0.00023955005,0.00048021023,0.00025957194,0.00065040874,0.00024080252,0.0019453161,0.00029064642,0.00070426875,0.0008613442],"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.000045232584,0.0018480578,0.0015710449,0.0003436046,0.00009646769,0.000013068369,0.23865126,0.030925583,0.010189836,0.45520207,0.006373478,0.2547403],"study_design_scores_gemma":[0.00018121793,0.00036268617,0.0038648169,0.00062382634,0.00005781831,0.00026247068,0.020718487,0.808457,0.12818986,0.006595134,0.029999886,0.00068677106],"about_ca_topic_score_codex":0.0023740577,"about_ca_topic_score_gemma":0.000645065,"teacher_disagreement_score":0.77753145,"about_ca_system_score_codex":0.0008596297,"about_ca_system_score_gemma":0.0008830253,"threshold_uncertainty_score":0.9999166},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09638267,0.0030565085,0.3500365,0.025461828,0.0013502103,0.00052471727,0.000005049434,0.0010759137,0.52210665],"genre_scores_gemma":[0.995867,0.00007072588,0.003156403,0.0004752141,0.00026444512,0.000010780792,0.0000016535108,0.0000047339413,0.00014900682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910706,0.000052011073,0.00013999418,0.00036607852,0.00012023418,0.00021464667],"domain_scores_gemma":[0.99928,0.0000852505,0.000042354222,0.0004077707,0.00006545297,0.000119190074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000200889,0.00011754365,0.0001354118,0.000047472153,0.00017732647,0.00011803063,0.00037663212,0.000052143794,0.00005788935],"category_scores_gemma":[0.00012624603,0.000098518016,0.000039121423,0.0002154812,0.000115614086,0.00023713162,0.00022363936,0.000102844686,0.0002379901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039065167,0.0000808833,0.0036066743,0.000012184424,0.000005540373,0.000023520031,0.00018568539,0.0000019501142,0.0000536319,0.98693407,0.0002639955,0.008827956],"study_design_scores_gemma":[0.0002030164,0.00008847183,0.0136722,0.000007550115,0.0000051038655,0.000079578625,0.0000031430957,0.0035164931,0.000032670272,0.9763982,0.0058431155,0.00015041424],"about_ca_topic_score_codex":0.000010816448,"about_ca_topic_score_gemma":0.000006822444,"teacher_disagreement_score":0.8994844,"about_ca_system_score_codex":0.000031525087,"about_ca_system_score_gemma":0.000027480519,"threshold_uncertainty_score":0.4017448},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013881618,0.0041356166,0.9877658,0.0002783128,0.00030838436,0.0006731539,0.0000011525606,0.0001847757,0.0052646827],"genre_scores_gemma":[0.4689618,0.0002886554,0.5300543,0.00018888697,0.00019606293,0.00016438727,0.000005997433,0.0000161183,0.0001238247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976026,0.00082284334,0.0003672879,0.00051273225,0.00019153721,0.0005030127],"domain_scores_gemma":[0.9957637,0.003289685,0.00038272468,0.00025914374,0.0002054384,0.00009930693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063538617,0.00022261603,0.00032221214,0.00015643991,0.00022915608,0.00018858997,0.00040305554,0.00013347797,0.000004710006],"category_scores_gemma":[0.0027832426,0.00018673937,0.00007688875,0.0005302646,0.00014925483,0.0018759542,0.00013676618,0.00024048804,0.0000042992024],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012159429,0.00013192273,0.00018388945,0.00007775964,0.00001222201,0.0000021600422,0.0011766629,0.000012960812,0.00006308957,0.31554127,0.0000066791604,0.6826698],"study_design_scores_gemma":[0.0018652388,0.00250833,0.00015925887,0.00014666551,0.00010908668,0.00032305584,0.0021783519,0.020654803,0.0014825502,0.32284525,0.6470047,0.00072264805],"about_ca_topic_score_codex":0.000017792569,"about_ca_topic_score_gemma":0.000020880108,"teacher_disagreement_score":0.6819472,"about_ca_system_score_codex":0.00003078269,"about_ca_system_score_gemma":0.000049813058,"threshold_uncertainty_score":0.7615011},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02466185,0.0013975019,0.40443322,0.0007857677,0.00033133497,0.0010590134,0.000021734257,0.00032764123,0.566982],"genre_scores_gemma":[0.9871406,0.000008885666,0.011119508,0.0012592258,0.000058979622,0.000059040605,0.000004129067,0.0000126925615,0.0003369389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987236,0.000058018213,0.00023552979,0.00044383496,0.0001619472,0.00037704827],"domain_scores_gemma":[0.99897486,0.00022031661,0.0001603414,0.00040287385,0.00012576672,0.00011585299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006945374,0.00021054765,0.00033017568,0.00009401215,0.00016704403,0.000083376355,0.0003591754,0.00012519093,0.000030824984],"category_scores_gemma":[0.00007279895,0.00015753192,0.000101041114,0.00026008344,0.000059037084,0.00008210124,0.00004737105,0.00010510938,0.000018169763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029789308,0.00006953688,0.00003483322,0.000094196206,0.00001790482,0.0000027203191,0.00019247153,0.000086344546,0.00045929477,0.9939314,0.0014220157,0.0036594777],"study_design_scores_gemma":[0.009004458,0.0040609227,0.0018143889,0.0008386232,0.00014709606,0.00012713634,0.0019145302,0.09509612,0.25409415,0.52836406,0.101167366,0.0033711395],"about_ca_topic_score_codex":0.000001394889,"about_ca_topic_score_gemma":0.0000026612408,"teacher_disagreement_score":0.96247876,"about_ca_system_score_codex":0.000008522916,"about_ca_system_score_gemma":0.000067798035,"threshold_uncertainty_score":0.6423965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018269772,0.00066569826,0.96218914,0.00031306504,0.001082339,0.0002738724,0.0000058230744,0.000047988073,0.01715232],"genre_scores_gemma":[0.9436081,0.000036745125,0.055545833,0.0003307079,0.0002532996,0.000010202807,0.0000014173789,0.000009826703,0.00020388287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800336,0.000114108196,0.0006638981,0.00024374151,0.0003618521,0.0006130324],"domain_scores_gemma":[0.99825174,0.0002549522,0.000460814,0.00031493866,0.0004598939,0.0002576916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012011519,0.00021417109,0.0004125256,0.00009140209,0.00019284234,0.00014807552,0.0009153884,0.00015611119,0.000029665422],"category_scores_gemma":[0.00061641727,0.00014576303,0.0003224358,0.00022167446,0.00008528798,0.0011357431,0.000105687795,0.00033031855,0.000016249449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065739645,0.0002568628,0.00016825655,0.000033737222,0.00003335877,0.000055587803,0.00038768473,0.010195374,0.000079185265,0.9822504,0.0014475003,0.0050263507],"study_design_scores_gemma":[0.0037165645,0.0040512434,0.00045632926,0.0000844158,0.00012753389,0.0020054067,0.00009491965,0.24433944,0.0015204217,0.6972896,0.045525722,0.00078842556],"about_ca_topic_score_codex":0.0000025659353,"about_ca_topic_score_gemma":0.000008132528,"teacher_disagreement_score":0.9253383,"about_ca_system_score_codex":0.00011041826,"about_ca_system_score_gemma":0.00047722587,"threshold_uncertainty_score":0.59440434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043095727,0.000035994355,0.92316735,0.00095294375,0.0015362513,0.000121317615,9.062776e-7,0.0002275796,0.030861951],"genre_scores_gemma":[0.99511576,0.000006139389,0.0033762883,0.00040360543,0.00026926797,0.000011591582,0.0000010066985,0.000009870496,0.00080644625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986047,0.00008202311,0.00026344747,0.0004682058,0.00021223254,0.00036938288],"domain_scores_gemma":[0.9989179,0.00012680075,0.00007599498,0.0006302624,0.00010521096,0.00014388024],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003965579,0.00016376795,0.00015306738,0.0000886005,0.00019784983,0.00020850704,0.0010179853,0.00007922139,0.000036311914],"category_scores_gemma":[0.00029585438,0.00014222851,0.000085216816,0.00031751662,0.000039278075,0.00021454135,0.00016939422,0.00018172758,0.0057570627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039051856,0.00014711342,0.00024175228,0.0000019699282,0.0000025948439,0.000004923684,0.00039586335,0.00010947281,0.00023088155,0.8130439,0.0005151495,0.18530245],"study_design_scores_gemma":[0.000054770644,0.0012127247,0.0009235966,0.00007005421,0.000018081844,0.00002555242,0.00043302562,0.1305547,0.1314179,0.7271287,0.0073186457,0.00084225636],"about_ca_topic_score_codex":0.00007594478,"about_ca_topic_score_gemma":0.00008904487,"teacher_disagreement_score":0.95202005,"about_ca_system_score_codex":0.00003075236,"about_ca_system_score_gemma":0.000035989997,"threshold_uncertainty_score":0.99501705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032377888,0.00002172532,0.9860686,0.00055536407,0.0016753892,0.00030705513,0.0000027787455,0.0003261581,0.0078051477],"genre_scores_gemma":[0.7898423,0.000001433206,0.20907389,0.0005796749,0.00037544488,0.000032182717,0.0000011605995,0.000009365825,0.00008457386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969342,0.0001549864,0.00032254355,0.0010450043,0.0006681494,0.00087511237],"domain_scores_gemma":[0.9972166,0.00089908886,0.00009286408,0.0009815836,0.00039949387,0.00041036893],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024291782,0.00025374308,0.0002906875,0.00019234935,0.00084139715,0.0007867224,0.003478353,0.0000838201,0.000038269318],"category_scores_gemma":[0.00064534554,0.00020607327,0.000112171154,0.0009143748,0.0028014572,0.0006384734,0.0010437218,0.00020469281,0.0002736871],"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.000010797814,0.000055537133,0.00001108988,0.000009382976,0.000002335226,0.0000032748342,0.00022001119,0.00012183504,0.00030764122,0.92517793,0.00012320103,0.07395696],"study_design_scores_gemma":[0.00028688545,0.00035221875,0.0001903202,0.000017712548,0.0000044973776,0.00004011937,0.0000019461668,0.6588436,0.0012941343,0.3381595,0.0005891744,0.00021993167],"about_ca_topic_score_codex":0.000002897669,"about_ca_topic_score_gemma":7.432089e-7,"teacher_disagreement_score":0.7866045,"about_ca_system_score_codex":0.00009586081,"about_ca_system_score_gemma":0.00020650226,"threshold_uncertainty_score":0.9999123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015388209,0.00007208137,0.976098,0.0009446272,0.00028142697,0.00019474575,0.000024013092,0.00018414122,0.006812778],"genre_scores_gemma":[0.79446477,0.000043430544,0.20490141,0.0003897377,0.000028952225,0.000041889874,0.000012458036,0.000007744123,0.000109613444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853384,0.00010214984,0.00033970384,0.00042451202,0.00035201432,0.00024779834],"domain_scores_gemma":[0.998307,0.00065518345,0.00014054844,0.0004828719,0.0003124242,0.00010200102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012182026,0.00019471598,0.00025119222,0.00027574782,0.00045586663,0.000025383746,0.0007631589,0.000105129926,0.00011129089],"category_scores_gemma":[0.00007157862,0.00017610841,0.00018172024,0.0007364351,0.00022157637,0.00032523516,0.000027208156,0.00025624104,0.00025797414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045863926,0.0019027644,0.00032001932,0.000022935026,0.00015103402,0.00006682426,0.0023639945,0.13971157,0.00024200589,0.84084934,0.00035382994,0.013969824],"study_design_scores_gemma":[0.0011349105,0.00074039825,0.019073984,0.000029815017,0.000031110645,0.0003602596,0.00009188653,0.02706919,0.001088136,0.9495775,0.00034750195,0.00045530242],"about_ca_topic_score_codex":0.00002652646,"about_ca_topic_score_gemma":0.000008033145,"teacher_disagreement_score":0.7790766,"about_ca_system_score_codex":0.00006841662,"about_ca_system_score_gemma":0.00019618303,"threshold_uncertainty_score":0.71814924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3187947,0.007634797,0.10652324,0.21700276,0.0013181339,0.0006484869,0.00008871122,0.001051707,0.34693748],"genre_scores_gemma":[0.975042,0.00044755102,0.015938994,0.0060052373,0.0014628259,0.000072019466,0.000013018258,0.0000453391,0.00097304396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966231,0.0013695235,0.0003843419,0.000511696,0.00024382165,0.0008675402],"domain_scores_gemma":[0.9972653,0.0012253643,0.00021484714,0.0006605636,0.00019837504,0.00043558056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025396247,0.00037704693,0.00037843018,0.00012671507,0.00037917504,0.00054244953,0.000906693,0.00048271863,0.00005121507],"category_scores_gemma":[0.00070249056,0.0003871081,0.00022168316,0.00022919838,0.0006046826,0.0011857637,0.0002795015,0.0010330757,0.00009350071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000110920755,0.0003977648,0.0072704693,0.00007282647,0.00004986305,0.00012989924,0.011006683,0.000024826444,0.001067116,0.9737373,0.0026364794,0.0035956565],"study_design_scores_gemma":[0.0006885462,0.00012382421,0.010419184,0.0001382718,0.000048332608,0.0005951456,0.0001266388,0.00763351,0.003859892,0.8334232,0.1424601,0.00048334134],"about_ca_topic_score_codex":0.0015184825,"about_ca_topic_score_gemma":0.0016789044,"teacher_disagreement_score":0.65624726,"about_ca_system_score_codex":0.00012990177,"about_ca_system_score_gemma":0.0010611123,"threshold_uncertainty_score":0.9998581},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7819359,0.009744252,0.16466421,0.0101074865,0.0007909179,0.00083744794,0.0000049322553,0.0003120881,0.03160279],"genre_scores_gemma":[0.9749046,0.00009327509,0.02424137,0.00017436284,0.00009698285,0.00006371784,1.1618204e-7,0.000006568794,0.00041902126],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916965,0.00006159143,0.00013929767,0.0002856918,0.00005645259,0.00028733126],"domain_scores_gemma":[0.9990546,0.00044539964,0.000048438233,0.0003618249,0.000033351906,0.000056347842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480195,0.00009599825,0.00010210028,0.00003204944,0.00020775902,0.00013151296,0.00038667597,0.000055697157,0.0000020241305],"category_scores_gemma":[0.00055138534,0.000063431406,0.000031814398,0.00014259794,0.00007672534,0.0002146385,0.00009838142,0.000098818295,0.000016300855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016819737,0.00006967894,0.0019405782,0.0000120112945,0.000009494728,0.00024303132,0.0026963877,0.000020862135,0.00021279968,0.16571817,0.0017541603,0.82730603],"study_design_scores_gemma":[0.0037041644,0.00052660675,0.030823274,0.00038015452,0.000027842416,0.0072319205,0.0022927795,0.39573374,0.0037548235,0.091288015,0.46248743,0.0017492259],"about_ca_topic_score_codex":0.000037456244,"about_ca_topic_score_gemma":0.0009378088,"teacher_disagreement_score":0.8255568,"about_ca_system_score_codex":0.000028302939,"about_ca_system_score_gemma":0.000019606108,"threshold_uncertainty_score":0.25866577},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5508474,0.009387887,0.24225354,0.0015600193,0.002843057,0.008196295,0.000004397256,0.0033641406,0.18154323],"genre_scores_gemma":[0.9381653,0.0000071064355,0.060633812,0.0001339202,0.00016255653,0.0006642154,0.00006559443,0.000007469597,0.0001600215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752927,0.0005163793,0.00026960432,0.0005414529,0.00082304724,0.00032023355],"domain_scores_gemma":[0.99842787,0.00019766123,0.00016770417,0.00047136206,0.000585636,0.00014975676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071133766,0.00018516809,0.00021719749,0.00026499282,0.0003417217,0.00057917973,0.0004001416,0.00013455468,0.00035131408],"category_scores_gemma":[0.0005900353,0.0001500082,0.00011322767,0.0011592073,0.00009136916,0.00039458775,0.00011782684,0.00028233315,0.000041603093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068557383,0.0001487156,0.010552892,0.000006638317,0.00013075574,0.000002198455,0.0017160021,0.0002557546,0.000037834863,0.04046949,0.00021171891,0.94646114],"study_design_scores_gemma":[0.0006550761,0.00026204463,0.06985502,0.000013101159,0.0005499329,0.000016020767,0.00012363004,0.88152623,0.000051527637,0.037625507,0.009044387,0.00027751512],"about_ca_topic_score_codex":0.0000048482925,"about_ca_topic_score_gemma":0.000017005083,"teacher_disagreement_score":0.9461836,"about_ca_system_score_codex":0.000027467588,"about_ca_system_score_gemma":0.00016566196,"threshold_uncertainty_score":0.61171573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067855823,0.011602768,0.84670156,0.004651423,0.0011431035,0.000906459,0.000018189518,0.00006734593,0.12812358],"genre_scores_gemma":[0.6666527,0.0156195015,0.31521675,0.0010887218,0.00019075906,0.00011165153,0.000025223831,0.000021937587,0.0010728022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982472,0.00006155111,0.0007708317,0.00014598106,0.00059913483,0.0001753155],"domain_scores_gemma":[0.99796593,0.00015520083,0.0006437758,0.00043987756,0.0007264426,0.000068795445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061364676,0.00013574216,0.00035739384,0.000081593666,0.000024465995,0.000042169067,0.0013198139,0.00004187543,0.00028618154],"category_scores_gemma":[0.0010452562,0.00010003901,0.00016515418,0.00019883468,0.000080711856,0.0007858396,0.00038140677,0.0000973352,0.000112363945],"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.0000011847668,0.00025839626,0.00032216997,0.0045628827,0.000096174255,0.0000021200553,0.0007769992,0.000008864484,0.00010040354,0.82721657,0.009312655,0.15734158],"study_design_scores_gemma":[0.0033212602,0.0012309456,0.025220932,0.062790066,0.0004424433,0.0003748182,0.0007605921,0.44487837,0.010150004,0.31415874,0.13442077,0.0022510593],"about_ca_topic_score_codex":0.000020551372,"about_ca_topic_score_gemma":0.000002370532,"teacher_disagreement_score":0.6598671,"about_ca_system_score_codex":0.0000361572,"about_ca_system_score_gemma":0.00014262133,"threshold_uncertainty_score":0.40794727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015080425,0.00059653126,0.9768736,0.0021896444,0.0014080079,0.0002816065,0.0000027358126,0.00024431208,0.0033231617],"genre_scores_gemma":[0.96893233,0.000008303037,0.029501947,0.00034030536,0.00052714016,0.000047384212,0.0000024932513,0.000009666948,0.00063045847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99840665,0.000058255875,0.00021239402,0.00039832928,0.00026974693,0.000654648],"domain_scores_gemma":[0.99862015,0.00008715808,0.00006534201,0.0007264367,0.00012307521,0.00037782433],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004866947,0.00016835165,0.00015606324,0.00010200691,0.00018388948,0.00039748847,0.0010914955,0.00005434972,0.000039457773],"category_scores_gemma":[0.00021270003,0.00014327413,0.00006236316,0.00065426383,0.00008922855,0.0010570544,0.00050557696,0.00013055689,0.0012745496],"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.000008621265,0.00018640685,0.0006620433,0.0000068811673,0.0000070382725,0.000008890424,0.003377027,0.0000046883474,0.0010462102,0.6820074,0.0012190018,0.3114658],"study_design_scores_gemma":[0.00009268103,0.00054306706,0.0014068261,0.00012716398,0.000034328034,0.0000952605,0.0017334162,0.03577365,0.7187237,0.05009859,0.1895568,0.0018144816],"about_ca_topic_score_codex":0.000030308358,"about_ca_topic_score_gemma":0.000048924667,"teacher_disagreement_score":0.9538519,"about_ca_system_score_codex":0.000035906054,"about_ca_system_score_gemma":0.00004584795,"threshold_uncertainty_score":0.9995031},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04326212,0.00041332742,0.9430575,0.00011995506,0.000760671,0.00051577645,0.0000104752135,0.00015253187,0.011707692],"genre_scores_gemma":[0.990953,0.000010202647,0.008467478,0.00007649294,0.00007594665,0.00004803079,0.00010535699,0.000010529711,0.00025293828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981026,0.00031799273,0.00045567306,0.0004400356,0.0004141065,0.00026960226],"domain_scores_gemma":[0.9985716,0.00011421889,0.00039632487,0.000279553,0.00050874375,0.00012956372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085773587,0.00018489994,0.000308927,0.0001117762,0.00010172968,0.00013551542,0.0003639609,0.00007307216,0.000004055717],"category_scores_gemma":[0.00004332139,0.00016961935,0.00006620455,0.00035433617,0.00004146861,0.0005812831,0.00009845367,0.00009267702,0.00006458116],"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.00031231143,0.00442479,0.063287675,0.00092996703,0.0006992113,0.00003297434,0.1700013,0.120596096,0.0011303142,0.44674015,0.03652246,0.15532278],"study_design_scores_gemma":[0.0020756384,0.00037646922,0.0049781534,0.00005569428,0.000013275147,0.000018094992,0.0043496443,0.98175806,0.0010805666,0.0028764196,0.0020636292,0.00035434804],"about_ca_topic_score_codex":0.000081306614,"about_ca_topic_score_gemma":0.000027010212,"teacher_disagreement_score":0.9476909,"about_ca_system_score_codex":0.00015674644,"about_ca_system_score_gemma":0.00011759906,"threshold_uncertainty_score":0.69168764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7790526,0.0017216785,0.15680657,0.0009188441,0.0022965798,0.00034673532,0.0000069676603,0.00052845664,0.05832152],"genre_scores_gemma":[0.9621798,0.000043253116,0.036395397,0.00014907894,0.00018143245,0.000017764489,0.000007820392,0.000009839302,0.0010156259],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988182,0.00005718988,0.00024266895,0.00041236417,0.00013716244,0.00033238117],"domain_scores_gemma":[0.99872136,0.00023645346,0.00006797305,0.00088045397,0.000037839898,0.000055938763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022528188,0.00013854401,0.00018486966,0.00011643701,0.000070757254,0.000079913705,0.00085366453,0.00004252582,0.000027398319],"category_scores_gemma":[0.00018930084,0.00012327003,0.00006114512,0.00030630882,0.00003950408,0.00039201014,0.0005188677,0.0001275874,0.00009381381],"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.000031381205,0.0006769823,0.42508617,0.000092952796,0.000032715772,0.00053590036,0.00079332193,0.00019447808,0.0052652606,0.19599418,0.027927138,0.34336954],"study_design_scores_gemma":[0.0039649666,0.00053766917,0.36889312,0.00054652157,0.000039531715,0.00027097602,0.00026227857,0.0528937,0.019789511,0.07754246,0.4724321,0.0028271817],"about_ca_topic_score_codex":0.0013344428,"about_ca_topic_score_gemma":0.0021626814,"teacher_disagreement_score":0.44450495,"about_ca_system_score_codex":0.000054867527,"about_ca_system_score_gemma":0.00006349735,"threshold_uncertainty_score":0.5026806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3758178,0.0009644335,0.036525507,0.00039042486,0.00037216564,0.00027774507,0.0000038285602,0.0002993854,0.5853487],"genre_scores_gemma":[0.99323076,0.0001159682,0.005912983,0.00013922804,0.0000846857,0.000011347211,7.705365e-7,0.000004654285,0.0004995983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988591,0.00006621506,0.00020880978,0.00034861147,0.00022334304,0.0002938879],"domain_scores_gemma":[0.9990834,0.000121818564,0.000107248576,0.00052018743,0.00008186763,0.00008548904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020035465,0.00013499577,0.00026374919,0.000055608576,0.0002226053,0.000014472586,0.00081787666,0.0000640888,0.000031374282],"category_scores_gemma":[0.00009320719,0.00009978775,0.00010992143,0.00037094543,0.00015795509,0.00010865046,0.00038209136,0.00012536223,0.00013545564],"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.000016829687,0.0005287162,0.038316127,0.000017499138,0.0000647459,0.00013483469,0.0059326505,0.000041353844,0.0005427844,0.9368741,0.012554698,0.004975664],"study_design_scores_gemma":[0.0013842558,0.0008920002,0.32316825,0.000026918011,0.000022513474,0.000118607546,0.00017181052,0.0013039239,0.0054365834,0.009703919,0.6570536,0.0007176564],"about_ca_topic_score_codex":0.00004617057,"about_ca_topic_score_gemma":0.000011360518,"teacher_disagreement_score":0.92717016,"about_ca_system_score_codex":0.00006459748,"about_ca_system_score_gemma":0.00010376575,"threshold_uncertainty_score":0.40692264},"labels":[],"label_agreement":null},{"id":"W2051119578","doi":"10.1093/logcom/exm050","title":"Goal Change in the Situation Calculus","year":2007,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Situation calculus; Calculus (dental); Action (physics); Computer science; Contraction (grammar); Artificial intelligence; Philosophy; Linguistics; Medicine","score_opus":0.04146586588425641,"score_gpt":0.3086231164052781,"score_spread":0.2671572505210217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051119578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19756722,0.0005264812,0.7992527,0.0008389065,0.00022548948,0.000062420484,5.0871744e-8,0.0000068044083,0.0015199262],"genre_scores_gemma":[0.99454355,0.000032435124,0.0046596876,0.0005140777,0.00024101332,6.5031145e-7,3.9417333e-7,0.0000012070275,0.000006998048],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993626,0.000070227106,0.0002138536,0.00007052614,0.00017936018,0.000103434846],"domain_scores_gemma":[0.9995029,0.00014176819,0.00018068796,0.000046822723,0.00009651056,0.000031304462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012539625,0.000051852363,0.00008690219,0.00009699928,0.000057596266,0.000065364526,0.00018417137,0.000034748744,0.0000011771374],"category_scores_gemma":[0.000036605885,0.000030729385,0.00003086074,0.00020930632,0.000018226283,0.00030244933,0.000026092612,0.0001113012,0.0000030831625],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003778555,0.00020713298,0.010206831,0.000015965225,0.0000125268825,0.00019960076,0.029592648,0.0004710153,0.00016018255,0.1767655,0.00046191394,0.7818689],"study_design_scores_gemma":[0.0010979676,0.00070207956,0.8070086,0.00004155241,0.000013308135,0.00060977193,0.00086521695,0.11544406,0.000065111504,0.07323734,0.0007615021,0.00015348934],"about_ca_topic_score_codex":0.000011671887,"about_ca_topic_score_gemma":0.000022297145,"teacher_disagreement_score":0.7969763,"about_ca_system_score_codex":0.00002489825,"about_ca_system_score_gemma":0.00001834075,"threshold_uncertainty_score":0.1253108},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5572308,0.002661865,0.4256069,0.00031028633,0.0007081982,0.0006489851,0.0000035839005,0.00054919824,0.012280209],"genre_scores_gemma":[0.6800311,0.0005748015,0.3128268,0.0020223374,0.00044407358,0.0005514077,0.0000049061905,0.00004555903,0.003498963],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974359,0.00015086847,0.0003939593,0.0008654524,0.00033602436,0.00081775256],"domain_scores_gemma":[0.9864972,0.012158517,0.00026564754,0.00057005644,0.0003059328,0.00020260617],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009097359,0.00030421384,0.00030673016,0.00014134374,0.00041071846,0.00051836314,0.00086286134,0.00016612705,0.0000029858215],"category_scores_gemma":[0.05188209,0.00028264138,0.000070849776,0.0009415489,0.00012550286,0.0031247565,0.00043172904,0.00032978415,0.00005997013],"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.000052631975,0.001566626,0.20439665,0.0003681467,0.00008620549,0.0011718118,0.43488058,0.00017467017,0.0024576776,0.033499043,0.017190052,0.3041559],"study_design_scores_gemma":[0.0020529688,0.00089395535,0.016257398,0.00027575396,0.00004400988,0.001444027,0.030917695,0.012797203,0.0021005534,0.006617273,0.92618257,0.0004165716],"about_ca_topic_score_codex":0.00011064218,"about_ca_topic_score_gemma":0.00002534,"teacher_disagreement_score":0.9089925,"about_ca_system_score_codex":0.00007012867,"about_ca_system_score_gemma":0.0001897552,"threshold_uncertainty_score":0.99996257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010627767,0.00029076863,0.99302584,0.00027301948,0.0020890536,0.00086600886,0.0004319747,0.00036825016,0.0015922791],"genre_scores_gemma":[0.9390233,0.000119720135,0.05722579,0.00014022346,0.00033798633,0.0007038194,0.0003458615,0.000029776393,0.0020734929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979281,0.00016627004,0.00036840024,0.0007753781,0.00033546664,0.0004264227],"domain_scores_gemma":[0.9972386,0.0005636734,0.00013141557,0.0016993016,0.00018988388,0.00017713352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036293437,0.0002606291,0.00028229158,0.00021338335,0.00053098757,0.00016801924,0.000859645,0.0000709223,0.00013587593],"category_scores_gemma":[0.00026996664,0.00022225223,0.00013910104,0.0005790183,0.000076012315,0.0010754286,0.000037170183,0.00020199607,0.00046116553],"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.00034970077,0.006668591,0.0002646906,0.00086586276,0.0008095978,0.00012898556,0.0061402353,0.0028707003,0.005544625,0.69570386,0.037628666,0.24302451],"study_design_scores_gemma":[0.004924118,0.0014026706,0.00022091474,0.00050392863,0.00023410418,0.00047644955,0.0014086447,0.41077933,0.007911345,0.0010789789,0.56923246,0.0018270419],"about_ca_topic_score_codex":0.00015108314,"about_ca_topic_score_gemma":0.000064679625,"teacher_disagreement_score":0.93796057,"about_ca_system_score_codex":0.0001243935,"about_ca_system_score_gemma":0.000046679055,"threshold_uncertainty_score":0.9063183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063850556,0.00032745654,0.87217444,0.0003175704,0.00044884405,0.00080991647,5.926423e-7,0.0007086582,0.12457403],"genre_scores_gemma":[0.927506,0.0000016964951,0.056589372,0.0000610199,0.00013895368,0.00024339833,0.0000013894091,0.000009714478,0.015448427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895036,0.00002447973,0.00016360485,0.00035680053,0.00014715517,0.00035758445],"domain_scores_gemma":[0.99925804,0.000040079893,0.000056958088,0.00042925944,0.000108748034,0.00010689236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017239041,0.00012612261,0.00016077579,0.00004110232,0.0001310402,0.00021830751,0.0006526763,0.00006164987,0.000024539815],"category_scores_gemma":[0.000024647628,0.000090438814,0.00009872756,0.0002388849,0.000023707775,0.0002354464,0.00012578258,0.000051621526,0.00021253279],"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.000005286693,0.00047552685,0.0006437024,0.00031032693,0.0000400927,0.00001728934,0.002671513,0.000026945667,0.00014494846,0.53731745,0.016902573,0.44144437],"study_design_scores_gemma":[0.0015337921,0.00094200985,0.00019959961,0.00012724551,0.00002095329,0.00010396257,0.00027902992,0.86801374,0.008038905,0.0012535123,0.11880457,0.000682709],"about_ca_topic_score_codex":0.000011002181,"about_ca_topic_score_gemma":0.000019983338,"teacher_disagreement_score":0.92686754,"about_ca_system_score_codex":0.00004712046,"about_ca_system_score_gemma":0.0000152261555,"threshold_uncertainty_score":0.3687988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0262716,0.00014882439,0.9628518,0.00074665766,0.00066646386,0.00040130792,0.0000013705202,0.00021342083,0.008698543],"genre_scores_gemma":[0.8942811,0.000008900361,0.10531381,0.00019225235,0.0001564547,0.00002237274,3.7950377e-7,0.000005198893,0.000019521949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768466,0.000108031636,0.00023773673,0.0009040893,0.00043396404,0.0006314936],"domain_scores_gemma":[0.99808455,0.00043394635,0.000061365325,0.0007170804,0.0003695706,0.0003334966],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024608085,0.00019875175,0.00023422041,0.00008593666,0.0005240541,0.0004529978,0.0018153103,0.00006376569,0.000017182354],"category_scores_gemma":[0.00038321738,0.00014520518,0.00007012029,0.0007132547,0.0030240172,0.00056722364,0.0007564721,0.00014533746,0.0000228859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009620613,0.000055952853,0.0005287245,0.000010398762,0.0000022489023,0.0000029941937,0.0004491211,0.000002917077,0.0000834178,0.910336,0.000046323687,0.08847226],"study_design_scores_gemma":[0.00035645266,0.00028542953,0.0016670512,0.00002022633,0.0000047391864,0.00007129034,0.0000037085854,0.18084626,0.0005338038,0.8152148,0.0007626566,0.00023357359],"about_ca_topic_score_codex":0.0000013593259,"about_ca_topic_score_gemma":0.0000010205692,"teacher_disagreement_score":0.8680095,"about_ca_system_score_codex":0.00004811197,"about_ca_system_score_gemma":0.00015611587,"threshold_uncertainty_score":0.99968916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3216123,0.0038786838,0.5748332,0.005452046,0.004448623,0.00038075016,0.0000049435967,0.00011972101,0.08926973],"genre_scores_gemma":[0.9591243,0.00034208264,0.040005084,0.00018548584,0.0002532064,0.0000020021407,1.8286704e-7,0.0000093621,0.000078292396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982426,0.00012968593,0.0005315117,0.00017466783,0.00073698716,0.00018455886],"domain_scores_gemma":[0.9974901,0.00048536021,0.00085549266,0.000295915,0.0007990932,0.0000740443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016312803,0.00013554082,0.00022443382,0.00018488632,0.00008156442,0.0001237488,0.002111386,0.000045740835,0.000065391934],"category_scores_gemma":[0.0012700828,0.000075977834,0.0001974609,0.00021591196,0.00007647487,0.00068927376,0.00024822116,0.0002594576,0.000015675121],"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.00015570475,0.0003054804,0.0072965957,0.000035049467,0.00036118142,0.00018713443,0.011667014,0.000074394935,0.002243413,0.8850734,0.0008844952,0.09171611],"study_design_scores_gemma":[0.004543374,0.0039235265,0.10986431,0.03732298,0.00032188944,0.0065464005,0.0026081891,0.09389215,0.5625757,0.16608155,0.009934803,0.0023851558],"about_ca_topic_score_codex":0.000018851288,"about_ca_topic_score_gemma":9.3784234e-7,"teacher_disagreement_score":0.7189919,"about_ca_system_score_codex":0.00008250984,"about_ca_system_score_gemma":0.000113321774,"threshold_uncertainty_score":0.39235157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062969744,0.00031135092,0.9321759,0.00017338121,0.00010534161,0.00012764262,0.0000014238622,0.00007191627,0.0040632975],"genre_scores_gemma":[0.80648625,0.000009679643,0.19333734,0.0001095829,0.000014401881,0.000008306918,0.000004916059,0.0000059697704,0.000023579667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864715,0.000043642507,0.0003268284,0.0003920914,0.0003290488,0.00026123438],"domain_scores_gemma":[0.99903387,0.00022347049,0.00014690653,0.0002436765,0.00027244785,0.00007962018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024506546,0.00015522906,0.00019828649,0.00016243105,0.00006675858,0.00005212523,0.00070149644,0.000059141745,0.000010714567],"category_scores_gemma":[0.00012703301,0.00012824907,0.000047697715,0.0007682072,0.00012216636,0.0003069715,0.00014150442,0.0001512472,0.00007768399],"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.000011458858,0.00010416667,0.0024039156,0.000014404511,0.0000074885593,0.000037883186,0.0012340908,0.52108914,0.000013811275,0.46575156,0.0000104255105,0.009321696],"study_design_scores_gemma":[0.00054101314,0.0004129903,0.046723377,0.00039180135,0.00000660215,0.00020946251,0.0001855418,0.3031855,0.0039854045,0.64380324,0.00009612226,0.00045896744],"about_ca_topic_score_codex":0.00010203144,"about_ca_topic_score_gemma":0.00009929652,"teacher_disagreement_score":0.7435165,"about_ca_system_score_codex":0.00009193399,"about_ca_system_score_gemma":0.00026196428,"threshold_uncertainty_score":0.52298456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30479756,0.000007416254,0.64185566,0.00095161377,0.00018848668,0.0003546083,1.3981077e-7,0.0004882301,0.051356286],"genre_scores_gemma":[0.8544881,3.3558666e-7,0.14410925,0.0006613051,0.00003531824,0.000006001763,5.9125915e-7,0.0000064273563,0.0006926766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882936,0.000025099798,0.0001278651,0.00048215158,0.00020085648,0.00033465403],"domain_scores_gemma":[0.9990931,0.000025416146,0.000032696946,0.0005781465,0.00007793185,0.0001927026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019608231,0.00014574686,0.00013476031,0.00004492449,0.00011528683,0.00019668482,0.00036134745,0.000037806152,0.000007925213],"category_scores_gemma":[0.000022882874,0.0000962797,0.000045784884,0.0003113028,0.000037278107,0.00014683466,0.00014093949,0.00008702548,0.00028835647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039772694,0.00070497696,0.00077558483,0.00002698337,0.000029381728,0.00017254888,0.009089216,0.0025703087,0.0004573142,0.56235987,0.000623049,0.423151],"study_design_scores_gemma":[0.020432811,0.04326397,0.10583961,0.0017741435,0.00019004867,0.0017952505,0.0019779773,0.12757227,0.12893638,0.41660932,0.13935016,0.01225805],"about_ca_topic_score_codex":0.00013160463,"about_ca_topic_score_gemma":0.00024446307,"teacher_disagreement_score":0.54969054,"about_ca_system_score_codex":0.0001612372,"about_ca_system_score_gemma":0.00012234767,"threshold_uncertainty_score":0.39261723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025028308,0.00035292818,0.9932557,0.00014998276,0.00034356347,0.00046003706,0.000002110073,0.00030902203,0.0048763836],"genre_scores_gemma":[0.21139348,0.000026113185,0.7877966,0.00030248615,0.00033911914,0.000010232759,0.000006173364,0.000019917037,0.0001058546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967676,0.00003274266,0.0005356543,0.0014355868,0.0007184706,0.0005099548],"domain_scores_gemma":[0.9971821,0.00017968866,0.0004231869,0.0016115747,0.000421297,0.00018217976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079968426,0.0004685073,0.0005480517,0.00065099244,0.00017413702,0.000258869,0.0037746301,0.00042056493,0.000005283194],"category_scores_gemma":[0.00007949579,0.00041516277,0.00013359284,0.00053241843,0.0006084418,0.000645744,0.00074123126,0.0006219314,0.000016478944],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004364333,0.000070611204,0.000052530635,0.000024389852,0.0000044408853,0.000012839305,0.00061290356,0.007802389,0.0010967479,0.04616319,0.000002069327,0.94415355],"study_design_scores_gemma":[0.00019026846,0.00056015997,0.00024383992,0.0002385077,0.000010398346,0.000054305867,2.4855015e-7,0.8710258,0.026130682,0.09941891,0.0014197084,0.000707151],"about_ca_topic_score_codex":0.000022084763,"about_ca_topic_score_gemma":0.000030281566,"teacher_disagreement_score":0.9434464,"about_ca_system_score_codex":0.00017072936,"about_ca_system_score_gemma":0.00038945358,"threshold_uncertainty_score":0.99983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026882757,0.0000728716,0.9698123,0.0013546176,0.0001703883,0.00012655639,0.000009732352,0.00014316646,0.0014276309],"genre_scores_gemma":[0.90818655,0.000012081532,0.091282,0.00016573606,0.000025181404,0.000022307118,0.000009770581,0.000006307157,0.0002900785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998843,0.000060856124,0.0002597908,0.00037384126,0.00021458263,0.00024790654],"domain_scores_gemma":[0.999222,0.00029739607,0.000055400058,0.00028223475,0.0000816521,0.00006134038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020129616,0.00014584903,0.00015564541,0.0001380489,0.0003151812,0.00012757398,0.0003061928,0.0000677994,0.0000145459935],"category_scores_gemma":[0.000021812968,0.00013770637,0.000057589255,0.00044193477,0.0000618058,0.00037236582,0.000021877542,0.00017616159,0.000023758974],"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.000004586852,0.00020353803,0.00050846196,0.000007377858,0.0000062056174,0.0000037550228,0.00009537423,0.768661,0.000027202808,0.22825074,0.000059171358,0.0021725534],"study_design_scores_gemma":[0.00027389382,0.000031103256,0.0057319636,0.000008663006,0.0000064840683,0.0000104774035,0.00001134675,0.64722455,0.000063875494,0.34641704,0.00009851399,0.00012208441],"about_ca_topic_score_codex":0.00009341087,"about_ca_topic_score_gemma":0.000177584,"teacher_disagreement_score":0.8813038,"about_ca_system_score_codex":0.00007405273,"about_ca_system_score_gemma":0.00008213166,"threshold_uncertainty_score":0.5615503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11473381,0.0048208456,0.8515945,0.0075734905,0.0008827786,0.0007651308,5.1815084e-7,0.00020724908,0.019421699],"genre_scores_gemma":[0.9624177,0.00016355798,0.03570784,0.00078522786,0.0003581346,0.000008081798,4.333625e-7,0.000012525525,0.00054645323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975625,0.00042503182,0.00060955074,0.00023412122,0.0006943527,0.0004744203],"domain_scores_gemma":[0.99802023,0.00040698948,0.0006730884,0.00054923084,0.00025304925,0.000097388845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030431382,0.00022804343,0.00028437414,0.00005526739,0.00066113897,0.0004901626,0.0020527856,0.00010295551,0.0000612198],"category_scores_gemma":[0.00019890214,0.00010956778,0.00015430304,0.0005671472,0.00012794096,0.0014786967,0.00020303969,0.0007248148,0.000055030436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001595145,0.00055833487,0.00047151023,0.00005434445,0.00028642302,0.00014222636,0.054921117,0.12530671,0.00082422455,0.47652155,0.0014274099,0.33932662],"study_design_scores_gemma":[0.0015353336,0.0012919613,0.0005036068,0.0002342516,0.00018571372,0.0028993958,0.0032852495,0.07509162,0.001795997,0.89087033,0.02166567,0.0006408462],"about_ca_topic_score_codex":0.00021501789,"about_ca_topic_score_gemma":0.00007658671,"teacher_disagreement_score":0.84768397,"about_ca_system_score_codex":0.00011553,"about_ca_system_score_gemma":0.00018448662,"threshold_uncertainty_score":0.50850135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47631222,0.00033766555,0.51894635,0.0019270668,0.0001083462,0.00016739627,6.561257e-7,0.0000250152,0.0021752724],"genre_scores_gemma":[0.99459594,0.0001298394,0.005043923,0.0001500099,0.000044467964,0.0000064017377,5.4332435e-7,0.00000419974,0.000024665824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989142,0.000036213627,0.0004120157,0.0002152871,0.00021820802,0.00020407178],"domain_scores_gemma":[0.99916255,0.00018713498,0.00016672423,0.00033886667,0.000109429726,0.000035291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090900983,0.00010276452,0.00016138141,0.00007494524,0.00009288568,0.00013820185,0.0004820839,0.00004220498,0.0000042183015],"category_scores_gemma":[0.00029519532,0.000071780334,0.000057328798,0.00027644847,0.00008434116,0.00020293177,0.00012644129,0.000093801915,0.000021465268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018909901,0.00025116638,0.000085162115,0.00005127021,0.000006389129,0.00001007899,0.022346744,0.00051209587,0.0009132957,0.91408396,0.000025608924,0.061712347],"study_design_scores_gemma":[0.00003016409,0.000105791754,0.0004427125,0.00015856362,0.0000056355325,0.000018961362,0.0026664268,0.091430396,0.07799344,0.8268663,0.00010658357,0.0001750174],"about_ca_topic_score_codex":0.00009410419,"about_ca_topic_score_gemma":0.00012168019,"teacher_disagreement_score":0.5182837,"about_ca_system_score_codex":0.000004313974,"about_ca_system_score_gemma":0.00002495539,"threshold_uncertainty_score":0.2927117},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27111134,0.00082959764,0.54761684,0.0029685113,0.0012937937,0.0003671655,0.0000013273432,0.00019630419,0.17561516],"genre_scores_gemma":[0.87369996,0.00007644558,0.12504537,0.00053387537,0.00037430486,0.0000021374474,2.5143595e-7,0.000015533496,0.00025210163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792194,0.00005189515,0.0006549827,0.00039521794,0.0005490413,0.0004269126],"domain_scores_gemma":[0.9981681,0.00030166275,0.0005056842,0.0003522394,0.00025060264,0.00042172687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008799,0.00025900116,0.0005130545,0.00014151278,0.0002019473,0.00029938295,0.0006838325,0.00021243042,0.000031358148],"category_scores_gemma":[0.000317664,0.00018319614,0.00014346502,0.00036465065,0.00020078641,0.00031697206,0.0003076733,0.00064702943,0.000060090842],"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.00028130086,0.0023484735,0.000400643,0.000084444764,0.00015911258,0.0011588916,0.0068332413,0.00047902204,0.096160494,0.74337775,0.018276688,0.13043995],"study_design_scores_gemma":[0.00916599,0.009068806,0.011201237,0.0007996837,0.00034873548,0.0059509454,0.0008893986,0.72016865,0.022837434,0.18072528,0.035874967,0.002968893],"about_ca_topic_score_codex":6.7279615e-7,"about_ca_topic_score_gemma":0.0000017491674,"teacher_disagreement_score":0.7196896,"about_ca_system_score_codex":0.00008471354,"about_ca_system_score_gemma":0.000055852066,"threshold_uncertainty_score":0.74705213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08359794,0.00016519129,0.89818007,0.002315505,0.0005928445,0.00052979833,0.0000020649584,0.00032724446,0.014289322],"genre_scores_gemma":[0.99788684,0.0000056488316,0.0009915842,0.0006736718,0.00012116177,0.000048613852,0.000003273624,0.0000063665466,0.00026282665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987012,0.00013726318,0.0002406394,0.0003543532,0.0002466197,0.00031993905],"domain_scores_gemma":[0.99899983,0.00033485665,0.00006269055,0.0004543365,0.00007269608,0.00007558332],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004602241,0.0001414918,0.00011526191,0.000045047385,0.0002474463,0.00022606543,0.0006977887,0.000056226687,0.00045762197],"category_scores_gemma":[0.00019774828,0.00009506336,0.0000786523,0.00039531663,0.00012853743,0.00013189035,0.00004820349,0.00017120937,0.0014235333],"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.0000064201267,0.000104925464,0.000026242438,0.0000025378806,0.0000035111318,0.000010999046,0.0025367995,0.0005337514,0.00017942194,0.22898927,0.00011496339,0.76749116],"study_design_scores_gemma":[0.000038643786,0.00026856342,0.00017696741,0.00003710843,0.000008433713,0.000005670474,0.00041333173,0.94695044,0.038138486,0.005427385,0.008262656,0.00027234558],"about_ca_topic_score_codex":0.000096614254,"about_ca_topic_score_gemma":0.0001226708,"teacher_disagreement_score":0.9464167,"about_ca_system_score_codex":0.00004014642,"about_ca_system_score_gemma":0.00006562571,"threshold_uncertainty_score":0.99935395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85097003,0.0005880316,0.14155419,0.0013646883,0.00072124635,0.00006451756,2.05068e-7,0.000039192742,0.0046979147],"genre_scores_gemma":[0.99569035,0.0001988,0.003219074,0.0004533044,0.0002796721,4.2849592e-7,8.2293275e-7,0.0000043574923,0.00015319239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991626,0.000115181596,0.00023442924,0.00013411851,0.0002136935,0.00013996598],"domain_scores_gemma":[0.9988916,0.00012508355,0.00022974482,0.0001481027,0.0004995738,0.00010589192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072913204,0.000090807116,0.00015876252,0.00015820854,0.00008700368,0.00009341681,0.00033312725,0.000062929095,0.000029102408],"category_scores_gemma":[0.00036829943,0.00006203248,0.000040686384,0.00026821485,0.000043413336,0.00067657203,0.000055696935,0.00014849471,0.000013769521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008487988,0.00026929833,0.0131137455,0.000009372387,0.000034210596,0.00010280835,0.0028053343,0.00008518771,0.0043829107,0.89655936,0.00089184556,0.08166105],"study_design_scores_gemma":[0.0010857865,0.001829908,0.47741923,0.00008317797,0.000038218233,0.0028808585,0.00044754817,0.016228093,0.00084815,0.49537885,0.0034421205,0.00031805015],"about_ca_topic_score_codex":0.000001857662,"about_ca_topic_score_gemma":0.0000013465035,"teacher_disagreement_score":0.4643055,"about_ca_system_score_codex":0.000036033984,"about_ca_system_score_gemma":0.00005968927,"threshold_uncertainty_score":0.2529611},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04181741,0.00007296335,0.95449454,0.0004983836,0.0011930484,0.0005963941,0.000003052409,0.00029079153,0.0010334039],"genre_scores_gemma":[0.9036738,0.0000015839823,0.09594779,0.00014221261,0.00016067374,0.00005611365,0.0000014346178,0.000008176033,0.000008184757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975482,0.000060826696,0.0003104697,0.00079483003,0.0005831355,0.00070249895],"domain_scores_gemma":[0.99839544,0.00024133794,0.00007267946,0.00062649854,0.00035287434,0.00031117725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014323386,0.00020571968,0.00025397856,0.0003349336,0.0005072937,0.0006869444,0.0019856147,0.0000714889,0.0000047464778],"category_scores_gemma":[0.00017611335,0.00015994917,0.000114898394,0.0020423701,0.0014786905,0.00067066326,0.00027351832,0.0001420696,0.000050208317],"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.0000066748307,0.000120719,0.000013479874,0.000022892562,0.0000023796078,0.0000071042928,0.0006771827,0.0015224209,0.00011460664,0.9934074,0.000011600501,0.0040935297],"study_design_scores_gemma":[0.0009403726,0.0008220678,0.0006945981,0.00005973411,0.000015658188,0.00016703416,0.0000121770945,0.6218219,0.0008777651,0.37419,0.000035935213,0.00036273996],"about_ca_topic_score_codex":0.000011349831,"about_ca_topic_score_gemma":7.7775707e-7,"teacher_disagreement_score":0.8618564,"about_ca_system_score_codex":0.0001952108,"about_ca_system_score_gemma":0.00024137877,"threshold_uncertainty_score":0.66242206},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15258184,0.000089339635,0.843948,0.00019897184,0.000071532486,0.00008918278,0.000004541101,0.000018432062,0.00299815],"genre_scores_gemma":[0.9797447,0.000015201546,0.020009555,0.00018771474,0.000017155538,0.0000026358089,0.0000017974896,0.0000043510972,0.000016936625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989531,0.00001831749,0.00048621843,0.00016398451,0.00022295017,0.00015540246],"domain_scores_gemma":[0.9983996,0.0007698244,0.00026864916,0.00021595809,0.00028561932,0.00006032464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084633374,0.0000990446,0.00019733016,0.00013147893,0.000047666108,0.000032762826,0.0002757938,0.000049564343,0.000025899912],"category_scores_gemma":[0.00039168578,0.00008281295,0.00007485771,0.00019007927,0.00012437758,0.00010051174,0.00004510404,0.000059501344,0.000020807529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016125923,0.0003250175,0.000014384798,0.00007990326,0.000011189877,0.0000021163771,0.001371143,0.0002561432,0.001917842,0.9409468,0.000054571046,0.055004757],"study_design_scores_gemma":[0.000015716749,0.00018248461,0.0000720627,0.00014175444,0.0000034813665,0.0000015737552,0.0001638777,0.1263884,0.3371822,0.53575325,0.00001630397,0.00007890343],"about_ca_topic_score_codex":0.000008108222,"about_ca_topic_score_gemma":0.0000091999145,"teacher_disagreement_score":0.8271628,"about_ca_system_score_codex":0.000003575375,"about_ca_system_score_gemma":0.00003196226,"threshold_uncertainty_score":0.3377014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015997421,0.00024461513,0.8975235,0.00061116036,0.0002417499,0.0006558993,0.000007242307,0.000051773433,0.09906432],"genre_scores_gemma":[0.90746427,0.00002929116,0.08953313,0.0005221873,0.00005732693,0.00017561881,0.0000014348324,0.00001597724,0.0022007814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985275,0.0002002538,0.00032773148,0.00026268588,0.00026453688,0.00041729043],"domain_scores_gemma":[0.9960111,0.0029753505,0.00014841047,0.000710626,0.00008176819,0.00007274837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009051163,0.00016177353,0.00028501978,0.000021777316,0.00041868593,0.000092903654,0.001273983,0.000056565314,0.000032119446],"category_scores_gemma":[0.0016264351,0.00007052078,0.00025909618,0.00018015195,0.00034708602,0.000084761254,0.00022324889,0.00016454005,0.00007141618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013315665,0.00010078062,0.000030310308,0.000036629564,0.000018173363,6.0047637e-7,0.00042495164,0.000028886483,0.00020937735,0.9980042,0.0008036905,0.00032909305],"study_design_scores_gemma":[0.0006268804,0.00011383393,0.00009336951,0.000023077575,0.00001545941,0.000019981799,0.00004664235,0.019767033,0.0009483649,0.9723929,0.005846492,0.00010596431],"about_ca_topic_score_codex":0.0000021812505,"about_ca_topic_score_gemma":0.000004876358,"teacher_disagreement_score":0.90586454,"about_ca_system_score_codex":0.00001772015,"about_ca_system_score_gemma":0.000075493605,"threshold_uncertainty_score":0.3220236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11699284,0.00045827316,0.87498647,0.00023803792,0.00092156354,0.00018156382,0.0000012444602,0.000033516586,0.0061864904],"genre_scores_gemma":[0.97062427,0.00003088195,0.02854249,0.00009436258,0.0006432206,0.000008312844,6.5856165e-7,0.0000126260065,0.000043197648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979655,0.0000946475,0.00079333375,0.0002881239,0.00043220594,0.00042616815],"domain_scores_gemma":[0.99857515,0.0003149792,0.0003037193,0.00023688625,0.00033297192,0.00023627942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072445045,0.00019686838,0.00031240715,0.00011562581,0.00033814783,0.00012186213,0.0008620864,0.000117454896,0.00013374512],"category_scores_gemma":[0.00023326857,0.00015322526,0.00025665227,0.00024803687,0.0005961036,0.00048289835,0.0001493405,0.00028879935,0.000065626635],"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.00015177754,0.00035002548,0.00001492952,0.0000038483927,0.000016972876,0.00005422253,0.0015159838,0.00010135297,0.05069203,0.9401452,0.00019065387,0.0067630173],"study_design_scores_gemma":[0.0000914762,0.0014590577,0.000021939446,0.00003858507,0.000008561588,0.00032997355,0.0005281459,0.0840838,0.6749897,0.23805678,0.00018941464,0.00020257109],"about_ca_topic_score_codex":0.000004035706,"about_ca_topic_score_gemma":8.098675e-7,"teacher_disagreement_score":0.85363144,"about_ca_system_score_codex":0.00010837169,"about_ca_system_score_gemma":0.00015630553,"threshold_uncertainty_score":0.6248345},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44675955,0.0060712136,0.10821673,0.016455004,0.0002944372,0.00052958704,0.000005228388,0.0005009399,0.4211673],"genre_scores_gemma":[0.99278575,0.00024410964,0.0039440743,0.0027345463,0.000036420977,0.00000402809,0.0000020067919,0.0000023942102,0.00024665712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907815,0.00002157306,0.00017561982,0.00031712165,0.00012698224,0.0002805487],"domain_scores_gemma":[0.99946296,0.000046745146,0.00007980697,0.00027072575,0.000045081113,0.000094705065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021169888,0.00013705583,0.00023701564,0.00005123682,0.00008505145,0.000047710768,0.00044608046,0.00011260668,0.000024506977],"category_scores_gemma":[0.000019782938,0.000096453216,0.00006490452,0.00018578675,0.00007844726,0.00008779622,0.00010788978,0.00011489484,0.000032002146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008278234,0.00010235739,0.00005279047,0.0000065938325,0.000006927524,0.000008160215,0.00022512839,0.000007737825,0.0014439635,0.93419594,0.0013998399,0.062542275],"study_design_scores_gemma":[0.0003297693,0.00060499244,0.018521488,0.000011158068,0.0000076002884,0.00002575082,0.00008084496,0.0011969762,0.0038618466,0.97047216,0.0045793797,0.00030800753],"about_ca_topic_score_codex":0.0000012956015,"about_ca_topic_score_gemma":0.0000023782852,"teacher_disagreement_score":0.54602623,"about_ca_system_score_codex":0.000003039246,"about_ca_system_score_gemma":0.00001565978,"threshold_uncertainty_score":0.3933248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07319234,0.000028867084,0.67839783,0.0013097364,0.0012484873,0.00018533543,0.0000017739103,0.000055027023,0.24558058],"genre_scores_gemma":[0.9727639,0.000010537006,0.026541067,0.00021742561,0.00036072024,0.000005483842,6.6723976e-7,0.000005453032,0.00009476523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985459,0.000081121354,0.0005454947,0.00023574046,0.0002845633,0.00030718272],"domain_scores_gemma":[0.99850005,0.0004891927,0.00037857212,0.00024105156,0.00018516467,0.0002059736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005333317,0.00017190338,0.00048139296,0.00020530698,0.00016331887,0.00012731731,0.000663213,0.00012989593,0.000029900018],"category_scores_gemma":[0.00009812967,0.0001310046,0.00014419452,0.0005259297,0.00021484589,0.0002508329,0.00014130806,0.0006388266,0.00008584158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003972749,0.0003092955,0.0006551651,0.0000058546602,0.000030585856,0.000017037692,0.0010485939,0.0006703721,0.0015201049,0.9868549,0.003537545,0.0053107953],"study_design_scores_gemma":[0.0108438255,0.0028934032,0.055573266,0.00018479614,0.00013715128,0.001620252,0.0024214468,0.23907359,0.015218728,0.5308347,0.13930932,0.0018895515],"about_ca_topic_score_codex":0.0000022401812,"about_ca_topic_score_gemma":0.000025619804,"teacher_disagreement_score":0.89957154,"about_ca_system_score_codex":0.000100348494,"about_ca_system_score_gemma":0.0001528228,"threshold_uncertainty_score":0.5342213},"labels":[],"label_agreement":null},{"id":"W2070000914","doi":"10.1093/logcom/exm094","title":"Reinforcement Belief Revision","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rationality; Belief revision; Computer science; Space (punctuation); Operator (biology); Reinforcement learning; Artificial intelligence; Epistemology","score_opus":0.03146668548599047,"score_gpt":0.2689124663159305,"score_spread":0.23744578082994006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070000914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04389852,0.001028868,0.9500914,0.00037610353,0.00030751733,0.00004349165,4.4098424e-8,0.00001698793,0.004237053],"genre_scores_gemma":[0.9724608,0.0005204098,0.026446609,0.00025222896,0.0001410454,2.2518925e-7,4.529858e-7,0.000001853494,0.00017637345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992872,0.000041302752,0.00028002658,0.00009107243,0.0002060331,0.000094365954],"domain_scores_gemma":[0.99935,0.00004785617,0.00027618985,0.00006631644,0.00019076721,0.000068835456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028193256,0.0000677291,0.00013925025,0.00007829075,0.00013237358,0.000041019746,0.00016946495,0.00003275384,0.0000052285563],"category_scores_gemma":[0.000037008496,0.00004711976,0.00005201553,0.00012362223,0.000027906259,0.00031745105,0.00006208859,0.000090632115,0.0000097971315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090390065,0.00034878525,0.0047014887,0.000086204054,0.00009447186,0.0005468508,0.010351987,0.018050745,0.000568037,0.27163848,0.03330853,0.66021407],"study_design_scores_gemma":[0.0064264787,0.0078090425,0.1019812,0.0004897723,0.00008423813,0.009721377,0.00044505316,0.6221393,0.0010993767,0.19701687,0.051684257,0.0011030727],"about_ca_topic_score_codex":0.0000015117391,"about_ca_topic_score_gemma":1.2123677e-7,"teacher_disagreement_score":0.9285623,"about_ca_system_score_codex":0.000023953646,"about_ca_system_score_gemma":0.000046101166,"threshold_uncertainty_score":0.1921488},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032667974,0.0013360112,0.9192292,0.00085101934,0.0007617224,0.00026735014,2.8206213e-7,0.00014833115,0.07413927],"genre_scores_gemma":[0.9916534,0.000131566,0.0068485695,0.00018554668,0.00010016687,0.000031339714,2.1712385e-7,0.0000070799224,0.001042138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987569,0.00020079628,0.00026141206,0.00036259822,0.00013085855,0.00028742643],"domain_scores_gemma":[0.99891585,0.0003603835,0.00007439051,0.00041794594,0.00014323318,0.0000882191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079012313,0.00013780168,0.00014879939,0.000050839524,0.00035549433,0.00028047716,0.0005425801,0.00006820034,0.00005116957],"category_scores_gemma":[0.00035444446,0.000089578156,0.00005890813,0.00046378045,0.00031518374,0.0002802049,0.00012723691,0.00019161312,0.00054709055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056080275,0.00004860659,0.00007262434,0.000005156349,0.0000067585925,0.000001257147,0.0025478983,0.00001310424,0.0001164204,0.9068983,0.00028014614,0.09000407],"study_design_scores_gemma":[0.00006394892,0.00005873701,0.00007871917,0.000015254751,0.00000938523,0.0000362045,0.00040082508,0.023718772,0.026682619,0.90726286,0.041449152,0.00022350582],"about_ca_topic_score_codex":0.000035005727,"about_ca_topic_score_gemma":0.0001375377,"teacher_disagreement_score":0.9883866,"about_ca_system_score_codex":0.000021242407,"about_ca_system_score_gemma":0.000082147184,"threshold_uncertainty_score":0.7031925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026104901,0.000055852688,0.9227973,0.00044328795,0.0019813573,0.00036060245,9.048114e-7,0.0003119901,0.047943756],"genre_scores_gemma":[0.70569235,9.024588e-7,0.2875455,0.0002845339,0.006309242,0.000013372166,8.6900104e-7,0.000011675744,0.00014152254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975046,0.00005156298,0.00034343006,0.00071754557,0.00072205043,0.000660837],"domain_scores_gemma":[0.99884796,0.00020494634,0.00008966764,0.000664376,0.00006767551,0.00012536484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852896,0.00023129887,0.00026546806,0.00023893725,0.0002391847,0.0006867515,0.0021149144,0.00006177538,0.00008326474],"category_scores_gemma":[0.00010872156,0.00016842682,0.00006831591,0.0009923934,0.00044260416,0.00039167295,0.00061410136,0.00021747932,0.00014698411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019930994,0.00009565568,0.00025363904,0.00001922226,0.0000011015965,0.00005912122,0.0005032166,0.00025839542,0.00003452804,0.7940867,0.0015764327,0.20311],"study_design_scores_gemma":[0.00045666,0.00018633986,0.013501146,0.00009240532,0.0000032057342,0.00012970004,0.000025740264,0.3157254,0.0016767171,0.652723,0.014927974,0.0005517371],"about_ca_topic_score_codex":0.000020537078,"about_ca_topic_score_gemma":0.0000131021125,"teacher_disagreement_score":0.6795875,"about_ca_system_score_codex":0.000098654134,"about_ca_system_score_gemma":0.000074574295,"threshold_uncertainty_score":0.6868247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031462456,0.000044002885,0.98455244,0.010179229,0.00013140633,0.0006403342,0.000012363825,0.00037084593,0.0009231034],"genre_scores_gemma":[0.5346053,0.000004712252,0.46383682,0.0008781275,0.00006313613,0.00012267422,0.00003076577,0.0000128530355,0.00044558712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982418,0.00004482605,0.00030802103,0.0005972733,0.0004158606,0.00039221576],"domain_scores_gemma":[0.9983669,0.00043607064,0.00012898762,0.0004969718,0.0004260643,0.00014501093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017432087,0.00028094623,0.00023289977,0.00016956881,0.0005073734,0.00021537568,0.0008581381,0.00013392878,0.00002720274],"category_scores_gemma":[0.000037407,0.0002246051,0.00015719954,0.00047244006,0.0001020091,0.0004914995,0.000018144183,0.00022080107,0.0001586823],"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.00004041635,0.0005130914,0.000019114666,0.000021013722,0.000050352166,0.0000034809796,0.0005071409,0.7821868,0.000015956397,0.18117903,0.00027732097,0.035186287],"study_design_scores_gemma":[0.0008882741,0.0005663975,0.00006688788,0.000022539032,0.00002943892,0.00005991354,0.000035958627,0.7623135,0.00011179012,0.23416586,0.0014528983,0.00028657305],"about_ca_topic_score_codex":0.000004387302,"about_ca_topic_score_gemma":0.00005706555,"teacher_disagreement_score":0.5314591,"about_ca_system_score_codex":0.00009485896,"about_ca_system_score_gemma":0.0002563984,"threshold_uncertainty_score":0.915913},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49658725,0.00008237734,0.50240916,0.00029062372,0.00037182536,0.000049534257,2.1069017e-7,0.000043579887,0.00016547],"genre_scores_gemma":[0.66952366,0.000004544494,0.33036008,0.000022705806,0.00008258147,2.7047804e-7,3.8393228e-8,0.000002903124,0.0000032114847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984788,0.000028073791,0.00046146428,0.00026918954,0.0004081437,0.00035437138],"domain_scores_gemma":[0.9976897,0.00005995231,0.000584359,0.00038422638,0.0011662571,0.00011546998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014950349,0.00013472867,0.00035409193,0.0010009019,0.000272513,0.0001657278,0.0018844511,0.00011133004,0.0000042463735],"category_scores_gemma":[0.00015975663,0.00010042905,0.00006136505,0.0018099834,0.0015336063,0.0011298483,0.00078256143,0.00042117835,0.0000016471524],"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.000010485392,0.0001886394,0.0075311987,0.000024512705,0.00004497833,0.000070954025,0.0013339326,0.000039534425,0.30370992,0.30820566,0.000053920805,0.37878627],"study_design_scores_gemma":[0.00070908974,0.0007732797,0.0047558914,0.00009015767,0.000021004622,0.0026699677,0.000052829557,0.85809106,0.0627527,0.06950945,0.00027143664,0.00030312815],"about_ca_topic_score_codex":0.0000043874384,"about_ca_topic_score_gemma":0.0000031978702,"teacher_disagreement_score":0.85805154,"about_ca_system_score_codex":0.000033324366,"about_ca_system_score_gemma":0.0004534442,"threshold_uncertainty_score":0.56506366},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021280576,0.0004263779,0.011487806,0.007681669,0.00079669536,0.00056385226,8.3928893e-7,0.00027973895,0.95748246],"genre_scores_gemma":[0.994293,0.000049931023,0.0012434128,0.0019010149,0.00022092686,0.00008316088,5.789919e-7,0.000007723673,0.0022002817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985086,0.0001817819,0.0001800565,0.0004359914,0.0002811639,0.0004124623],"domain_scores_gemma":[0.9983538,0.0005024847,0.00008741673,0.0008494098,0.00011514893,0.000091786926],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005110636,0.00019064907,0.00018863795,0.00003940869,0.0003976969,0.00023772239,0.0014522626,0.00007920203,0.00042298163],"category_scores_gemma":[0.0002872585,0.00009322726,0.0001068874,0.0003095368,0.00013812917,0.00016247429,0.00050715724,0.00025376043,0.003394043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025316356,0.00008802205,0.00068529503,0.000002259856,0.000022119866,0.000007851581,0.00085845194,0.000002875692,0.0000750372,0.94138324,0.04820098,0.008671332],"study_design_scores_gemma":[0.001079676,0.0012364624,0.1664489,0.00008804709,0.000029078228,0.000035880115,0.0009840756,0.0030477145,0.0013711379,0.7172443,0.10726737,0.0011673034],"about_ca_topic_score_codex":0.000020885196,"about_ca_topic_score_gemma":0.000011241309,"teacher_disagreement_score":0.9730124,"about_ca_system_score_codex":0.00003240875,"about_ca_system_score_gemma":0.000052806347,"threshold_uncertainty_score":0.9973819},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008603137,0.0001212694,0.6291786,0.003396134,0.0002032611,0.00020799354,2.0408599e-7,0.000070073984,0.35821936],"genre_scores_gemma":[0.995878,0.000005777913,0.0007904913,0.0016665207,0.00006150998,0.000013301524,2.7487127e-7,0.0000019330241,0.0015821895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993636,0.000056170153,0.000104408784,0.00016298635,0.0001387613,0.00017409511],"domain_scores_gemma":[0.9995189,0.000105483,0.000025502273,0.0002915731,0.000027776347,0.00003080664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029912542,0.000065478074,0.00007488159,0.000040767707,0.000067407476,0.000103485945,0.00054816535,0.00003438053,0.000107156135],"category_scores_gemma":[0.000041400875,0.00003795582,0.000034785575,0.0002458508,0.000017490183,0.00019442754,0.000035649817,0.00007573142,0.00039809928],"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.000007892929,0.0006806765,0.014623393,0.00001524112,0.000024611718,0.000117565374,0.035777014,0.00018301795,0.00061765226,0.5912465,0.07317991,0.28352654],"study_design_scores_gemma":[0.00077237224,0.00006699474,0.01930007,0.000004938303,0.0000029908924,0.000012217797,0.00009469705,0.97035325,0.000074339165,0.0018686343,0.0073217754,0.00012771806],"about_ca_topic_score_codex":0.00006816755,"about_ca_topic_score_gemma":0.0002138575,"teacher_disagreement_score":0.9872749,"about_ca_system_score_codex":0.000019954607,"about_ca_system_score_gemma":0.000008590414,"threshold_uncertainty_score":0.51168936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05040921,0.00009642971,0.94698805,0.00010582944,0.0001853171,0.00039951535,0.0000020835882,0.00010117463,0.001712413],"genre_scores_gemma":[0.99388516,0.0000036894235,0.005914967,0.00005634359,0.000034890076,0.000031395306,0.00003667258,0.0000016260517,0.0000352568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994952,0.000016470833,0.00021862607,0.000092304996,0.000088479865,0.00008891675],"domain_scores_gemma":[0.9995166,0.00009822965,0.0001186773,0.000058754908,0.00017861408,0.00002912405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016925944,0.000065963904,0.00007265854,0.00007696254,0.00013527596,0.00039321237,0.00006156777,0.00003645767,2.8644624e-7],"category_scores_gemma":[0.000034620716,0.00005888106,0.000011728179,0.00010656017,0.000021990088,0.001341653,0.000025493266,0.000023643637,0.000006510223],"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.000008526627,0.00001751826,0.001244718,0.00019347927,0.000004269669,1.7563293e-7,0.0011479433,0.057383675,0.000018635119,0.83239734,0.00062844274,0.10695529],"study_design_scores_gemma":[0.00038998938,0.00004673967,0.011745099,0.000013256387,0.0000029616947,0.000009066227,0.0000355283,0.9671335,0.000011064171,0.017169427,0.003362321,0.0000810424],"about_ca_topic_score_codex":0.00004988892,"about_ca_topic_score_gemma":0.0000053959443,"teacher_disagreement_score":0.94347596,"about_ca_system_score_codex":0.000019548203,"about_ca_system_score_gemma":0.000022904247,"threshold_uncertainty_score":0.37917557},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038193297,0.0013840835,0.94568074,0.000888752,0.00048011227,0.000930057,7.417758e-7,0.00024007395,0.0122021455],"genre_scores_gemma":[0.7436815,0.00004350634,0.25516817,0.00034152975,0.00048216293,0.000026459413,0.0000010578175,0.000018247447,0.00023739638],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707735,0.0005085671,0.00059933914,0.00041333688,0.00061630196,0.00078512134],"domain_scores_gemma":[0.9979346,0.00017563075,0.00043264392,0.00068040064,0.00038930666,0.00038746727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002634881,0.00033658478,0.00046715487,0.00017418989,0.00048703386,0.00043364204,0.0025807866,0.00011487673,0.000025042107],"category_scores_gemma":[0.00015915526,0.0001911845,0.00022225906,0.00101301,0.00019634017,0.0009831123,0.00020150766,0.0006143548,0.00006222889],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014155722,0.000933229,0.00027071263,0.000016723045,0.00009723776,0.000049247432,0.014196391,0.0012025399,0.00018637243,0.04106504,0.00015238581,0.94168854],"study_design_scores_gemma":[0.010460658,0.044893485,0.020418832,0.0009882691,0.0015343142,0.020026196,0.042883914,0.05564692,0.003951499,0.45017412,0.341297,0.0077247918],"about_ca_topic_score_codex":0.000028639233,"about_ca_topic_score_gemma":0.000005874207,"teacher_disagreement_score":0.9339638,"about_ca_system_score_codex":0.00014562666,"about_ca_system_score_gemma":0.00012855369,"threshold_uncertainty_score":0.7796278},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41888484,0.00003092677,0.5525707,0.00007000381,0.0003195471,0.00016780647,5.593708e-7,0.00010104772,0.027854586],"genre_scores_gemma":[0.8528898,0.0000019739005,0.14674813,0.00021666144,0.000049401788,0.0000068638637,2.76345e-7,0.0000071273944,0.00007978399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984272,0.000058657854,0.00024800815,0.00052280235,0.00031194434,0.00043136545],"domain_scores_gemma":[0.9988783,0.0003328425,0.00008883454,0.000568886,0.00001763786,0.00011350093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038948993,0.0001899311,0.00025793142,0.00010484166,0.00012737938,0.00015293702,0.0008875605,0.00014005182,0.00007153127],"category_scores_gemma":[0.00013330112,0.00012329398,0.000048876183,0.00022464813,0.00009328817,0.00042162393,0.00026936448,0.00030413095,0.00010816005],"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.0002634264,0.0016894338,0.30569616,0.000018405968,0.00008916561,0.00093897054,0.0020398994,0.0020864503,0.030320054,0.40524754,0.00038659124,0.25122392],"study_design_scores_gemma":[0.0063536274,0.0005574846,0.42868748,0.00017679106,0.0000309962,0.0005980995,0.00009613347,0.4977829,0.000946597,0.059020765,0.004451251,0.0012978853],"about_ca_topic_score_codex":0.000037548445,"about_ca_topic_score_gemma":0.000503033,"teacher_disagreement_score":0.49569643,"about_ca_system_score_codex":0.000054065964,"about_ca_system_score_gemma":0.00005850626,"threshold_uncertainty_score":0.5027783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54695266,0.00059573376,0.05541431,0.00060037157,0.0006745365,0.000796745,0.0000031296365,0.00040554238,0.39455697],"genre_scores_gemma":[0.9789577,0.00001488421,0.020516315,0.0001849155,0.00006773774,0.00004763019,0.0000010857628,0.0000039307206,0.00020580844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99866366,0.00011973006,0.0002459978,0.00044993125,0.00020659115,0.00031405652],"domain_scores_gemma":[0.9986471,0.0001541092,0.000105757914,0.00073728006,0.00022138127,0.00013436793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032644783,0.00014797067,0.00026775792,0.00004357074,0.00012344551,0.00006815492,0.001023894,0.00007777053,0.0002887405],"category_scores_gemma":[0.00025456477,0.00010008554,0.00008512771,0.00032335368,0.00014374577,0.00036344212,0.00041871954,0.00010545336,0.00043120462],"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.000009903263,0.0013796177,0.04459504,0.000043223386,0.000057227848,0.000023137243,0.002393513,0.00003627557,0.0019312376,0.8886303,0.0046887374,0.056211818],"study_design_scores_gemma":[0.0005689414,0.0010073748,0.7052867,0.000011299617,0.0000133754365,0.000012302883,0.00017913953,0.0025555638,0.001286344,0.28460875,0.004044729,0.00042547443],"about_ca_topic_score_codex":0.0000985493,"about_ca_topic_score_gemma":0.000032223117,"teacher_disagreement_score":0.6606917,"about_ca_system_score_codex":0.00003005708,"about_ca_system_score_gemma":0.00006912304,"threshold_uncertainty_score":0.55424064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42192984,0.03788786,0.0819286,0.3962728,0.0055132727,0.0011121229,0.000008411516,0.0002913208,0.055055767],"genre_scores_gemma":[0.99248314,0.0010848839,0.0018192179,0.0032247056,0.0013044078,0.0000036187964,3.0796676e-7,0.000006023953,0.00007368394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986443,0.00022349521,0.00039362488,0.00018551383,0.0003272824,0.0002257825],"domain_scores_gemma":[0.9987261,0.0003360506,0.00030473137,0.0002444289,0.00022665733,0.00016197795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351967,0.00014807843,0.00034823007,0.000110885354,0.00023638715,0.000091234324,0.00071684964,0.000108547385,0.000020760783],"category_scores_gemma":[0.00031215965,0.00007604627,0.00017064289,0.00032348136,0.00028733604,0.00048749935,0.00020866153,0.00044319843,0.000028932594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029751024,0.00029177146,0.0010056744,0.000019024168,0.00009595323,0.0010156526,0.0023262792,0.000011704703,0.00018110963,0.9836935,0.0013249678,0.009736882],"study_design_scores_gemma":[0.0027103615,0.0009461804,0.011344228,0.000055727265,0.000027853457,0.0047230218,0.000008214133,0.0026458753,0.00006522549,0.97413665,0.0031098707,0.00022677865],"about_ca_topic_score_codex":0.000003602787,"about_ca_topic_score_gemma":6.930646e-7,"teacher_disagreement_score":0.5705533,"about_ca_system_score_codex":0.000028607621,"about_ca_system_score_gemma":0.000054506752,"threshold_uncertainty_score":0.31010768},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14055377,0.0014392714,0.8487293,0.00025807394,0.0026931644,0.00097509014,0.000024501504,0.00055506645,0.00477177],"genre_scores_gemma":[0.98446256,0.000052003605,0.011192021,0.00065126875,0.000119850105,0.000060380276,0.000032590622,0.000020990037,0.0034083182],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977644,0.00015549941,0.00048322038,0.0007085952,0.00038443197,0.0005038337],"domain_scores_gemma":[0.99876344,0.000086786466,0.00023222539,0.00046609994,0.00014472402,0.00030670705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030478844,0.00032276247,0.0003790743,0.00014804988,0.0005804267,0.00021121683,0.0006309227,0.0001283709,0.00003740257],"category_scores_gemma":[0.00003171905,0.00027016844,0.00012823495,0.00021043031,0.000109970744,0.0002778896,0.00021642396,0.00013648553,0.00033527752],"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.00008885047,0.0075115166,0.31447962,0.001179152,0.0012297084,0.004253802,0.029553255,0.26506442,0.00048533845,0.20256846,0.1344059,0.03917999],"study_design_scores_gemma":[0.0016813988,0.00010788457,0.0751284,0.000040961964,0.000013977719,0.00014860804,0.000045827255,0.8797224,0.000028043261,0.00008752349,0.04257088,0.00042409883],"about_ca_topic_score_codex":0.00021880402,"about_ca_topic_score_gemma":0.0000070600954,"teacher_disagreement_score":0.8439088,"about_ca_system_score_codex":0.00012824844,"about_ca_system_score_gemma":0.00017087955,"threshold_uncertainty_score":0.999975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02445561,0.000029543531,0.97387964,0.0002924994,0.0005005718,0.00021222408,0.000016659827,0.00017095487,0.00044227391],"genre_scores_gemma":[0.60442096,0.000005134444,0.3951373,0.0003437637,0.000037331567,0.000009285196,0.000023301289,0.00000458051,0.000018326973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989132,0.000041171825,0.00035477232,0.00024000245,0.00014360051,0.0003071956],"domain_scores_gemma":[0.99881005,0.0005119982,0.00014565168,0.0002426244,0.00017388316,0.00011580622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036781403,0.0001953467,0.00017712936,0.0002494862,0.00041127135,0.00008316957,0.00027192142,0.00015821701,0.000010185021],"category_scores_gemma":[0.00001614276,0.00014820414,0.000061464016,0.0003853626,0.00023380903,0.00030817045,0.0000055938503,0.00022397417,0.0000303578],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117571886,0.00019171188,0.0016024403,0.00006395318,0.00010374245,0.00000668211,0.0014091509,0.010476635,0.00007485669,0.007654373,0.00005865559,0.97824025],"study_design_scores_gemma":[0.0043840907,0.0037966496,0.009744384,0.00017039836,0.00009998516,0.0010583092,0.0011575468,0.9466389,0.004798799,0.020501258,0.0062622773,0.0013874328],"about_ca_topic_score_codex":0.0000074745926,"about_ca_topic_score_gemma":0.00004115184,"teacher_disagreement_score":0.9768528,"about_ca_system_score_codex":0.000039385526,"about_ca_system_score_gemma":0.000118508804,"threshold_uncertainty_score":0.604359},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11211123,0.000052524272,0.83863616,0.000014594507,0.00035750362,0.0003192535,6.129002e-7,0.0003201465,0.048187982],"genre_scores_gemma":[0.6915126,1.3407124e-7,0.30759314,0.00010164256,0.00017540902,0.00000850791,0.0000015589582,0.000009625442,0.0005973762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982892,0.00004640499,0.00028735003,0.00053703575,0.00026263462,0.00057736045],"domain_scores_gemma":[0.9991638,0.000051950392,0.000059090293,0.00045280182,0.00008744486,0.00018492054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009893401,0.00018235715,0.00020646815,0.000114199465,0.0002729968,0.00082203123,0.0006531592,0.000042115316,0.0000013712078],"category_scores_gemma":[0.00004464225,0.00013833265,0.000073775016,0.00041481352,0.00002121306,0.0008107872,0.00039220048,0.0001125631,0.000034041834],"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.000019681145,0.00053925376,0.00929263,0.00049430964,0.00010581067,0.00027105954,0.014767606,0.0032658174,0.0060127764,0.8538985,0.0013449454,0.10998759],"study_design_scores_gemma":[0.0007480352,0.0002314946,0.0010950991,0.00026097547,0.000027155462,0.00094342843,0.0043341974,0.967199,0.016038004,0.000117681295,0.0077069914,0.0012978965],"about_ca_topic_score_codex":0.00012666536,"about_ca_topic_score_gemma":0.000012190433,"teacher_disagreement_score":0.9639332,"about_ca_system_score_codex":0.0001442885,"about_ca_system_score_gemma":0.000072070245,"threshold_uncertainty_score":0.7926866},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004835527,0.00011373219,0.95878106,0.000037357746,0.00032456298,0.0001259653,4.1531712e-7,0.00014899303,0.035632353],"genre_scores_gemma":[0.98455894,0.000001888051,0.012507592,0.000051132996,0.000062936146,0.000008263984,0.000004043423,0.0000022531628,0.0028029773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993709,0.000015666596,0.00015387233,0.00019735366,0.000096761934,0.00016546722],"domain_scores_gemma":[0.9993723,0.00015060423,0.000051833158,0.0002473464,0.00012459315,0.000053309926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005644385,0.000059995065,0.000116138974,0.0001731988,0.00005754063,0.00011351683,0.0003113447,0.000040064973,0.000010061435],"category_scores_gemma":[0.00006073881,0.00004544039,0.00010029733,0.0006262812,0.000008262711,0.00017107374,0.000049715392,0.00002487518,0.000034134242],"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.000019118428,0.000095070216,0.008656029,0.000034403958,0.0004957089,0.000004881873,0.0037033292,0.0007137099,0.00083105103,0.9406017,0.005224899,0.039620075],"study_design_scores_gemma":[0.00018035655,0.0000649748,0.0050594485,0.0000047526523,0.00006706446,0.0000020046843,0.0000963078,0.9881934,0.000981727,0.001059295,0.0041631158,0.00012757955],"about_ca_topic_score_codex":0.00005735891,"about_ca_topic_score_gemma":0.00012463397,"teacher_disagreement_score":0.9874797,"about_ca_system_score_codex":0.00003454158,"about_ca_system_score_gemma":0.000014278013,"threshold_uncertainty_score":0.18530053},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027089562,0.000060441143,0.96503156,0.00074519706,0.00031667238,0.00012753383,0.0000075213593,0.00014772454,0.0064737736],"genre_scores_gemma":[0.92920476,0.000022056656,0.07027992,0.0002531057,0.00003253321,0.000015342732,0.000010865205,0.0000053758185,0.0001760177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988921,0.00008657572,0.00024996293,0.00028068,0.0003128656,0.0001777778],"domain_scores_gemma":[0.99902856,0.000324032,0.00009312921,0.00033476303,0.00016349247,0.000056015808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019085153,0.00013550285,0.00015248382,0.00015221644,0.00022711128,0.000046557623,0.0005958984,0.00006029923,0.00014935597],"category_scores_gemma":[0.000037080925,0.000119260934,0.00011150073,0.00043312195,0.00009767383,0.00028451273,0.000019734347,0.000120326455,0.00009994426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007687727,0.000710953,0.00037304612,0.000016490663,0.00008217448,0.000016163822,0.00096995936,0.061919726,0.0006099846,0.8703011,0.0001892847,0.06473423],"study_design_scores_gemma":[0.0009916928,0.0005281639,0.013609064,0.000027770217,0.000023659672,0.00011413599,0.00015158685,0.038065486,0.0026337514,0.94262105,0.0009210604,0.00031254886],"about_ca_topic_score_codex":0.000019983936,"about_ca_topic_score_gemma":0.0000096970425,"teacher_disagreement_score":0.9021152,"about_ca_system_score_codex":0.000058096353,"about_ca_system_score_gemma":0.00007033307,"threshold_uncertainty_score":0.48633197},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027778435,0.000014100898,0.96511173,0.00027538894,0.0006272004,0.00037068556,0.000002260692,0.00014762576,0.005672561],"genre_scores_gemma":[0.98673296,0.0000017279293,0.012965633,0.00014343436,0.00005956586,0.000037937636,0.000024701096,0.0000015570378,0.000032466225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940556,0.000023460707,0.00023591204,0.00010597182,0.00011586007,0.00011325944],"domain_scores_gemma":[0.99938285,0.00012830339,0.00011620964,0.0001052205,0.00020679751,0.00006062961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032231823,0.000073105795,0.000089679146,0.000057037763,0.0001400673,0.000340344,0.00012094454,0.000053820473,0.000002187696],"category_scores_gemma":[0.00011558828,0.00005943388,0.000025894044,0.00010901562,0.000033148663,0.00089312054,0.00004162313,0.00007689473,0.00002872179],"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.0000060099346,0.000018025305,0.00008524159,0.000049855007,0.0000033263996,1.1692848e-7,0.0012390956,0.0005305954,0.000015587755,0.96838295,0.0005069797,0.029162193],"study_design_scores_gemma":[0.0005660416,0.00006993759,0.0061676754,0.0000065962677,0.0000036293275,0.000021758431,0.00017252093,0.9391295,0.000016973487,0.039746672,0.0139686745,0.0001300449],"about_ca_topic_score_codex":0.00000925142,"about_ca_topic_score_gemma":0.000007095441,"teacher_disagreement_score":0.9589545,"about_ca_system_score_codex":0.000016973165,"about_ca_system_score_gemma":0.0000409848,"threshold_uncertainty_score":0.3281945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40388438,0.0019397695,0.55497974,0.00021103639,0.0018199157,0.00019781847,5.457962e-7,0.000086509215,0.036880273],"genre_scores_gemma":[0.9899931,0.000021868935,0.009213541,0.00041141783,0.00025032845,0.0000069036664,6.8751444e-7,0.000018502733,0.00008365205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970307,0.00034041953,0.0008809993,0.00041764777,0.0006765667,0.000653673],"domain_scores_gemma":[0.9979335,0.00061296136,0.00036196574,0.00037674652,0.0002826173,0.00043218368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190992,0.0003113883,0.00042702898,0.00014612822,0.00025058028,0.00036867088,0.0012004767,0.00018544776,0.00023767973],"category_scores_gemma":[0.00078145124,0.0002367948,0.0003114633,0.00046587884,0.00087294687,0.00042079453,0.00020312917,0.0005709651,0.00026811776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027049024,0.00057384605,0.00007680838,0.0000028583513,0.00003983442,0.00013829353,0.0030090522,0.00083614455,0.01127014,0.9779989,0.000085764405,0.0059413128],"study_design_scores_gemma":[0.00007839,0.0011647773,0.000009612827,0.000059503494,0.000014302172,0.00043033637,0.0052311593,0.006021883,0.3847556,0.60085785,0.0012332918,0.00014324821],"about_ca_topic_score_codex":0.0000071382174,"about_ca_topic_score_gemma":8.914275e-7,"teacher_disagreement_score":0.58610874,"about_ca_system_score_codex":0.00015380324,"about_ca_system_score_gemma":0.00018424666,"threshold_uncertainty_score":0.9656212},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111880325,0.000046051937,0.88279074,0.00047042494,0.00062191096,0.00018532711,2.1332541e-7,0.000092358016,0.003912647],"genre_scores_gemma":[0.97928977,0.000010488539,0.020068256,0.00041817533,0.00018440306,0.000011492855,5.0558975e-7,0.000010868056,0.000006052527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964409,0.000135497,0.00045315662,0.0008718399,0.0005148019,0.0015838391],"domain_scores_gemma":[0.9980784,0.00068443595,0.00008803342,0.00086805463,0.00007611621,0.0002049428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026514924,0.00027253016,0.00035992524,0.0004138437,0.00021745703,0.0003919011,0.003156719,0.00010500089,0.000012091218],"category_scores_gemma":[0.0003967725,0.00023205145,0.0000763247,0.0015620436,0.0013929037,0.0006416146,0.0010956407,0.0005461494,0.000095013485],"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.00000910292,0.00009033667,0.0011329578,0.000010257632,0.0000013828859,0.000013004528,0.00064080517,0.00021453085,0.00017700913,0.9583812,0.000011627782,0.03931782],"study_design_scores_gemma":[0.0005044303,0.00041920313,0.002645356,0.00004075643,0.0000019455229,0.00004722058,0.0000018530958,0.8080128,0.0020350819,0.18583383,0.00016355449,0.00029401897],"about_ca_topic_score_codex":0.0000099724175,"about_ca_topic_score_gemma":0.000037560865,"teacher_disagreement_score":0.8674094,"about_ca_system_score_codex":0.0003027493,"about_ca_system_score_gemma":0.000404381,"threshold_uncertainty_score":0.94627833},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13383543,0.00006828258,0.857204,0.00031479562,0.0002643156,0.00021783232,1.2215277e-7,0.0009774495,0.0071177557],"genre_scores_gemma":[0.9549987,0.000013177123,0.044458114,0.00033691447,0.00013732287,0.000020388861,5.7149566e-7,0.000015821617,0.000019040455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962066,0.000056316076,0.00033260506,0.001138685,0.00078149984,0.0014843189],"domain_scores_gemma":[0.99861217,0.00025932494,0.00016552955,0.00040695793,0.00032487535,0.00023114093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002490953,0.00033615617,0.0003426628,0.00035560384,0.00051852263,0.000978015,0.002251177,0.00012688006,0.000011298053],"category_scores_gemma":[0.00056732586,0.00025327483,0.000056411896,0.0025451386,0.0016279081,0.0014833125,0.0006537649,0.00061794085,0.00002943207],"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.000022746128,0.00006443529,0.0015445221,0.00001687127,0.000005725868,0.0000041425296,0.0007087982,0.00019495451,0.0002640213,0.9885675,0.00003552628,0.008570757],"study_design_scores_gemma":[0.00045385133,0.0007387984,0.004506473,0.00008507052,0.000006826124,0.00008634095,0.000010722652,0.8386752,0.0023521765,0.15243503,0.0002953755,0.00035413948],"about_ca_topic_score_codex":0.000006495507,"about_ca_topic_score_gemma":0.000010021117,"teacher_disagreement_score":0.83848023,"about_ca_system_score_codex":0.0003748977,"about_ca_system_score_gemma":0.0003626613,"threshold_uncertainty_score":0.99999195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7304424,0.004029976,0.16450912,0.0041919923,0.000504578,0.00027948982,0.0000019846348,0.0005143308,0.09552616],"genre_scores_gemma":[0.98333365,0.00005164674,0.01527867,0.00013853525,0.00010450141,0.000007672631,4.5907953e-7,0.000003420446,0.0010814396],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994859,0.000024252258,0.00007808869,0.00018327289,0.00009268748,0.00013580377],"domain_scores_gemma":[0.9996507,0.00006480281,0.000029709558,0.00018003775,0.000020767726,0.00005398915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012218484,0.00006775159,0.00006696685,0.000040000217,0.00006653547,0.00009340388,0.00020439654,0.000025913228,0.000051953677],"category_scores_gemma":[0.000063452775,0.00005492502,0.000021142434,0.00007714088,0.000030974956,0.00036551573,0.00009416328,0.000038112037,0.00017404117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003953827,0.0000922457,0.005530777,0.000015323589,0.000019946901,0.000004979789,0.003397515,0.0000052918977,0.0042746724,0.18298538,0.0015311474,0.80213875],"study_design_scores_gemma":[0.0012055321,0.00019909642,0.025391832,0.00010586682,0.00003159242,0.00008208087,0.000586377,0.058864217,0.2922341,0.017085195,0.6032245,0.0009896125],"about_ca_topic_score_codex":0.00000512508,"about_ca_topic_score_gemma":0.000010065092,"teacher_disagreement_score":0.80114913,"about_ca_system_score_codex":0.000016110713,"about_ca_system_score_gemma":0.000014309396,"threshold_uncertainty_score":0.22397773},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030692052,0.00008045147,0.45112133,0.0010474266,0.0002343076,0.00009656948,1.4565741e-7,0.000056541357,0.5166712],"genre_scores_gemma":[0.98832697,0.000017045075,0.009772025,0.000115590665,0.00002026258,0.000003853973,4.3373964e-7,0.0000014906157,0.0017423388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994905,0.00007729451,0.000111397305,0.00012817116,0.000116489864,0.00007617637],"domain_scores_gemma":[0.9993889,0.00008371871,0.00005731314,0.00034198177,0.00010552712,0.000022603625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039908302,0.00004507402,0.00005384789,0.000026212378,0.000059210804,0.000041552838,0.00034673978,0.000029781562,0.00011078663],"category_scores_gemma":[0.00019087053,0.000025888754,0.00003430796,0.00027400712,0.000032448024,0.00015918072,0.000030041365,0.000067414665,0.00015149856],"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":[4.2762338e-7,0.000024028453,0.0010958487,0.0000015511057,0.000002214606,1.00084485e-7,0.00052247883,0.0000011777406,0.00041432361,0.987219,0.00095110765,0.009767764],"study_design_scores_gemma":[0.0004004368,0.00015321453,0.0669741,0.000018708037,0.000011989446,0.000023209725,0.0006064144,0.01110909,0.49462503,0.35401043,0.071786135,0.00028120598],"about_ca_topic_score_codex":0.0000398047,"about_ca_topic_score_gemma":0.00001728024,"teacher_disagreement_score":0.9576349,"about_ca_system_score_codex":0.000016685879,"about_ca_system_score_gemma":0.00004515835,"threshold_uncertainty_score":0.1947258},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030943942,0.0016716333,0.9377768,0.00088461017,0.0013237344,0.0010173807,0.0000031534485,0.00017538464,0.057116352],"genre_scores_gemma":[0.035015065,0.00045037645,0.960146,0.0015067974,0.00077194296,0.00004949526,0.0000111583195,0.00006949792,0.0019796563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503016,0.00007478034,0.00092862255,0.0016155118,0.0013776952,0.0009732447],"domain_scores_gemma":[0.99624527,0.0006103022,0.0007581179,0.0015397033,0.00066127867,0.00018534553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002547892,0.00067782664,0.0006756368,0.0007478791,0.00040923024,0.0009720688,0.004851084,0.0004681464,0.000023369394],"category_scores_gemma":[0.000043621887,0.0004676626,0.00024644073,0.0010861777,0.0012263758,0.0013455356,0.00169027,0.0011182434,0.00006936384],"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.000008522296,0.00008096346,0.000056716835,0.00016246623,0.000021679563,0.000041287673,0.0052143107,0.0027431191,0.00010410608,0.4059148,0.00007954859,0.5855725],"study_design_scores_gemma":[0.00041280428,0.0004502251,0.00009819492,0.0015003069,0.000024099409,0.00018706723,0.000002831612,0.024902117,0.0015897001,0.9608651,0.009069636,0.0008979576],"about_ca_topic_score_codex":0.000038694125,"about_ca_topic_score_gemma":0.00019783781,"teacher_disagreement_score":0.58467454,"about_ca_system_score_codex":0.0002638329,"about_ca_system_score_gemma":0.0008289774,"threshold_uncertainty_score":0.9997775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679609,0.00036535677,0.021712461,0.000022025402,0.00013888924,0.000049664563,5.5022264e-7,0.00007392276,0.009676237],"genre_scores_gemma":[0.9980876,0.00006258869,0.00022014977,0.000047179336,0.000043083615,1.8981953e-7,4.3818787e-7,0.0000031960592,0.001535563],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993204,0.000054169246,0.00005879596,0.00025249796,0.000032770262,0.0002813799],"domain_scores_gemma":[0.9995496,0.00004255336,0.000034076427,0.00023728352,0.000015288391,0.00012119899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012916051,0.00009458461,0.0001160977,0.000098726516,0.00006816869,0.000034806268,0.000379978,0.00005220215,0.000016119287],"category_scores_gemma":[0.000020180301,0.00008856099,0.000027523152,0.00034834887,0.00005798919,0.00048610705,0.00023124061,0.0000930583,0.00006476506],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006819768,0.00015709072,0.55474293,0.000017482147,0.0000123825075,0.0001363169,0.0066649434,0.000019502788,0.00014753468,0.43335745,0.00007675389,0.004660755],"study_design_scores_gemma":[0.00090093364,0.00009833216,0.966303,0.000032496628,0.000013421387,0.000019540617,0.0009525358,0.023903871,0.0003542909,0.0065865335,0.00040507343,0.0004299828],"about_ca_topic_score_codex":0.00020839248,"about_ca_topic_score_gemma":0.00009914535,"teacher_disagreement_score":0.42677093,"about_ca_system_score_codex":0.000031374908,"about_ca_system_score_gemma":0.00001547431,"threshold_uncertainty_score":0.36114123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1813244,0.00024219106,0.701737,0.0057364996,0.011632259,0.0023188815,0.000095134645,0.0007436563,0.09616997],"genre_scores_gemma":[0.99237305,0.000055278284,0.0056464802,0.0002129885,0.0005436397,0.00016880021,0.000001648702,0.000024795081,0.0009733068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99717134,0.000018936127,0.00082258374,0.0007623825,0.0007242818,0.00050046656],"domain_scores_gemma":[0.997356,0.0002846112,0.0005431264,0.0003664661,0.001335364,0.00011441473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005391413,0.00035525896,0.00037208636,0.00019852287,0.0003373377,0.0009423884,0.0035902907,0.00011684719,0.00010194998],"category_scores_gemma":[0.0006921186,0.00027498367,0.0003326661,0.00036072658,0.0002028743,0.0013337705,0.0003416348,0.00027792435,0.00012204574],"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.000043068132,0.00016969704,0.000019883782,0.000047562255,0.0000454278,0.0000013096413,0.0008243132,0.000058145153,0.022511546,0.90312153,0.0022778357,0.07087969],"study_design_scores_gemma":[0.00010669378,0.00028385688,0.000027760643,0.0005049281,0.000015276504,0.000041344727,0.000515302,0.43189278,0.5148854,0.045233205,0.006042744,0.00045068492],"about_ca_topic_score_codex":0.00003651781,"about_ca_topic_score_gemma":0.000006344031,"teacher_disagreement_score":0.85788834,"about_ca_system_score_codex":0.00021663011,"about_ca_system_score_gemma":0.000060046572,"threshold_uncertainty_score":0.99997026},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10508214,0.0020762067,0.88627577,0.0011729724,0.00037094933,0.000091471156,3.5770626e-7,0.00004007095,0.0048900577],"genre_scores_gemma":[0.91320413,0.00010368114,0.0857093,0.0006413755,0.00027715688,0.0000014072131,9.138197e-7,0.0000054967404,0.000056510613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842256,0.00018189267,0.00056824135,0.0002533758,0.00029194768,0.00028200864],"domain_scores_gemma":[0.99884796,0.00019288616,0.00049066544,0.00012423474,0.00022212967,0.00012209332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007334146,0.00017216278,0.000319776,0.00023456785,0.00013328678,0.0002151694,0.00040512733,0.00011912292,0.00001138097],"category_scores_gemma":[0.00012983233,0.00012757402,0.00008531383,0.00032109127,0.00005212641,0.0008083858,0.00012372689,0.00028640343,0.000021214366],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014262304,0.0010967742,0.00932544,0.00009083761,0.0000804746,0.000742272,0.00831145,0.1040419,0.0032984256,0.16164057,0.003007176,0.70822203],"study_design_scores_gemma":[0.0031827965,0.0009112873,0.087429136,0.0002539779,0.00003671096,0.0015958017,0.0004050226,0.53619,0.00028779716,0.36784,0.0012960493,0.00057145633],"about_ca_topic_score_codex":0.000008825719,"about_ca_topic_score_gemma":0.000010173654,"teacher_disagreement_score":0.80812204,"about_ca_system_score_codex":0.00008901181,"about_ca_system_score_gemma":0.00008875285,"threshold_uncertainty_score":0.5202318},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035674706,0.00009514401,0.6168282,0.0002136258,0.000065787855,0.000067148896,1.3152702e-7,0.00007235697,0.34698293],"genre_scores_gemma":[0.9922153,0.000004415768,0.006397879,0.00008914622,0.000008540237,0.0000053227764,5.141789e-7,0.0000013057884,0.001277575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933463,0.000081418446,0.00008971402,0.0002494864,0.00010340407,0.00014132376],"domain_scores_gemma":[0.9995611,0.000053439002,0.000026697548,0.00022539383,0.0000958221,0.00003758515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026631024,0.00006103016,0.00010829596,0.0002018531,0.00003889713,0.00005574064,0.00019996133,0.00003002999,0.000100381345],"category_scores_gemma":[0.00014666408,0.00004796906,0.00006815475,0.0015430566,0.000013589114,0.00017546017,0.000029354282,0.00005137535,0.00006428807],"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":[7.6731413e-7,0.0000487215,0.007830192,5.031071e-7,0.000032872238,0.0000034446828,0.003616837,0.0017564327,0.000028547069,0.9858122,0.00006917727,0.0008003057],"study_design_scores_gemma":[0.0009317428,0.000112975904,0.10403427,0.000005589588,0.000088238034,0.000006528661,0.0035018986,0.6809691,0.0011673317,0.20652007,0.002162336,0.0004998845],"about_ca_topic_score_codex":0.00056128524,"about_ca_topic_score_gemma":0.0027734826,"teacher_disagreement_score":0.9565406,"about_ca_system_score_codex":0.00013089017,"about_ca_system_score_gemma":0.000053870182,"threshold_uncertainty_score":0.19561215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046135642,0.00083254714,0.96716195,0.0005048257,0.0016324527,0.00045046935,0.000003017069,0.00008108563,0.02887232],"genre_scores_gemma":[0.9064844,0.000082321894,0.090723716,0.0011708309,0.00052042364,0.000014623625,0.0000047079093,0.000033996956,0.0009649726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958908,0.00013976768,0.0006660858,0.0013371718,0.0012322876,0.00073387864],"domain_scores_gemma":[0.9959724,0.0017311429,0.00033527744,0.0016054219,0.00026324645,0.00009251343],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019380663,0.0005056068,0.0006347883,0.0006530524,0.00017177667,0.00037338812,0.005890614,0.0003164694,0.0000102872555],"category_scores_gemma":[0.00029994856,0.00035217643,0.00018522843,0.0009754241,0.0013435959,0.00047681772,0.0010394683,0.0008944726,0.000022723458],"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.00003618594,0.0004952717,0.00485703,0.00036354462,0.00004013212,0.00083476934,0.016295852,0.07773813,0.00047639117,0.24914712,0.0023028143,0.6474128],"study_design_scores_gemma":[0.00053793937,0.00054165535,0.0043325145,0.0012125749,0.000020940992,0.000178708,0.0000024731935,0.6122341,0.0017859956,0.37556034,0.0023225045,0.0012702122],"about_ca_topic_score_codex":0.00014756345,"about_ca_topic_score_gemma":0.0003290957,"teacher_disagreement_score":0.906023,"about_ca_system_score_codex":0.000142,"about_ca_system_score_gemma":0.0005892723,"threshold_uncertainty_score":0.999893},"labels":[],"label_agreement":null},{"id":"W2101208282","doi":"10.1093/logcom/exn040","title":"Monotonic Answer Set Programming","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Answer set programming; Mathematical proof; Computer science; Set (abstract data type); Monotonic function; Logic programming; Non-monotonic logic; Theoretical computer science; Default logic; Logic program; Programming language; Stable model semantics; Algorithm; Mathematics; Semantics (computer science); Description logic","score_opus":0.038008121531624,"score_gpt":0.27673641460856807,"score_spread":0.23872829307694407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101208282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20787865,0.0009161399,0.7892473,0.0002849148,0.00029004095,0.000056064036,9.821241e-8,0.000028089433,0.0012987047],"genre_scores_gemma":[0.9475047,0.00011955887,0.052055974,0.00011954784,0.00013404051,8.027961e-7,3.9490524e-7,0.0000025725217,0.000062410545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930847,0.000050870003,0.00023612316,0.00010938064,0.00016771548,0.00012746366],"domain_scores_gemma":[0.99939007,0.00005932637,0.00023877354,0.00006216399,0.00017426902,0.000075388365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002457739,0.00007680895,0.0001468489,0.00008194825,0.00013269173,0.00006456862,0.00018529539,0.000040572584,0.000002299283],"category_scores_gemma":[0.000027531676,0.00005548822,0.00005795062,0.00015836024,0.000041070172,0.00035194418,0.00004800446,0.00011811094,0.000006319799],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007028903,0.0004680706,0.022829732,0.00006311977,0.00013075654,0.0008469737,0.017606098,0.0053147464,0.00034506497,0.07707836,0.0076318146,0.867615],"study_design_scores_gemma":[0.0061648316,0.0058522117,0.23126774,0.00023019798,0.00010647207,0.01715034,0.001112106,0.48542166,0.0007981463,0.21231899,0.03824601,0.0013313091],"about_ca_topic_score_codex":0.0000022220436,"about_ca_topic_score_gemma":5.8996596e-7,"teacher_disagreement_score":0.86628366,"about_ca_system_score_codex":0.000022230002,"about_ca_system_score_gemma":0.0000653743,"threshold_uncertainty_score":0.2262744},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083523825,0.021573333,0.7251241,0.001859769,0.0007188805,0.0015014763,0.000040595027,0.00041314628,0.16524486],"genre_scores_gemma":[0.9945988,0.00015153964,0.003852997,0.0003876033,0.0002377309,0.00004972854,0.000008916211,0.000007881765,0.0007047998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887925,0.000018316641,0.00025227675,0.00036431942,0.00014413054,0.00034171238],"domain_scores_gemma":[0.9992332,0.00010131458,0.00014460045,0.00030554985,0.00014728509,0.00006806357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225872,0.00016563507,0.00030888533,0.00006466902,0.00012254402,0.00009694496,0.00038510328,0.00012687134,0.0000029819112],"category_scores_gemma":[0.000015471089,0.00012405908,0.00008272191,0.00017381298,0.00006848651,0.00010672097,0.00011801921,0.00007224579,0.000011957642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009534488,0.00008235754,0.000092059,0.00006740776,0.000011040485,0.000002891219,0.0000683336,0.0003297402,0.0010170138,0.97987455,0.015997145,0.0024479253],"study_design_scores_gemma":[0.0010017757,0.0005239816,0.0026718543,0.000043266293,0.000026976246,0.000035857676,0.00015996516,0.015967986,0.011473443,0.924083,0.04337981,0.0006320842],"about_ca_topic_score_codex":0.000025899337,"about_ca_topic_score_gemma":0.0000073301358,"teacher_disagreement_score":0.911075,"about_ca_system_score_codex":0.000003888294,"about_ca_system_score_gemma":0.00002672383,"threshold_uncertainty_score":0.50589824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000839492,0.0012165712,0.97371715,0.00059443474,0.001039195,0.000404125,0.0000073194465,0.00018107172,0.022756174],"genre_scores_gemma":[0.43400854,0.00009381709,0.5593504,0.004307638,0.0011129628,0.0000071068994,0.000022404098,0.00005973358,0.0010374453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616325,0.000040928186,0.000481494,0.0015624939,0.00092940434,0.00082240696],"domain_scores_gemma":[0.9976746,0.0005483724,0.00026070382,0.0009217509,0.00029315084,0.0003014626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009912195,0.00058729254,0.00061612966,0.00078170316,0.0004104411,0.00065987743,0.0023234768,0.0003209435,0.000032716514],"category_scores_gemma":[0.00007636627,0.00048537014,0.0001319174,0.00051029195,0.0012870607,0.00047981014,0.0009988372,0.000821087,0.00008514262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017899567,0.00009895541,0.0004234769,0.000113218,0.000033557368,0.0006200865,0.0011904724,0.002295379,0.00026392462,0.59666884,0.00010854858,0.39816564],"study_design_scores_gemma":[0.00063025684,0.00051305676,0.0022615297,0.00051807915,0.000019402918,0.0011109107,2.2534331e-7,0.38352054,0.00023640312,0.6051318,0.004758966,0.0012988147],"about_ca_topic_score_codex":0.000025265184,"about_ca_topic_score_gemma":0.00010614563,"teacher_disagreement_score":0.4339246,"about_ca_system_score_codex":0.00028257346,"about_ca_system_score_gemma":0.00044342538,"threshold_uncertainty_score":0.9997598},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018586622,0.0006173466,0.14153686,0.0026156176,0.00040853026,0.00006778368,1.866552e-7,0.00029360852,0.8526014],"genre_scores_gemma":[0.96749216,0.00009911216,0.0019067088,0.0003330659,0.000080042235,0.000006489814,9.955685e-8,0.0000020794294,0.030080253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993932,0.00003792612,0.000090698304,0.00015011657,0.0001273794,0.00020063449],"domain_scores_gemma":[0.9993492,0.00008476105,0.000026247768,0.0004451442,0.00003187856,0.0000627899],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025749838,0.000054327946,0.00004669616,0.000009692348,0.00024697685,0.00015228298,0.0008463667,0.000023979768,0.00014089001],"category_scores_gemma":[0.000039328384,0.0000281169,0.00003665289,0.00013343796,0.000050147166,0.0001802883,0.00018850343,0.000064006184,0.0009077411],"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":[5.3997076e-7,0.000045401783,0.0015866889,0.0000022190775,0.000008113056,0.00000671719,0.00063030154,0.0000016247518,0.000007721425,0.83624786,0.07790243,0.083560385],"study_design_scores_gemma":[0.00035148486,0.000090342364,0.022805087,0.0000048149054,0.0000046600403,0.00005802198,0.000029727624,0.24293011,0.00086846045,0.030566523,0.7020176,0.00027317458],"about_ca_topic_score_codex":0.000013975173,"about_ca_topic_score_gemma":0.00001882443,"teacher_disagreement_score":0.9656335,"about_ca_system_score_codex":0.0000097999655,"about_ca_system_score_gemma":0.000008329329,"threshold_uncertainty_score":0.9998702},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142363,0.0002033997,0.100957744,0.0009016754,0.000047676433,0.00008666602,9.4556634e-7,0.000101129495,0.8462771],"genre_scores_gemma":[0.9384831,0.000049862247,0.058683977,0.00017027084,0.0000311746,0.0000017890576,2.9437786e-7,0.000002694017,0.0025768247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994864,0.000015113343,0.00013334939,0.00015197296,0.000103042206,0.00011011218],"domain_scores_gemma":[0.99956435,0.00004542509,0.000030783216,0.00027872642,0.000030813655,0.000049877588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001252618,0.000069657646,0.00012736476,0.000024141162,0.000033935095,0.000031566688,0.00031649135,0.000035503646,0.0003785582],"category_scores_gemma":[0.000011552253,0.000049043527,0.000031234842,0.000105500476,0.000055959394,0.00013245751,0.00010206425,0.000035952515,0.00011198591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6779305e-7,0.00008842726,0.00032081414,0.000025809402,0.000004996125,0.0000018076277,0.00049299776,0.0000036102952,0.000044050263,0.9889911,0.000247169,0.009778654],"study_design_scores_gemma":[0.00017475018,0.000069098096,0.00073840364,0.000011207254,0.000003407065,0.000017112432,0.000012808495,0.023266273,0.00071695313,0.97406375,0.00082489435,0.00010131633],"about_ca_topic_score_codex":0.000015309204,"about_ca_topic_score_gemma":0.0000030681151,"teacher_disagreement_score":0.8870595,"about_ca_system_score_codex":0.0000044309386,"about_ca_system_score_gemma":0.000011758547,"threshold_uncertainty_score":0.4144947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019301195,0.000035263613,0.9687561,0.0002214059,0.0005588664,0.00021526901,2.0143084e-7,0.00014333116,0.010768404],"genre_scores_gemma":[0.8290786,0.000003647793,0.17070049,0.00015115422,0.0000364414,0.0000067914325,2.4857303e-7,0.000004783436,0.000017805896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979474,0.000117733514,0.00029900565,0.00048112657,0.00057057186,0.00058416644],"domain_scores_gemma":[0.9982895,0.00017869516,0.00012487304,0.0009224074,0.00029819531,0.00018628359],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018935121,0.00016717539,0.00017987736,0.00007730954,0.0004949669,0.00028936012,0.0030565732,0.00005767578,0.000022079788],"category_scores_gemma":[0.000117051415,0.000098035394,0.000095090836,0.0010394616,0.0037500763,0.00046121885,0.000892622,0.00015189263,0.00006005601],"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.000008317303,0.00011227673,0.00043751343,0.000006701463,0.000002391872,0.0000041391204,0.0004924217,0.0000099223835,0.00017171401,0.9433865,0.00002257356,0.05534553],"study_design_scores_gemma":[0.00017492546,0.0004757421,0.002031561,0.000023987031,0.0000062048634,0.000015177927,0.000007592493,0.6040269,0.006518615,0.38645554,0.00010363052,0.0001601288],"about_ca_topic_score_codex":0.0000058049504,"about_ca_topic_score_gemma":0.0000026015891,"teacher_disagreement_score":0.80977744,"about_ca_system_score_codex":0.000036695663,"about_ca_system_score_gemma":0.00012172474,"threshold_uncertainty_score":0.99896115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3060548,0.000050375358,0.67758733,0.000024001192,0.0002922159,0.0006831136,0.000002725536,0.00028169987,0.015023759],"genre_scores_gemma":[0.99011976,0.000018005732,0.008918741,0.00004730818,0.00011055342,0.000012358325,0.00002326519,0.000023253711,0.00072677236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645096,0.00031133927,0.00023234797,0.0020306953,0.00017203379,0.000802613],"domain_scores_gemma":[0.99737334,0.00010672948,0.00027447235,0.00172955,0.0001574439,0.00035847604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072267203,0.00047782992,0.00051084853,0.0003376201,0.00018330407,0.00034789654,0.0040581855,0.0003389063,0.000004608237],"category_scores_gemma":[0.00008216144,0.00047507667,0.00020513598,0.0007518365,0.00013476245,0.0008661436,0.0036414315,0.0007183266,0.00003613658],"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.000054711825,0.00089178776,0.13850392,0.0003052016,0.00007267711,0.00011927659,0.0032631913,0.23491618,0.000025066205,0.61638594,0.000055660512,0.0054064076],"study_design_scores_gemma":[0.00055381574,0.00029154163,0.02147727,0.00024285019,0.000039590537,0.0000037887237,0.00064949295,0.91588706,0.000083956,0.059660107,0.00012529653,0.0009852572],"about_ca_topic_score_codex":0.00025473683,"about_ca_topic_score_gemma":0.00013956676,"teacher_disagreement_score":0.6840649,"about_ca_system_score_codex":0.00028233285,"about_ca_system_score_gemma":0.00015156824,"threshold_uncertainty_score":0.9997701},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23324887,0.00047526063,0.7526242,0.0003713721,0.001376689,0.00047147568,0.000018785533,0.00037548188,0.011037836],"genre_scores_gemma":[0.97118646,0.00000422507,0.026894875,0.000044760316,0.0002461969,0.00007145257,0.000014154538,0.00001027264,0.0015275793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985984,0.000051041272,0.00031649412,0.00043748968,0.00017316935,0.00042343856],"domain_scores_gemma":[0.99884486,0.00028129018,0.00012326837,0.0004921762,0.00014097035,0.00011741887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007495001,0.00016402421,0.00025768843,0.00008369815,0.00013576123,0.00028820394,0.00083782186,0.00012660163,0.000008353216],"category_scores_gemma":[0.00044020286,0.00012811685,0.00007002688,0.00038002638,0.0000467273,0.00032130769,0.00013046688,0.0002200261,0.000024877183],"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.00005884621,0.00032242326,0.25714576,0.00021463908,0.000037314265,0.00005205109,0.0021526683,0.0005742453,0.0028515938,0.7118663,0.01435928,0.010364892],"study_design_scores_gemma":[0.0020807711,0.00018173731,0.11296966,0.00020627632,0.000009193128,0.00006888319,0.00016376365,0.66074014,0.0009700012,0.0025452334,0.21929242,0.00077191973],"about_ca_topic_score_codex":0.00035982527,"about_ca_topic_score_gemma":0.0014550891,"teacher_disagreement_score":0.7379376,"about_ca_system_score_codex":0.000028676852,"about_ca_system_score_gemma":0.00007233197,"threshold_uncertainty_score":0.5224454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039854694,0.00009506036,0.92158306,0.00050795166,0.0014049339,0.00017152504,3.800727e-7,0.0003232509,0.03605912],"genre_scores_gemma":[0.85288435,0.000006966473,0.14646359,0.00036480342,0.00022248234,0.000002529563,3.5794787e-7,0.000007031323,0.00004785934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970188,0.000094960786,0.00031656216,0.000843772,0.00083101675,0.000894866],"domain_scores_gemma":[0.99768114,0.0006471374,0.00013421684,0.00070663827,0.0003904671,0.00044042716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037233618,0.00022832878,0.00026835644,0.0004725355,0.00054183486,0.0006399469,0.0022656268,0.000088277244,0.00002976741],"category_scores_gemma":[0.00048382604,0.00017550829,0.00008860996,0.002777651,0.0019179463,0.00095630705,0.00064746995,0.00027235385,0.0002360907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014956728,0.000068712725,0.00045653808,0.0000034003951,0.0000041366156,0.000018129776,0.00036519926,0.000012439129,0.0005460619,0.9444134,0.00006562383,0.054031406],"study_design_scores_gemma":[0.0013864443,0.001195788,0.06434476,0.00007597857,0.000031086725,0.00039952048,0.00005228146,0.39366725,0.024380231,0.50968057,0.0035966672,0.0011894306],"about_ca_topic_score_codex":0.000008948783,"about_ca_topic_score_gemma":0.0000036123904,"teacher_disagreement_score":0.8130297,"about_ca_system_score_codex":0.00012669327,"about_ca_system_score_gemma":0.00016480064,"threshold_uncertainty_score":0.71570206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007637916,0.004485798,0.98570937,0.00010421032,0.0010324065,0.00016921439,0.00014912615,0.00028645725,0.000425478],"genre_scores_gemma":[0.97104436,0.0005481895,0.027876306,0.000069067144,0.00023618339,0.000014959956,0.00010642942,0.000029795785,0.000074705466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983616,0.000055595698,0.00026746324,0.0007102315,0.0001354865,0.00046961536],"domain_scores_gemma":[0.9973345,0.00029898048,0.00004801573,0.0020647119,0.000023419147,0.000230394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005086358,0.00030144607,0.00028122414,0.00013090434,0.00027063713,0.00020512457,0.0015249249,0.00010397867,0.000018224167],"category_scores_gemma":[0.000034759898,0.00027139636,0.000034115863,0.00032739437,0.000047695303,0.0030185257,0.00013937833,0.00031986035,0.000054663582],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009376629,0.0031112314,0.001394221,0.0012932247,0.0006397944,0.000034124874,0.025900735,0.007223397,0.011888772,0.0289523,0.012311156,0.9071573],"study_design_scores_gemma":[0.001034534,0.0001571321,0.0008436706,0.00021668943,0.00011657397,0.00006887887,0.000074943826,0.7572511,0.0045200656,0.000035713238,0.23483032,0.0008503931],"about_ca_topic_score_codex":0.000012692464,"about_ca_topic_score_gemma":0.000012631066,"teacher_disagreement_score":0.96340644,"about_ca_system_score_codex":0.000027623728,"about_ca_system_score_gemma":0.000053413503,"threshold_uncertainty_score":0.99997383},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012144791,0.000037988666,0.94609,0.00028062024,0.00042548627,0.00023237393,0.0000014862071,0.00020758435,0.040579695],"genre_scores_gemma":[0.8419525,0.000021747861,0.1522574,0.00038575157,0.0002944977,0.000076838754,0.000042641284,0.0000068687673,0.004961771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913216,0.000031550077,0.00012294373,0.00035546705,0.000117779135,0.0002400884],"domain_scores_gemma":[0.9992801,0.00015620387,0.0000437831,0.00029882212,0.00014775663,0.00007336531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016923924,0.00009818125,0.00010717999,0.000051352,0.00015394046,0.00007697458,0.00030422493,0.000029034361,0.00011843995],"category_scores_gemma":[0.00022417273,0.000071641145,0.000055036286,0.00028024457,0.000039691055,0.000526697,0.00013911437,0.00004677255,0.00014875185],"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.000020230731,0.00015115821,0.0012794702,0.000004142333,0.000011386796,0.0000054067764,0.00036255273,0.0000041442536,0.00022528949,0.96426046,0.0034963945,0.030179389],"study_design_scores_gemma":[0.0026047695,0.0009201572,0.015303141,0.000032679272,0.000035024823,0.00020368058,0.0005398902,0.12184468,0.007530109,0.057354797,0.79271644,0.00091461337],"about_ca_topic_score_codex":0.000033639666,"about_ca_topic_score_gemma":0.0000636112,"teacher_disagreement_score":0.90690565,"about_ca_system_score_codex":0.000038715734,"about_ca_system_score_gemma":0.000056883895,"threshold_uncertainty_score":0.29214412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059273873,0.0011757197,0.93744344,0.00032559398,0.0006802361,0.00029464974,0.000049870225,0.00003503981,0.00072156993],"genre_scores_gemma":[0.92167425,0.00005311436,0.07778895,0.00013493502,0.0002677045,0.0000025396569,0.00006962181,0.0000060289685,0.0000028529641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988471,0.000038875318,0.00041901556,0.00030484196,0.00020408277,0.00018607215],"domain_scores_gemma":[0.9983719,0.0004763865,0.0005007482,0.00035415214,0.0001843729,0.00011243145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006762761,0.00014109859,0.00031313128,0.000095576725,0.00012977044,0.00015899252,0.00068375585,0.000051569954,0.0000014031326],"category_scores_gemma":[0.00022007,0.0000996366,0.00003995984,0.00014755821,0.000071521696,0.00037510105,0.00023854221,0.00016699443,0.0000033199074],"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.00043191298,0.0006596587,0.0006823666,0.00013963562,0.0005769355,0.0001260525,0.009563654,0.008196694,0.020181207,0.91702384,0.0044454164,0.037972637],"study_design_scores_gemma":[0.026904773,0.0030813115,0.010952703,0.0018411154,0.00095030357,0.0015384593,0.035639364,0.6217998,0.015884582,0.25705078,0.021307802,0.0030489794],"about_ca_topic_score_codex":0.00006803477,"about_ca_topic_score_gemma":0.000027101469,"teacher_disagreement_score":0.86240035,"about_ca_system_score_codex":0.000084199084,"about_ca_system_score_gemma":0.00015986181,"threshold_uncertainty_score":0.40630627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022136135,0.001003668,0.95771456,0.00067512185,0.00069218635,0.0010600502,0.0000010100127,0.00030713744,0.016410153],"genre_scores_gemma":[0.69881517,0.000037201,0.3004388,0.00019288722,0.00011349354,0.00010340246,0.000005377173,0.000009566267,0.0002840987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842554,0.00030168088,0.00029088976,0.00040215117,0.00016432852,0.0004153841],"domain_scores_gemma":[0.99699,0.001860851,0.0003517139,0.00040518452,0.00027209808,0.00012013989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050412216,0.00019090474,0.00024019113,0.00007290127,0.000270231,0.00028387882,0.00051740784,0.00016269529,0.000009115125],"category_scores_gemma":[0.003184022,0.00014565594,0.00009830386,0.00023963895,0.0002183441,0.0014089709,0.0001901031,0.0002917756,0.000009637207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014050498,0.00018408938,0.000056597088,0.000049878425,0.000018410448,0.000004033173,0.0008314827,4.3955134e-7,0.0018522274,0.6047624,0.000010009303,0.39208993],"study_design_scores_gemma":[0.00097331294,0.0016850706,0.00008963304,0.000043096035,0.00011725036,0.00041347014,0.0012469084,0.0013092627,0.0020521895,0.9026319,0.08901595,0.00042194678],"about_ca_topic_score_codex":0.000008319423,"about_ca_topic_score_gemma":0.000009387642,"teacher_disagreement_score":0.6766791,"about_ca_system_score_codex":0.000011071119,"about_ca_system_score_gemma":0.000051149673,"threshold_uncertainty_score":0.5939677},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7437488,0.10492033,0.04579108,0.02407059,0.044853013,0.0050220527,0.000050691837,0.0034066816,0.02813676],"genre_scores_gemma":[0.96241933,0.0034489343,0.01853308,0.001720873,0.009640944,0.00018238176,0.0001308894,0.00006842333,0.0038551602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977606,0.00022910019,0.0002695385,0.0009611805,0.0002990078,0.00048056495],"domain_scores_gemma":[0.9985775,0.000044275304,0.00015209372,0.00079223997,0.00014315988,0.00029073184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040953438,0.0003157958,0.00035819729,0.00004480579,0.00019909066,0.00017208951,0.0005737594,0.00010783893,0.00005173787],"category_scores_gemma":[0.00006945299,0.0002521137,0.00006219082,0.00014040241,0.00013060178,0.0011175319,0.00021462304,0.0002543471,0.00019999426],"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.00023336486,0.0008569754,0.0023320175,0.00021954904,0.00014913862,0.000045920573,0.007504552,0.00012738309,0.0047521093,0.5722338,0.33239505,0.07915018],"study_design_scores_gemma":[0.0014764732,0.0018979837,0.017986957,0.00006194794,0.00007909062,0.00027480428,0.00005309743,0.002661202,0.00079398666,0.007877271,0.96565515,0.0011820106],"about_ca_topic_score_codex":0.00023076397,"about_ca_topic_score_gemma":0.00021232081,"teacher_disagreement_score":0.63326013,"about_ca_system_score_codex":0.00019967486,"about_ca_system_score_gemma":0.00007871646,"threshold_uncertainty_score":0.9999931},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03148494,0.00079085224,0.96527,0.0007527042,0.0010521982,0.0002924153,0.0000031396735,0.000041401578,0.00031236376],"genre_scores_gemma":[0.69754404,0.0004849809,0.30090386,0.00012406253,0.00078465056,0.000036286874,0.0000044333055,0.000015210067,0.00010252186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987126,0.00005629108,0.00037040224,0.00022601597,0.00042749254,0.00020717634],"domain_scores_gemma":[0.99851567,0.00017024194,0.00041076302,0.00017047496,0.0006280848,0.000104741805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007457987,0.0001407906,0.0001743835,0.000113742324,0.00024451842,0.00023114534,0.00088463357,0.000047513695,0.0000068351073],"category_scores_gemma":[0.0001388352,0.00009055037,0.00009812335,0.000105472565,0.00010419721,0.0007422966,0.00011025043,0.00016169924,0.000002191875],"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.00012722825,0.0012028017,0.0043449164,0.000066983885,0.0007571996,0.0001692617,0.012318569,0.0055667767,0.0024635098,0.26949763,0.0010214385,0.7024637],"study_design_scores_gemma":[0.0013537476,0.00062519783,0.0032587464,0.00015006772,0.000042345997,0.0062841335,0.00026207077,0.95817554,0.0010270276,0.025756821,0.0028079255,0.000256381],"about_ca_topic_score_codex":0.000011589727,"about_ca_topic_score_gemma":0.000001585398,"teacher_disagreement_score":0.95260876,"about_ca_system_score_codex":0.0001217149,"about_ca_system_score_gemma":0.00011621722,"threshold_uncertainty_score":0.3692537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022075502,0.0017648874,0.9667163,0.00026384954,0.0006766903,0.0004257334,0.000004853607,0.0000434994,0.008028698],"genre_scores_gemma":[0.983274,0.00017719057,0.01612041,0.00025114111,0.00010533345,0.000005846734,7.51166e-7,0.000010286726,0.000055066605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981057,0.00005131729,0.00035099828,0.0006548896,0.000572634,0.0002644744],"domain_scores_gemma":[0.9981152,0.0005903979,0.00034331577,0.00058000855,0.00032018652,0.000050899256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046700815,0.00027694498,0.0003934293,0.0002947378,0.00019701714,0.00008607476,0.0011421698,0.00013378503,0.0000058473956],"category_scores_gemma":[0.00023464802,0.00017434859,0.00009222711,0.0002531465,0.0013967666,0.00018087785,0.000612398,0.00031312587,0.0000033992453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080633,0.00028328746,0.00037746943,0.00027757965,0.00007517182,0.00005264945,0.016564248,0.0018399073,0.005892997,0.78541285,0.00008630117,0.18905689],"study_design_scores_gemma":[0.0013508727,0.0025617804,0.0029975246,0.004476763,0.00006159273,0.0002820357,0.000005503064,0.14230135,0.31918722,0.524579,0.0004273926,0.0017689624],"about_ca_topic_score_codex":0.000040197203,"about_ca_topic_score_gemma":0.000039654464,"teacher_disagreement_score":0.96119845,"about_ca_system_score_codex":0.000053459677,"about_ca_system_score_gemma":0.00028667596,"threshold_uncertainty_score":0.71097296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10545456,0.0032871559,0.8269292,0.0018792745,0.00032450748,0.002264937,7.903252e-7,0.0003822388,0.05947733],"genre_scores_gemma":[0.9243308,0.000050677456,0.07517866,0.00009216335,0.000034146426,0.00014473444,0.000005450094,0.000007920621,0.00015545895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794716,0.0007775653,0.00028284654,0.00043789207,0.00020085256,0.00035368995],"domain_scores_gemma":[0.9980209,0.0009892159,0.0003273072,0.00036364805,0.00021049978,0.00008841317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025360638,0.0001810824,0.00024361463,0.00008978956,0.00013684924,0.00026175505,0.0003867737,0.00009190808,0.000015027269],"category_scores_gemma":[0.0007133224,0.00012461678,0.000042091415,0.0004391669,0.00027521784,0.0015167099,0.0001490585,0.00022027525,0.000030216801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018420785,0.0004100859,0.0007962462,0.00003936485,0.000022732074,0.000012165163,0.0020946201,0.000004271251,0.00024291595,0.6211054,0.00000396661,0.37508404],"study_design_scores_gemma":[0.0029410955,0.0048961523,0.0124901,0.0003491075,0.00018575281,0.00071343785,0.014963889,0.0029181808,0.0017766347,0.94735426,0.010123068,0.001288314],"about_ca_topic_score_codex":0.00009863941,"about_ca_topic_score_gemma":0.000013832788,"teacher_disagreement_score":0.8188762,"about_ca_system_score_codex":0.000023496124,"about_ca_system_score_gemma":0.00004720388,"threshold_uncertainty_score":0.5081725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007415333,0.0005579459,0.99339014,0.00056027144,0.001210022,0.0008712569,0.000054614367,0.0002518539,0.0030297174],"genre_scores_gemma":[0.14689171,0.000082454644,0.84694433,0.0022733295,0.0009391778,0.000059038146,0.00007805628,0.000089958536,0.0026419323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944458,0.000026614945,0.0008558014,0.0022415926,0.0013054676,0.0011247498],"domain_scores_gemma":[0.9963825,0.0008662218,0.00045886062,0.0011912382,0.00070956204,0.000391628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008006641,0.00086586317,0.0008852596,0.00057691644,0.0006151194,0.00034282779,0.0036517174,0.00060597056,0.000009211171],"category_scores_gemma":[0.00018844499,0.00078210735,0.0003761477,0.000518017,0.0008945516,0.0006104382,0.0010687108,0.0010124162,0.00007017376],"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.000022119993,0.00013152372,0.0000068058043,0.00007194293,0.000031187017,0.00008511911,0.0015802885,0.8955169,0.00005343475,0.017913923,0.001483344,0.083103426],"study_design_scores_gemma":[0.0007386437,0.00020122946,0.00003455797,0.00016808954,0.000012609674,0.00012472973,1.0690696e-7,0.9387012,0.0002397507,0.056938656,0.0019742013,0.00086623],"about_ca_topic_score_codex":0.00004368496,"about_ca_topic_score_gemma":0.00005826435,"teacher_disagreement_score":0.14681755,"about_ca_system_score_codex":0.00043423867,"about_ca_system_score_gemma":0.0018542614,"threshold_uncertainty_score":0.99946296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049556424,0.00042946517,0.8966206,0.00018921282,0.00040221118,0.0003663073,3.22199e-7,0.0011919632,0.0958443],"genre_scores_gemma":[0.4615759,0.0000033611198,0.5333117,0.00011498356,0.00015097662,0.00007280612,0.0000033772315,0.00000907846,0.0047577694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990144,0.000016568523,0.00018920134,0.0003447554,0.000106178675,0.00032892704],"domain_scores_gemma":[0.99939716,0.00006552795,0.000050187817,0.00033679095,0.000091808455,0.000058529753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002339881,0.00011508502,0.00013728382,0.00004199489,0.00013726357,0.00016689271,0.0003155224,0.00004856982,0.0000058279625],"category_scores_gemma":[0.000022274733,0.00009210945,0.00016435889,0.00014615347,0.00003349947,0.00022818276,0.00012887102,0.000048266367,0.000018854758],"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.000010384505,0.00034258456,0.00508766,0.00009387967,0.00004187997,0.000028767183,0.0006839578,0.00041332596,0.0006817148,0.91424924,0.014137478,0.064229116],"study_design_scores_gemma":[0.0018883653,0.0005962271,0.0031060693,0.00012661699,0.00003758938,0.00010770982,0.00026160816,0.67308223,0.009059407,0.01805717,0.29247546,0.0012015378],"about_ca_topic_score_codex":0.000090149835,"about_ca_topic_score_gemma":0.00010177951,"teacher_disagreement_score":0.8961921,"about_ca_system_score_codex":0.000037040616,"about_ca_system_score_gemma":0.000043840162,"threshold_uncertainty_score":0.37561142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021452181,0.02962647,0.92416084,0.00072056474,0.00033354305,0.00087165623,9.1144113e-7,0.00041340644,0.022420453],"genre_scores_gemma":[0.8729743,0.00018234493,0.12630184,0.00017413158,0.00015983451,0.00003288687,0.000004274857,0.000012476328,0.00015794241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974947,0.0008233932,0.00039112824,0.0005504954,0.00020281592,0.00053745724],"domain_scores_gemma":[0.997085,0.001850425,0.0004222284,0.0003815815,0.00013573848,0.00012503534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003766489,0.00027237667,0.00033926524,0.00009069207,0.00031362005,0.0003225193,0.00042985173,0.0001634318,0.0000067231904],"category_scores_gemma":[0.0007184548,0.00021726638,0.00006896337,0.00038078337,0.00038976906,0.0006663576,0.00036590802,0.00028220942,0.0000042097518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010107885,0.00019811602,0.001601396,0.000054479635,0.0000282474,0.000049861716,0.00039438432,0.000051420287,0.00011564015,0.61868554,0.000016311626,0.3787035],"study_design_scores_gemma":[0.0027609114,0.0034482814,0.0051600495,0.0002560006,0.00044800446,0.00259715,0.0027460633,0.009645984,0.0006651934,0.8379268,0.13240331,0.0019422246],"about_ca_topic_score_codex":0.00005990064,"about_ca_topic_score_gemma":0.0000107175,"teacher_disagreement_score":0.8515221,"about_ca_system_score_codex":0.000015714772,"about_ca_system_score_gemma":0.00003899661,"threshold_uncertainty_score":0.8859866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31754774,0.00064095086,0.66829336,0.0057736137,0.0012567877,0.00050225895,0.0000034846998,0.000058927766,0.0059228633],"genre_scores_gemma":[0.97849727,0.00015279803,0.02057031,0.00012051467,0.0004163936,0.00001516229,2.6992117e-7,0.000007950145,0.00021936286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823993,0.0002120937,0.0004321823,0.00021370208,0.0005000065,0.0004020547],"domain_scores_gemma":[0.997534,0.0002624381,0.00010948041,0.00027292458,0.0014697696,0.00035141423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020796128,0.00009520058,0.0001790149,0.0005780816,0.00036774107,0.00026387261,0.0008145066,0.00007287472,0.00008392804],"category_scores_gemma":[0.0007578477,0.00007701985,0.00006131023,0.0014482389,0.00011725938,0.0008580612,0.00027126676,0.0004975382,0.0001581478],"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.000087958484,0.0006015333,0.0015866463,0.00002086711,0.00004722409,0.0002542654,0.038814846,0.000016759977,0.007872105,0.43099564,0.0015165797,0.51818556],"study_design_scores_gemma":[0.0002462029,0.00799401,0.11088212,0.0007028527,0.00004892881,0.0014548715,0.010378225,0.056499463,0.24365874,0.52439487,0.04241305,0.0013266631],"about_ca_topic_score_codex":0.0001668603,"about_ca_topic_score_gemma":0.00016999367,"teacher_disagreement_score":0.66094947,"about_ca_system_score_codex":0.00006985158,"about_ca_system_score_gemma":0.00016946605,"threshold_uncertainty_score":0.31407785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131002385,0.00026920173,0.95113224,0.00006383874,0.00029495836,0.00010382191,7.065459e-7,0.00020662243,0.03482835],"genre_scores_gemma":[0.59235895,0.000020848927,0.40661207,0.00005651874,0.0000079752335,0.0000037641264,6.8287056e-7,0.000005424819,0.000933791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990329,0.00003110416,0.0001824133,0.0003733089,0.00013493824,0.0002453274],"domain_scores_gemma":[0.9993139,0.00010972137,0.00005667751,0.00037466997,0.00006116197,0.00008385326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020641978,0.00012623088,0.0001240457,0.00012733214,0.00019920668,0.000118900396,0.00042654318,0.00008199147,0.00011011311],"category_scores_gemma":[0.000052411193,0.00010046748,0.000041760537,0.0002738405,0.0000541647,0.00044144434,0.00031663108,0.00013639004,0.00019522588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031042198,0.000061155326,0.0013015505,0.0000033966003,0.000011452638,0.000021762655,0.0026238386,0.000003997899,0.000026510967,0.071418576,0.00016882678,0.9243558],"study_design_scores_gemma":[0.00023172345,0.000069106994,0.046490066,0.000041978383,0.000007702946,0.00007944351,0.000052442894,0.87616855,0.000012003719,0.076334506,0.0003191999,0.00019328238],"about_ca_topic_score_codex":0.00003165522,"about_ca_topic_score_gemma":0.00025750563,"teacher_disagreement_score":0.92416257,"about_ca_system_score_codex":0.00006384841,"about_ca_system_score_gemma":0.000049483515,"threshold_uncertainty_score":0.4096945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07306461,0.00068751903,0.91087824,0.00085284095,0.004700581,0.00010895057,0.0000017530859,0.000060947474,0.009644533],"genre_scores_gemma":[0.9897953,0.00010169324,0.008661092,0.00014383825,0.001082286,0.000002689384,9.785592e-7,0.0000087719945,0.00020330929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752766,0.000101449456,0.000890752,0.00025359873,0.0009100749,0.0003164783],"domain_scores_gemma":[0.99739283,0.00024304022,0.00058738515,0.0002657195,0.0013319376,0.00017905812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450754,0.00017444386,0.0002635465,0.00034753754,0.00010862198,0.00093957485,0.0020734514,0.00008017077,0.00006235111],"category_scores_gemma":[0.0007150588,0.00014573552,0.00021659955,0.00039127935,0.00006116352,0.0005469344,0.00015737108,0.0002802944,0.00023614582],"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.00009791301,0.00032423058,0.00046055586,0.0000033693136,0.000093552226,0.00056481076,0.0010274956,0.062275466,0.0013484178,0.59918946,0.0003911726,0.33422354],"study_design_scores_gemma":[0.00024925778,0.00077476865,0.0016112054,0.00055103214,0.000040230225,0.0043650717,0.0011907176,0.90392405,0.015791157,0.050998326,0.019760842,0.00074332964],"about_ca_topic_score_codex":0.000026165373,"about_ca_topic_score_gemma":0.0000065904096,"teacher_disagreement_score":0.9167307,"about_ca_system_score_codex":0.00018883716,"about_ca_system_score_gemma":0.00018923279,"threshold_uncertainty_score":0.9060342},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3314047,0.000013282881,0.64977676,0.000048507954,0.00008389908,0.00021629709,0.0000038850417,0.0000927885,0.018359894],"genre_scores_gemma":[0.96977913,0.000012287389,0.02935246,0.000059000315,0.000029959232,0.0000019460415,0.000009424235,0.000010659339,0.00074513705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885815,0.000027673512,0.00012659396,0.0004102635,0.00015784695,0.00041946408],"domain_scores_gemma":[0.9992116,0.0001520927,0.00007789587,0.00029508187,0.00014040638,0.00012290415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023180003,0.00016160592,0.00017339407,0.000552809,0.00025643746,0.000049916584,0.00052053784,0.00011444931,0.0000035230316],"category_scores_gemma":[0.000028615073,0.00015621351,0.00007389509,0.000969911,0.000059097994,0.0009641346,0.00014270353,0.00017028039,0.0000106090165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0002692681,0.0003347556,0.10104146,0.000033021326,0.000043999433,0.00021153134,0.0009662805,0.0016920232,0.00006267055,0.8875566,0.0010974782,0.006690907],"study_design_scores_gemma":[0.03238884,0.0033860968,0.024287626,0.000873049,0.00035321977,7.24615e-7,0.12054742,0.47181562,0.027355457,0.23669906,0.07676965,0.005523233],"about_ca_topic_score_codex":0.000071814444,"about_ca_topic_score_gemma":0.0287569,"teacher_disagreement_score":0.65085757,"about_ca_system_score_codex":0.00026139081,"about_ca_system_score_gemma":0.0001276147,"threshold_uncertainty_score":0.98896575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3958737,0.00044947572,0.49576366,0.00019887908,0.0002735362,0.0009905462,0.0000013300166,0.00049561553,0.105953254],"genre_scores_gemma":[0.8687025,0.000008655191,0.12973174,0.000061337516,0.0000066816974,0.0000706227,5.8154e-7,0.0000038367843,0.0014140675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933654,0.000016824573,0.000073057505,0.0002697369,0.0000816986,0.00022216115],"domain_scores_gemma":[0.9996205,0.00006591183,0.000031706055,0.0001428943,0.00006720395,0.00007177693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016964637,0.00009171649,0.00009719449,0.00003667931,0.00011729749,0.00017218958,0.00018775353,0.000031810865,0.000006764684],"category_scores_gemma":[0.000027174965,0.00005696073,0.000019935265,0.00017581524,0.000050601808,0.00024629108,0.000032616565,0.000038037615,0.0000027469794],"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.000006286873,0.000034316134,0.020487703,0.000022648204,0.000014944546,0.0000015977233,0.0010580487,7.4039997e-7,0.00001924929,0.95816565,0.00044650803,0.019742321],"study_design_scores_gemma":[0.004794551,0.005653414,0.023237506,0.00013509115,0.00007738605,0.00020531652,0.0018951275,0.0057075997,0.015573143,0.27267498,0.66815037,0.001895509],"about_ca_topic_score_codex":0.000012623641,"about_ca_topic_score_gemma":0.00008537766,"teacher_disagreement_score":0.68549067,"about_ca_system_score_codex":0.000005366084,"about_ca_system_score_gemma":0.00003836159,"threshold_uncertainty_score":0.2322791},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006058176,0.00051904604,0.6666213,0.00050116447,0.00024064472,0.00006884695,8.220675e-8,0.00029207754,0.3256986],"genre_scores_gemma":[0.83865327,0.0003426133,0.13183436,0.00084165594,0.0001444442,0.0000033214972,8.9894985e-7,0.0000055121945,0.028173938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933445,0.00002330369,0.000103235536,0.00022644817,0.00013556122,0.000177015],"domain_scores_gemma":[0.9994466,0.000033659966,0.000025705056,0.00037259178,0.00004483035,0.000076671095],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010335678,0.0000737458,0.00009270817,0.000031197145,0.00014642549,0.000032874377,0.0005110175,0.000036634345,0.00010289321],"category_scores_gemma":[0.00003218647,0.000051831972,0.000049918177,0.00016723276,0.000027078322,0.00022446374,0.00018165541,0.0000577706,0.0011190763],"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.0000032825155,0.0001381997,0.0033962273,0.0000090216545,0.000008443976,0.00009035768,0.0015919138,0.000020473275,0.0001296033,0.79303384,0.13933007,0.06224856],"study_design_scores_gemma":[0.0012329187,0.00038212287,0.03809234,0.00004082569,0.000005537801,0.00043588335,0.000027783899,0.041191842,0.001819834,0.017665457,0.89833695,0.00076849555],"about_ca_topic_score_codex":0.000013889297,"about_ca_topic_score_gemma":0.000003173996,"teacher_disagreement_score":0.8325951,"about_ca_system_score_codex":0.000012062245,"about_ca_system_score_gemma":0.000032579293,"threshold_uncertainty_score":0.99965864},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56824523,0.0011919409,0.124889225,0.095323116,0.0014714731,0.00029601416,0.0000046418695,0.00009452732,0.20848382],"genre_scores_gemma":[0.9963286,0.000021446183,0.0019390803,0.001432046,0.00025258132,9.281585e-7,2.123118e-7,0.0000024302058,0.0000226871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916893,0.00013924316,0.00023850736,0.0001157456,0.00023693206,0.00010062147],"domain_scores_gemma":[0.9991026,0.00031847728,0.00022083084,0.00016150018,0.000109527486,0.000087043154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059489516,0.00007894911,0.00012445352,0.000049048693,0.00010810046,0.000034935652,0.00040933266,0.000065115724,0.000096065596],"category_scores_gemma":[0.00026583337,0.00004094318,0.000077209,0.00009283896,0.00010626469,0.00023005345,0.000083619605,0.00031789203,0.000033244203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018247893,0.000086480424,0.0009062122,0.000002048889,0.000012226651,0.00004880941,0.00016661451,0.0000019789609,0.00005171425,0.99809563,0.00028064832,0.00032935958],"study_design_scores_gemma":[0.00017750234,0.00037948455,0.0674885,0.000016689703,0.00000660128,0.00020799377,0.000003238421,0.00049608,0.000060862138,0.93100077,0.000109795925,0.00005249775],"about_ca_topic_score_codex":8.831715e-7,"about_ca_topic_score_gemma":1.5228649e-7,"teacher_disagreement_score":0.42808333,"about_ca_system_score_codex":0.000020045607,"about_ca_system_score_gemma":0.000026950129,"threshold_uncertainty_score":0.16696145},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110424375,0.0005592517,0.9803291,0.0007364479,0.00003993015,0.0007559055,0.0000046961745,0.00012301859,0.0064091934],"genre_scores_gemma":[0.66886556,0.00006502579,0.3307571,0.00019648168,0.000018281708,0.000025662137,0.000009719033,0.000005817638,0.00005631245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986306,0.00021919707,0.0003277468,0.00032186147,0.00016747127,0.0003331568],"domain_scores_gemma":[0.9978802,0.0009198694,0.0004859722,0.00032491225,0.00029797468,0.000091031216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019894068,0.00018319424,0.00031992336,0.00006910827,0.00016160638,0.000110239234,0.0003531287,0.000092120594,0.0000023018774],"category_scores_gemma":[0.00053761905,0.0001339542,0.00006377524,0.00028749727,0.00028126992,0.00084103656,0.00007098726,0.00014815018,6.67314e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024931665,0.00048226633,0.000050802628,0.000095983705,0.000041528838,0.000006745801,0.0015299743,0.000043263524,0.0008015021,0.8674662,0.0000019457798,0.12923042],"study_design_scores_gemma":[0.0015938999,0.0047498513,0.00013537296,0.00026642994,0.00029279536,0.0004127726,0.0017681743,0.036817502,0.0033598084,0.9464263,0.0035507497,0.0006263899],"about_ca_topic_score_codex":0.0000019574359,"about_ca_topic_score_gemma":6.882073e-7,"teacher_disagreement_score":0.65782315,"about_ca_system_score_codex":0.000009834886,"about_ca_system_score_gemma":0.00012550889,"threshold_uncertainty_score":0.5462494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006525822,0.001941961,0.92475045,0.00017829354,0.0009773792,0.00034756097,9.1010793e-7,0.0006200492,0.064657584],"genre_scores_gemma":[0.9163745,0.00006791189,0.055842225,0.00014997074,0.00024846196,0.000057477497,0.000004183503,0.000013339744,0.02724193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986173,0.00006865701,0.00019984439,0.0004681974,0.00024270083,0.00040331567],"domain_scores_gemma":[0.9991403,0.00006727157,0.00008047686,0.00044160674,0.0001397246,0.0001305828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022149252,0.00016438145,0.0001987327,0.00005702772,0.00028228076,0.00020285594,0.00068541506,0.00008154871,0.000014265267],"category_scores_gemma":[0.00003864891,0.00012284052,0.0000679463,0.0003626355,0.00009610496,0.0005231597,0.0001833144,0.0001276147,0.00031846555],"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.0000047146523,0.00025215655,0.002755327,0.000031462747,0.000039523416,0.00012826911,0.001893651,0.000014499188,0.00036881355,0.9531215,0.03289156,0.008498513],"study_design_scores_gemma":[0.00342367,0.0021175952,0.0036439858,0.00018981127,0.000052043208,0.004181884,0.0021527463,0.09073348,0.0030214975,0.03464697,0.85210764,0.003728698],"about_ca_topic_score_codex":0.00020212009,"about_ca_topic_score_gemma":0.00001052443,"teacher_disagreement_score":0.91847456,"about_ca_system_score_codex":0.00006807375,"about_ca_system_score_gemma":0.000052457417,"threshold_uncertainty_score":0.5009291},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3993335,0.0004989806,0.010711886,0.00038162313,0.00017640396,0.00015268532,0.0000016369172,0.00033447798,0.58840877],"genre_scores_gemma":[0.98896396,0.00015613818,0.0035543367,0.00033878683,0.000054071243,0.000011981494,0.0000032120988,0.0000026015982,0.0069148988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993404,0.000018607017,0.00016248395,0.00014913207,0.00011625498,0.00021307987],"domain_scores_gemma":[0.9995909,0.000026507363,0.000043334276,0.00024032408,0.00004128028,0.00005770967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017619738,0.000097674565,0.00009800442,0.000042952914,0.00014631348,0.00020131789,0.00031771747,0.000058475795,0.00008753394],"category_scores_gemma":[0.00002488059,0.00007353312,0.000027726988,0.0001338607,0.0000746486,0.0008419613,0.000096690506,0.000074712225,0.00029075006],"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.0000101680125,0.000020826577,0.00096459006,0.000022643291,0.000007443409,0.000004788493,0.005128448,0.000044421355,0.000044943157,0.7554681,0.00031781933,0.23796584],"study_design_scores_gemma":[0.0019452712,0.001234652,0.25980276,0.000072384,0.000025898893,0.0005412107,0.0011958932,0.061693814,0.0026699265,0.18371865,0.48536488,0.0017346626],"about_ca_topic_score_codex":0.000023922554,"about_ca_topic_score_gemma":0.0000051294573,"teacher_disagreement_score":0.5896304,"about_ca_system_score_codex":0.000011896438,"about_ca_system_score_gemma":0.000025116524,"threshold_uncertainty_score":0.3737101},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003658929,0.000008916658,0.8445096,0.003383558,0.00072474306,0.00019469857,0.000014178632,0.00015973226,0.14734562],"genre_scores_gemma":[0.9904397,0.000040468236,0.0075320723,0.0013533954,0.00010463147,0.000019404757,0.00010906299,0.0000023615996,0.00039890892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989879,0.000016992208,0.00031664985,0.00016219981,0.00034171305,0.00017453132],"domain_scores_gemma":[0.99889797,0.000044497152,0.00013507437,0.00021100818,0.0006500851,0.000061368926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027116097,0.00012216385,0.00010685695,0.00017203637,0.00014345939,0.0003638734,0.00070275314,0.00007010441,0.00008809611],"category_scores_gemma":[0.00013180301,0.00010973185,0.00006499026,0.00010686285,0.000010701916,0.0015442593,0.00007734372,0.00009497355,0.00023018107],"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.000031231077,0.000033819786,0.0000444489,0.000004019744,0.0000045656193,3.5029356e-7,0.00044153584,0.001151536,0.00010640539,0.89484507,0.0010897487,0.10224729],"study_design_scores_gemma":[0.0003761897,0.00014654732,0.00066975155,0.000031531148,7.868206e-7,0.0000049124615,0.000026294894,0.95200056,0.00017523654,0.035093773,0.011325781,0.0001486343],"about_ca_topic_score_codex":0.000009744815,"about_ca_topic_score_gemma":0.0000050567705,"teacher_disagreement_score":0.98678076,"about_ca_system_score_codex":0.00006687508,"about_ca_system_score_gemma":0.000077581506,"threshold_uncertainty_score":0.4474735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4408391,0.00020174216,0.5583327,0.0000025009106,0.0001329118,0.00011414946,0.00000385364,0.00020077996,0.00017225172],"genre_scores_gemma":[0.7225829,0.000005426698,0.27733862,0.000008976709,0.000025056086,0.000005386546,0.000016127738,0.000011295008,0.000006209309],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985138,0.000025364492,0.00048677076,0.0002752252,0.00034371426,0.00035510358],"domain_scores_gemma":[0.9990361,0.00025010036,0.00020122855,0.00031557024,0.00008024378,0.00011676129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005426202,0.00019132029,0.00037520978,0.00017989354,0.000056481666,0.000038244903,0.0005262007,0.00008033033,0.000014177979],"category_scores_gemma":[0.00008512422,0.00018157913,0.00010823698,0.0003490286,0.000055261673,0.000292261,0.00022526362,0.00013937501,0.000006075081],"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.00019283939,0.006033482,0.14406787,0.0077457987,0.0011185342,0.0002688148,0.023345321,0.067161754,0.36891377,0.21839443,0.00054130773,0.16221608],"study_design_scores_gemma":[0.0026357565,0.000658645,0.206607,0.0014821569,0.000062735104,0.00022774328,0.0004730022,0.66469586,0.12099493,0.0004988736,0.0003958867,0.0012673843],"about_ca_topic_score_codex":0.000018027285,"about_ca_topic_score_gemma":4.2566e-7,"teacher_disagreement_score":0.5975341,"about_ca_system_score_codex":0.0000966493,"about_ca_system_score_gemma":0.000018920033,"threshold_uncertainty_score":0.74045825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04385709,0.00043239834,0.9506921,0.0033283525,0.00026815734,0.00028472484,7.555474e-7,0.00012632825,0.0010100659],"genre_scores_gemma":[0.9338564,0.000032380816,0.06540912,0.0004578925,0.00018661754,0.000034846318,5.893302e-7,0.000007895017,0.000014208214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974427,0.00007573452,0.00027330578,0.0008128818,0.00030393823,0.001091435],"domain_scores_gemma":[0.99847686,0.0006344407,0.000043553195,0.00052694627,0.00010742915,0.0002107504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015004622,0.00019517317,0.00021763369,0.00019446197,0.00038289826,0.00030671625,0.0013898708,0.000072559786,0.000012507914],"category_scores_gemma":[0.00024374927,0.00016308793,0.000066852874,0.00078829937,0.0013158267,0.0005872134,0.0005435918,0.00029091752,0.000023596065],"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.0000052295204,0.000050799117,0.000078271936,0.000005562332,0.0000029010985,0.0000012473863,0.00033436716,0.00012936069,0.0005833266,0.91636467,0.000010865684,0.0824334],"study_design_scores_gemma":[0.00039522717,0.00028621682,0.00035152238,0.000019622146,0.000004105259,0.00008692311,0.000002339398,0.6631679,0.008254357,0.3261124,0.0010814938,0.00023787015],"about_ca_topic_score_codex":0.0000049915857,"about_ca_topic_score_gemma":0.00002726134,"teacher_disagreement_score":0.8899994,"about_ca_system_score_codex":0.00039106008,"about_ca_system_score_gemma":0.00036374127,"threshold_uncertainty_score":0.66505325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029548043,0.0007160174,0.90554863,0.0012584486,0.0009577727,0.0007120327,0.0000021895019,0.00040801524,0.060848866],"genre_scores_gemma":[0.9239183,0.000013784528,0.071767785,0.002495051,0.0006635074,0.000064256026,0.0000028227537,0.000022777,0.0010517151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976438,0.00008218674,0.00034842096,0.0007345994,0.00033334643,0.00085763476],"domain_scores_gemma":[0.9978688,0.00037808617,0.00011646073,0.001076274,0.0002251198,0.00033530215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015694133,0.00028943663,0.00028067207,0.00010076182,0.0005539895,0.0004286589,0.0020000997,0.00012543098,0.000030660918],"category_scores_gemma":[0.0002555467,0.00018192426,0.00016449203,0.0006354985,0.00009004331,0.000518888,0.00018040408,0.00020039617,0.00014614276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043235632,0.0001710244,0.0025389525,0.000025050107,0.000034010704,0.000031458207,0.004751696,0.00041254473,0.00042904896,0.9237652,0.003960744,0.06383707],"study_design_scores_gemma":[0.0064859376,0.0034502104,0.086380266,0.00048560565,0.00017552215,0.00036818365,0.003610648,0.3554419,0.0150436405,0.37023273,0.15339877,0.004926583],"about_ca_topic_score_codex":0.00003181691,"about_ca_topic_score_gemma":0.00014273856,"teacher_disagreement_score":0.89437026,"about_ca_system_score_codex":0.000081247614,"about_ca_system_score_gemma":0.000080968144,"threshold_uncertainty_score":0.74186563},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019864498,0.0034107368,0.9630431,0.0004367114,0.00034863097,0.00097504724,0.0000049562873,0.00009021385,0.011826132],"genre_scores_gemma":[0.9920586,0.0005422798,0.0015477979,0.000035124925,0.000065677865,0.00012363671,0.0000051014886,0.0000042482,0.005617539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993998,0.000038699927,0.000112390706,0.00021995767,0.00010170341,0.00012744183],"domain_scores_gemma":[0.99950266,0.00014859869,0.000060397386,0.00022031153,0.000024353687,0.00004370462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017857585,0.00006775143,0.000054531305,0.000016187425,0.00021440993,0.00015025708,0.00018828864,0.000026210559,0.000018634038],"category_scores_gemma":[0.00003529083,0.000043892527,0.00002189832,0.00003901204,0.00003334307,0.000107610336,0.000044712368,0.000027794576,0.00014251238],"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.00001956818,0.0004091939,0.0008891938,0.000062824096,0.00008585185,0.000004871757,0.029564591,0.000046235844,0.0022456504,0.25502172,0.015262642,0.69638765],"study_design_scores_gemma":[0.0013496345,0.00017651885,0.024182063,0.000027995102,0.000027100727,0.000012939881,0.004356346,0.79738855,0.0035005743,0.00023807849,0.16838506,0.00035515823],"about_ca_topic_score_codex":0.000009491261,"about_ca_topic_score_gemma":0.0000025158654,"teacher_disagreement_score":0.9721941,"about_ca_system_score_codex":0.00002971411,"about_ca_system_score_gemma":0.000002396403,"threshold_uncertainty_score":0.18317558},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0315879,0.0003187823,0.6697761,0.00005987508,0.00021640613,0.00013515331,0.0000014336254,0.0005107054,0.29739365],"genre_scores_gemma":[0.8679722,0.000067406734,0.12591031,0.0002984735,0.00014928903,0.000025692469,0.000003490586,0.000017061337,0.0055561084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815166,0.0001260052,0.000282311,0.0007206826,0.00022165135,0.0004976921],"domain_scores_gemma":[0.99856323,0.00015741555,0.0000881613,0.00072768214,0.00029437186,0.00016915948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022445995,0.00028499457,0.000295502,0.00008829036,0.00036913302,0.00011102863,0.0010166363,0.00010763591,0.000055751898],"category_scores_gemma":[0.00015077519,0.00021563462,0.0001284136,0.00047672572,0.00014071565,0.0018776702,0.00034072326,0.00024070583,0.0002070909],"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.000010955222,0.0007543184,0.00066117494,0.000011854892,0.000025709745,0.00004252639,0.036799587,0.00029261317,0.00087426254,0.94283044,0.0024597857,0.015236767],"study_design_scores_gemma":[0.0005772796,0.00036773903,0.001730057,0.00002913748,0.000008523907,0.00013912693,0.00045948726,0.9424717,0.007950956,0.043915223,0.0017950598,0.0005557069],"about_ca_topic_score_codex":0.00015266746,"about_ca_topic_score_gemma":0.00032151054,"teacher_disagreement_score":0.9421791,"about_ca_system_score_codex":0.00009223449,"about_ca_system_score_gemma":0.00031509536,"threshold_uncertainty_score":0.8793324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011709118,0.00077926577,0.99138427,0.00034656932,0.0005364772,0.0006025063,0.0000024896879,0.00029684402,0.004880685],"genre_scores_gemma":[0.9354587,0.0000120933755,0.060133144,0.00054104865,0.00010984291,0.00010093935,0.0000023408409,0.000011370674,0.0036305161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989049,0.000042921834,0.00020406916,0.00032466865,0.00014092965,0.00038251985],"domain_scores_gemma":[0.9992393,0.00008343859,0.0000647023,0.00037477378,0.00008719112,0.00015054297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002808095,0.00012848694,0.00019764387,0.000040830597,0.00013317511,0.00018229987,0.0005941731,0.00006267111,0.0000073905653],"category_scores_gemma":[0.0000807339,0.00009425536,0.00010838515,0.00011933271,0.000023766454,0.00013535433,0.00006208078,0.000049898048,0.00011074491],"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.000025896681,0.00023753065,0.00036993338,0.000040695526,0.000049556595,0.000012803508,0.0010632707,0.0020415694,0.0004701994,0.98821986,0.00448542,0.0029832702],"study_design_scores_gemma":[0.022484614,0.00037473673,0.0013518678,0.000082943574,0.000040611027,0.00006232907,0.00022007132,0.48045108,0.003068532,0.0030646522,0.48804167,0.0007569153],"about_ca_topic_score_codex":0.000075312215,"about_ca_topic_score_gemma":0.000025460417,"teacher_disagreement_score":0.9851552,"about_ca_system_score_codex":0.00008553248,"about_ca_system_score_gemma":0.00006601602,"threshold_uncertainty_score":0.3843622},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073956093,0.0034355284,0.23396221,0.042797454,0.0020001484,0.0010156223,0.0000024127773,0.0008107002,0.7085803],"genre_scores_gemma":[0.9949381,0.00004408654,0.0019778437,0.0018622844,0.00061059475,0.0000339043,0.0000017055322,0.00001155021,0.00051993295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985433,0.0002416747,0.00022199075,0.00038005033,0.00028619808,0.00032677397],"domain_scores_gemma":[0.9982675,0.00033374332,0.00010385476,0.0010347195,0.00014012403,0.00012011061],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047019785,0.00018814119,0.00020058114,0.000057147954,0.00034278672,0.0002841113,0.001817844,0.000056063272,0.00014652257],"category_scores_gemma":[0.0000757729,0.00011036568,0.00013134819,0.00031062806,0.00011467479,0.00044755128,0.0005195682,0.00022590412,0.0030144562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019993945,0.000059692204,0.00009149728,0.00000950555,0.000013369448,0.0000027889366,0.00052378135,0.0000047694098,0.000066069704,0.9557617,0.013638713,0.02982614],"study_design_scores_gemma":[0.00023123629,0.000073327115,0.0035018942,0.000037546877,0.0000074627865,0.000014906525,0.000014367707,0.0062821168,0.00023142043,0.9422423,0.04713979,0.00022357986],"about_ca_topic_score_codex":0.00001689524,"about_ca_topic_score_gemma":9.424019e-7,"teacher_disagreement_score":0.9875425,"about_ca_system_score_codex":0.000029831299,"about_ca_system_score_gemma":0.000030004428,"threshold_uncertainty_score":0.9977618},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44268516,0.00017107042,0.5381221,0.0047030207,0.0026880365,0.0006675034,0.0000019894546,0.0002274638,0.010733656],"genre_scores_gemma":[0.99767697,0.000009787212,0.0011854839,0.0007265732,0.00029864092,0.000049738825,0.000002783222,0.000004664841,0.00004536713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988641,0.00009248611,0.00024553252,0.00030436847,0.00020936172,0.0002841469],"domain_scores_gemma":[0.9991615,0.00015807393,0.00006136795,0.00046428962,0.00010455638,0.00005024394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069186947,0.0001146697,0.0000976463,0.00008918031,0.00015379561,0.00025071984,0.0009813224,0.00008206977,0.00006184946],"category_scores_gemma":[0.00020668715,0.00008036628,0.000042714742,0.0007529966,0.00007322735,0.00042216192,0.00010566778,0.00029919134,0.0006185859],"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.0000035184921,0.0001227938,0.0005311249,0.000002535634,0.0000018367408,0.000018385412,0.017077604,0.0000126434,0.003563885,0.6974657,0.00006758366,0.28113237],"study_design_scores_gemma":[0.00007535872,0.0002841499,0.021512302,0.000038290134,0.00001056482,0.000060671387,0.0007395741,0.6804764,0.08604488,0.20070465,0.009349379,0.00070375233],"about_ca_topic_score_codex":0.0004043483,"about_ca_topic_score_gemma":0.0036247068,"teacher_disagreement_score":0.6804638,"about_ca_system_score_codex":0.0000152567945,"about_ca_system_score_gemma":0.000036692443,"threshold_uncertainty_score":0.79508764},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001331412,0.00078018365,0.28215963,0.0027836685,0.00055376324,0.00022167766,1.1119825e-7,0.00078441034,0.71138513],"genre_scores_gemma":[0.78089195,0.0000942718,0.13792194,0.00072959345,0.00019230858,0.000045709545,0.0000011490938,0.000011661519,0.08011143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989324,0.000022729215,0.00013245823,0.00039601768,0.00015964483,0.00035673368],"domain_scores_gemma":[0.99917656,0.00003034864,0.00003660483,0.0005590522,0.0000877297,0.0001097243],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013024602,0.00012249305,0.000118967706,0.000047476515,0.00016513614,0.00019949437,0.00074219063,0.00006426758,0.0008062714],"category_scores_gemma":[0.00004580958,0.00008737154,0.00005857637,0.00053602824,0.000044768134,0.0002856464,0.00020560036,0.00008905423,0.00215862],"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.0000013310515,0.00063514523,0.00237713,0.000023959461,0.000020943346,0.00003983661,0.0021250818,0.00003632565,0.000036118512,0.7812855,0.069601126,0.14381748],"study_design_scores_gemma":[0.00082678674,0.00055451377,0.0013779748,0.00003437689,0.000010447182,0.000116737916,0.00007931021,0.3758009,0.0005809494,0.042346843,0.5774937,0.000777443],"about_ca_topic_score_codex":0.000032560154,"about_ca_topic_score_gemma":0.00004363066,"teacher_disagreement_score":0.7795605,"about_ca_system_score_codex":0.000022123482,"about_ca_system_score_gemma":0.000012674515,"threshold_uncertainty_score":0.9986183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009273721,0.0005803616,0.8225567,0.00013494611,0.0005944644,0.00031091494,0.000002303931,0.0005630568,0.16598356],"genre_scores_gemma":[0.86309195,0.00000270451,0.12817201,0.00017755706,0.00021567853,0.000020074434,9.244864e-7,0.000020187486,0.008298938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856216,0.000058276062,0.00024118918,0.00047358774,0.00016900412,0.0004957927],"domain_scores_gemma":[0.9989478,0.0001394483,0.00010496867,0.0005295052,0.00014082962,0.0001374234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033626688,0.00019876122,0.00024391699,0.00009941672,0.0003024539,0.00026973392,0.00070963363,0.00009648338,0.00024166501],"category_scores_gemma":[0.00006861821,0.00015534672,0.00012813101,0.0003930811,0.00003944489,0.00042753934,0.00017513668,0.0000971956,0.00014915653],"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.0000035837963,0.000052340558,0.00018110823,0.00006504964,0.000033560264,0.000011269078,0.0014077766,0.00003847051,0.0005966944,0.98830163,0.002706425,0.0066021066],"study_design_scores_gemma":[0.0006328626,0.00008039157,0.000062315856,0.000074940755,0.000015453652,0.0001761961,0.00018472776,0.9864447,0.0023594857,0.0019349478,0.0076757926,0.00035816824],"about_ca_topic_score_codex":0.000022607723,"about_ca_topic_score_gemma":0.000012686599,"teacher_disagreement_score":0.98640627,"about_ca_system_score_codex":0.00009601555,"about_ca_system_score_gemma":0.000037077923,"threshold_uncertainty_score":0.63348556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5222778,0.0000234918,0.47643968,0.00093420653,0.000029912062,0.000109797926,0.0000022252489,0.0000048178917,0.0001780661],"genre_scores_gemma":[0.9839255,0.00003797364,0.015744025,0.0002676992,0.000011931964,0.0000055965643,8.869061e-7,0.000002983065,0.0000033660797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992611,0.000032918513,0.0003414968,0.00012790761,0.00013016813,0.00010641387],"domain_scores_gemma":[0.9992028,0.0003642349,0.0001337467,0.00019771146,0.000074983145,0.000026545033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060501834,0.00007071069,0.00012534858,0.000059000715,0.000042028412,0.000034663703,0.0002529116,0.000029282935,0.000023695418],"category_scores_gemma":[0.000185147,0.00004897867,0.000027966345,0.0001953771,0.00004810767,0.00007957594,0.00008563816,0.000049232425,0.000016540449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041683534,0.000117164265,0.000029063305,0.000008562523,0.000005414783,6.223978e-7,0.009968369,0.00049824076,0.0012689895,0.9438589,0.000020123367,0.044220373],"study_design_scores_gemma":[0.000011999352,0.000103606246,0.00021642349,0.000044936016,0.0000018872611,3.0670125e-7,0.00075547,0.002920898,0.22471638,0.7711772,0.000006475052,0.000044469394],"about_ca_topic_score_codex":0.000074095056,"about_ca_topic_score_gemma":0.00018971418,"teacher_disagreement_score":0.46164775,"about_ca_system_score_codex":0.000004734395,"about_ca_system_score_gemma":0.000022388143,"threshold_uncertainty_score":0.19972922},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017159378,0.0015555094,0.94208467,0.00022095189,0.0021617976,0.0001998132,0.000003043867,0.000050136176,0.03656469],"genre_scores_gemma":[0.9946333,0.00015944001,0.004778855,0.00009806546,0.00015104984,0.000002976572,0.0000017927885,0.00000364816,0.00017086447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980487,0.000094355244,0.0011174523,0.0000737167,0.00045610694,0.0002096661],"domain_scores_gemma":[0.9985502,0.00011743811,0.0006594578,0.00024192137,0.00030630565,0.0001246982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010125338,0.00011721179,0.00025515282,0.00041164964,0.000053072265,0.00028242363,0.0005696918,0.000050276532,0.000039250637],"category_scores_gemma":[0.00033197884,0.00008693379,0.00009403983,0.00036227563,0.00002404902,0.0030181347,0.00008288038,0.00022723133,0.0003484142],"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.00007090538,0.000593298,0.031007577,0.00034742276,0.00012211294,0.000185486,0.03338803,0.008036057,0.0000617045,0.749228,0.04711789,0.12984149],"study_design_scores_gemma":[0.0010300787,0.00041168524,0.0011513885,0.00094175735,0.000012790031,0.0025198867,0.002874444,0.5208667,0.001019994,0.00030716232,0.4683966,0.00046749503],"about_ca_topic_score_codex":0.000028666578,"about_ca_topic_score_gemma":0.0000032206074,"teacher_disagreement_score":0.9774739,"about_ca_system_score_codex":0.00012320139,"about_ca_system_score_gemma":0.0000447191,"threshold_uncertainty_score":0.4478276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032583386,0.00008305204,0.95127255,0.003121957,0.00021440435,0.00046639977,0.000004057515,0.00017329067,0.012080936],"genre_scores_gemma":[0.9809843,0.00006845891,0.017908096,0.00027942317,0.0000856669,0.000056407956,0.0000025222434,0.0000070389324,0.00060813874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866164,0.000085762185,0.0003446454,0.00040553056,0.00017659835,0.0003258312],"domain_scores_gemma":[0.9991424,0.00015583834,0.00007906124,0.0003787277,0.00013120679,0.000112736874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060256897,0.00014423169,0.00011967769,0.00008240565,0.00051796756,0.00036415167,0.000519487,0.000048852144,0.0001358103],"category_scores_gemma":[0.00013190352,0.000104207356,0.000045727553,0.00063444907,0.00019204328,0.00043933265,0.000089691865,0.00018966466,0.00074023724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006379736,0.00004010528,0.000020137817,0.0000030368426,0.000005934851,8.9986327e-7,0.0053598415,0.00021241956,0.0011747429,0.1706526,0.00014039458,0.8223835],"study_design_scores_gemma":[0.00008465033,0.0005461776,0.0014478897,0.0001416946,0.000030765757,0.00010105763,0.0022864528,0.5476993,0.06418791,0.3396098,0.042988826,0.00087547686],"about_ca_topic_score_codex":0.00015756734,"about_ca_topic_score_gemma":0.00046510567,"teacher_disagreement_score":0.94840086,"about_ca_system_score_codex":0.000057224253,"about_ca_system_score_gemma":0.00007654669,"threshold_uncertainty_score":0.9514499},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27817586,0.0027560715,0.106916785,0.0027646252,0.0018999026,0.0008449342,0.000009534797,0.00058167434,0.6060506],"genre_scores_gemma":[0.9920362,0.000018186522,0.007027506,0.0004142502,0.00022883857,0.000040657942,0.0000030492083,0.00000376533,0.00022754949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99865323,0.00013417806,0.00018453223,0.00030489312,0.00022665845,0.0004965062],"domain_scores_gemma":[0.99936116,0.00011059765,0.000058662736,0.00029562088,0.00005296763,0.00012099528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051252055,0.00014577033,0.00019123656,0.00005813535,0.00013678377,0.000049462014,0.00052739,0.00007861669,0.000095601805],"category_scores_gemma":[0.00010483825,0.00010311467,0.0000657596,0.00032012566,0.00007438779,0.00037921726,0.00037970187,0.00016568106,0.0003865603],"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.0000072866987,0.0006007858,0.06284819,0.000008156733,0.000013297717,0.000014999483,0.0020938257,0.0000076003817,0.00013323693,0.930357,0.0011167701,0.0027988774],"study_design_scores_gemma":[0.00057532685,0.00017249925,0.9193905,0.000010744138,0.0000063281263,0.00002897673,0.000111832356,0.00035912788,0.00023658997,0.07294692,0.0057929424,0.00036820563],"about_ca_topic_score_codex":0.000016009442,"about_ca_topic_score_gemma":0.000015404845,"teacher_disagreement_score":0.8574101,"about_ca_system_score_codex":0.000082091574,"about_ca_system_score_gemma":0.00006985756,"threshold_uncertainty_score":0.49685797},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01952865,0.000068474306,0.32144713,0.000060717073,0.0008437082,0.00022173503,0.0000011296352,0.00042207498,0.6574064],"genre_scores_gemma":[0.9804689,0.000007113315,0.01702367,0.00055678893,0.00008208888,0.000037397782,9.966138e-7,0.0000043252285,0.001818718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99902236,0.000016170578,0.00020347921,0.00020603664,0.00017691575,0.00037505166],"domain_scores_gemma":[0.999272,0.000032701675,0.00006080047,0.00036801587,0.00008217509,0.00018429673],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019208615,0.0001292627,0.000117068455,0.000120839824,0.00018803342,0.00011456953,0.0007729371,0.00007348313,0.00010373221],"category_scores_gemma":[0.00010391708,0.000101206824,0.00006982807,0.00032844365,0.000026420783,0.000734939,0.00043600614,0.00013461204,0.000952532],"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.00002457262,0.00023450877,0.017765027,0.000027461958,0.000039394145,0.000059486672,0.026837956,0.00014318264,0.00017084085,0.8222068,0.0022645013,0.13022625],"study_design_scores_gemma":[0.002240613,0.0032849214,0.5752716,0.00012714993,0.00006298812,0.00071800343,0.0018514062,0.009367492,0.026969844,0.07548561,0.3015402,0.003080139],"about_ca_topic_score_codex":0.00008335272,"about_ca_topic_score_gemma":0.000076271695,"teacher_disagreement_score":0.96094024,"about_ca_system_score_codex":0.000033284257,"about_ca_system_score_gemma":0.0000631204,"threshold_uncertainty_score":0.99982536},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04546193,0.7175482,0.18362252,0.0065272055,0.00087030017,0.00668136,0.000015918095,0.00020041544,0.039072182],"genre_scores_gemma":[0.9698887,0.022492547,0.0067311735,0.00048007898,0.00006734139,0.0001426638,0.0000021931862,0.000011950085,0.00018337845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998327,0.00021227603,0.0005626407,0.0002882985,0.00024297519,0.00036678987],"domain_scores_gemma":[0.99791425,0.00052369887,0.00040113783,0.00079928746,0.00029494127,0.00006669361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012176759,0.0001874291,0.0007731751,0.00013131867,0.00006103583,0.000025470994,0.001492255,0.000052368956,0.000060944836],"category_scores_gemma":[0.00038340362,0.000106990075,0.00022523337,0.0010956321,0.000112317495,0.00016847112,0.00025487953,0.00010600471,0.00006513482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000462354,0.0002651254,0.0019349549,0.009649805,0.00007292467,0.0000024530375,0.00075142813,0.000028518803,0.0005521053,0.9116104,0.00298882,0.07213881],"study_design_scores_gemma":[0.008148315,0.0035017047,0.32081538,0.04151319,0.0010814682,0.00042203264,0.0010056943,0.063241586,0.0120476065,0.45889804,0.08490536,0.00441963],"about_ca_topic_score_codex":0.00010187847,"about_ca_topic_score_gemma":0.0000066909374,"teacher_disagreement_score":0.92442673,"about_ca_system_score_codex":0.00003476791,"about_ca_system_score_gemma":0.00007710767,"threshold_uncertainty_score":0.4362929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042271473,0.0017611625,0.85396016,0.0007073128,0.00082364044,0.00033591047,5.851641e-7,0.00019263351,0.09994715],"genre_scores_gemma":[0.9881454,0.000032721586,0.010518706,0.00029102268,0.00013396777,0.0000094979905,0.0000013445555,0.000004677628,0.0008626385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905556,0.000113404385,0.0001621357,0.00026607845,0.00018146093,0.00022135579],"domain_scores_gemma":[0.99926764,0.00022425389,0.000077087236,0.00029198354,0.000064198764,0.00007481144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013082457,0.0001182869,0.00015447548,0.000044432923,0.00031954775,0.00019009014,0.00026570432,0.000062454135,0.000003850068],"category_scores_gemma":[0.00024753058,0.00007705696,0.000055920136,0.00018801294,0.00023382365,0.0003867521,0.00010710742,0.00012115914,0.000042242573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015940148,0.000013316105,0.0042536366,0.0000032793057,0.000020615324,0.000020946969,0.0023191234,0.000004036614,0.0002097635,0.9801962,0.00020041257,0.01274275],"study_design_scores_gemma":[0.02719413,0.00090675056,0.20760043,0.0012457282,0.0005045512,0.0015182988,0.0030853185,0.1131158,0.024901353,0.5347599,0.08117505,0.00399269],"about_ca_topic_score_codex":0.00007240585,"about_ca_topic_score_gemma":0.00009929614,"teacher_disagreement_score":0.945874,"about_ca_system_score_codex":0.000035888283,"about_ca_system_score_gemma":0.0000846818,"threshold_uncertainty_score":0.31422916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18190712,0.000577417,0.80873275,0.0010388233,0.00022340805,0.0003585668,0.0000012295119,0.00019231351,0.006968362],"genre_scores_gemma":[0.7997415,0.000024405963,0.19821508,0.000110687775,0.000030538235,0.000013003333,0.0000016206757,0.0000058015603,0.0018573834],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989321,0.00003655267,0.00018722375,0.00037809604,0.00014091215,0.00032506988],"domain_scores_gemma":[0.9995448,0.000042834552,0.000043728938,0.00027025962,0.000006550239,0.00009185084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018669048,0.00013740236,0.000152525,0.00008946185,0.00007512077,0.000110778,0.00042028216,0.000056065146,0.00002950511],"category_scores_gemma":[0.000014855171,0.00011409388,0.000025280366,0.0001608067,0.000051025974,0.0003742859,0.00036133899,0.000108934,0.0001399382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003028369,0.00020477331,0.0053683147,0.000008482058,0.000008846966,0.000012602157,0.00083414896,0.0001719583,0.0007412137,0.04012232,0.00008454941,0.9524398],"study_design_scores_gemma":[0.0029101192,0.00035581252,0.559913,0.000066201654,0.000011898087,0.00008380945,0.00010388828,0.33905566,0.0015259449,0.005981628,0.08887421,0.0011178352],"about_ca_topic_score_codex":0.0000828412,"about_ca_topic_score_gemma":0.0006403021,"teacher_disagreement_score":0.9513219,"about_ca_system_score_codex":0.00008545963,"about_ca_system_score_gemma":0.000018071878,"threshold_uncertainty_score":0.4652613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025226113,0.0010841615,0.9395946,0.0011561927,0.000828382,0.000651596,0.000003196391,0.0007190107,0.053440195],"genre_scores_gemma":[0.95534885,0.000006973121,0.038125984,0.0010722855,0.00019042041,0.000056812536,0.000012734021,0.000011392506,0.0051745586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820995,0.00008858088,0.0003655115,0.00057263876,0.00023759947,0.0005257328],"domain_scores_gemma":[0.99861294,0.00016327377,0.00018114955,0.0006849283,0.00017746571,0.0001802385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006071297,0.00023863683,0.0003255673,0.00011419703,0.00023446971,0.0003733024,0.00096741837,0.00012577232,0.00001460076],"category_scores_gemma":[0.00013611221,0.00018366697,0.00017743593,0.0003289258,0.000032598822,0.00029350945,0.000052810054,0.00009977112,0.000099121666],"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.000023842784,0.00016190998,0.0009978453,0.000087420965,0.000018249237,0.000028454224,0.00030470768,0.00037316966,0.0015952302,0.97659945,0.0131660625,0.006643639],"study_design_scores_gemma":[0.0046844287,0.0014327255,0.004870666,0.00047931858,0.000048056885,0.000085938475,0.0002129973,0.91430885,0.006330458,0.027284386,0.038615745,0.00164641],"about_ca_topic_score_codex":0.00004166674,"about_ca_topic_score_gemma":0.000007657264,"teacher_disagreement_score":0.9528262,"about_ca_system_score_codex":0.00009907783,"about_ca_system_score_gemma":0.00013768804,"threshold_uncertainty_score":0.7489722},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040481944,0.0016963495,0.96297586,0.0013277602,0.0021588197,0.00039011365,0.0000030294639,0.00038109024,0.031026524],"genre_scores_gemma":[0.41624385,0.00017841072,0.5718699,0.003861334,0.00066098646,0.000012464572,0.000017771152,0.00006635691,0.0070888815],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507934,0.00005397905,0.0006588171,0.0021637238,0.0010096064,0.001034556],"domain_scores_gemma":[0.9967802,0.0003332787,0.00040933315,0.0019272601,0.0002665818,0.00028330612],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009912734,0.0007845881,0.00078967825,0.0008784822,0.0003487144,0.00069717295,0.0055010105,0.00053978927,0.000033548833],"category_scores_gemma":[0.00010729715,0.00066301314,0.00025570323,0.0007638831,0.0008003135,0.0006255182,0.0013704373,0.0011314623,0.00026265482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049298565,0.000051289175,0.00007989291,0.00003952227,0.000010362701,0.0003054555,0.00054302736,0.0034792493,0.00007925823,0.113516755,0.00005775296,0.8818325],"study_design_scores_gemma":[0.0002825489,0.00031710378,0.00026581134,0.0003268519,0.000008452217,0.00025607817,9.8278406e-8,0.33133557,0.00011938587,0.6628287,0.0033108015,0.00094861793],"about_ca_topic_score_codex":0.0000196074,"about_ca_topic_score_gemma":0.00014802103,"teacher_disagreement_score":0.8808839,"about_ca_system_score_codex":0.0005957793,"about_ca_system_score_gemma":0.00077350676,"threshold_uncertainty_score":0.9998797},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33220246,0.00018002049,0.096368656,0.00075957424,0.0007980227,0.00015546178,0.000024167259,0.00040313826,0.5691085],"genre_scores_gemma":[0.96986914,0.00004812789,0.02950754,0.0003230256,0.00006885229,0.000021172578,0.000015044396,0.0000022566844,0.0001448398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993472,0.000012737384,0.00016389479,0.0001694982,0.00010381246,0.00020283807],"domain_scores_gemma":[0.99927753,0.00014687094,0.000066787885,0.00032137777,0.00007550745,0.00011190244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010567995,0.000097696946,0.00009469256,0.000070543036,0.000258057,0.00025606132,0.00047243902,0.00009271171,0.00010430249],"category_scores_gemma":[0.00012455547,0.00007538257,0.00003453386,0.00019271308,0.00011657828,0.0007503179,0.00018930994,0.00021650067,0.00040347007],"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":[8.058044e-7,0.000023505147,0.012554248,0.0000018649038,0.0000043823397,0.0000012305028,0.00053620216,0.0000016695091,0.00026188025,0.9775121,0.00023998771,0.008862075],"study_design_scores_gemma":[0.00048687952,0.0001384317,0.5086028,0.000011927762,0.00001609558,0.000050902243,0.00018899226,0.011641337,0.00069911213,0.42880613,0.048911244,0.00044616318],"about_ca_topic_score_codex":0.00007002742,"about_ca_topic_score_gemma":0.00030132022,"teacher_disagreement_score":0.6376667,"about_ca_system_score_codex":0.000004581124,"about_ca_system_score_gemma":0.00008699098,"threshold_uncertainty_score":0.5185926},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10761334,0.0007263927,0.70081735,0.0039461604,0.0034426071,0.0007576513,0.000067938214,0.0005631133,0.18206544],"genre_scores_gemma":[0.9805532,0.0000022809334,0.0116375405,0.0003841014,0.0003620608,0.00004691527,0.000015069472,0.000004926213,0.006993884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993535,0.000033410313,0.00010432596,0.00019845042,0.00014705509,0.0001632163],"domain_scores_gemma":[0.9992798,0.00014397007,0.00004800331,0.00025496536,0.00014674976,0.00012653899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032198938,0.00006192575,0.000094721785,0.000028995064,0.000076968674,0.000049211165,0.0003565346,0.00004461875,0.000023237732],"category_scores_gemma":[0.00032433803,0.000051243493,0.000051336483,0.00011635874,0.000024456618,0.00014859193,0.000111798065,0.000032617394,0.00025213163],"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.00002396867,0.00012332476,0.0032258437,0.000012343056,0.000015743903,0.000006686412,0.0008742651,0.000009745667,0.0002551495,0.5710292,0.41958657,0.0048371544],"study_design_scores_gemma":[0.0019556733,0.00026066732,0.014428579,0.000008075076,0.000008881553,0.000016978951,0.000014324905,0.005809374,0.0041805143,0.16880438,0.80422896,0.00028361432],"about_ca_topic_score_codex":0.000012441374,"about_ca_topic_score_gemma":0.0000129586815,"teacher_disagreement_score":0.8729399,"about_ca_system_score_codex":0.00007660725,"about_ca_system_score_gemma":0.00012705704,"threshold_uncertainty_score":0.3240726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029639361,0.000065475004,0.84700906,0.000029479139,0.00011857696,0.000049692357,1.3006398e-7,0.000096917356,0.12299129],"genre_scores_gemma":[0.8928091,0.000002302964,0.106897056,0.00006995205,0.000015672857,0.000002934601,5.8159134e-7,0.0000021926824,0.00020021854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999117,0.00004226947,0.00021908009,0.00025828872,0.00019540687,0.00016792708],"domain_scores_gemma":[0.9988498,0.00032624573,0.000093284296,0.00053646765,0.00014106724,0.000053126867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003786214,0.00007874445,0.00024238737,0.00019764906,0.00006007253,0.000072842515,0.0005952107,0.000039354894,0.000067186484],"category_scores_gemma":[0.00022472283,0.000055559776,0.00017671006,0.0012704829,0.00004676963,0.0001261927,0.00018169257,0.000039479717,0.000037114187],"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.0000014231775,0.000069103924,0.023532946,0.000003888733,0.00012226487,0.0000018727742,0.00032408038,0.000039318984,0.000018283816,0.39587224,0.00013039265,0.5798842],"study_design_scores_gemma":[0.00033101454,0.00025387705,0.06853002,0.000068562724,0.00034456368,0.000009154777,0.0000795169,0.86991996,0.00026875647,0.05215527,0.0076562827,0.00038301834],"about_ca_topic_score_codex":0.000018640367,"about_ca_topic_score_gemma":0.00012164914,"teacher_disagreement_score":0.8698806,"about_ca_system_score_codex":0.000010098965,"about_ca_system_score_gemma":0.000026265441,"threshold_uncertainty_score":0.2265662},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07089651,0.0000669273,0.9229522,0.0006022095,0.000088162036,0.0000928608,0.0000018427409,0.000110556284,0.0051887897],"genre_scores_gemma":[0.8250464,0.0000014773037,0.17043363,0.0003455547,0.00022940732,0.000006573396,0.000010566346,0.000002549544,0.0039238413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993657,0.000016210117,0.0001080476,0.00024263375,0.00010266762,0.00016474667],"domain_scores_gemma":[0.99953973,0.000032900163,0.00003942064,0.00025957002,0.000075740856,0.000052652373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008916598,0.00007734206,0.00011368336,0.00011393442,0.000084971754,0.00010338543,0.00033253492,0.00004628352,0.00013487981],"category_scores_gemma":[0.00002324783,0.00005743166,0.00011878681,0.000487128,0.000009294699,0.00026021153,0.000053672786,0.000032359778,0.000027713802],"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.0000043586065,0.000051449788,0.0023383955,0.0000062690874,0.0002576284,7.7640357e-7,0.0016861382,0.0032311198,0.002700041,0.8373258,0.00914153,0.14325646],"study_design_scores_gemma":[0.00030541077,0.000040879677,0.012622419,7.2145946e-7,0.00008619325,0.0000023818372,0.00000774498,0.95328295,0.003624232,0.016165964,0.013690729,0.00017037873],"about_ca_topic_score_codex":0.000012770067,"about_ca_topic_score_gemma":0.00045117212,"teacher_disagreement_score":0.95005184,"about_ca_system_score_codex":0.00002804687,"about_ca_system_score_gemma":0.000026938063,"threshold_uncertainty_score":0.23419951},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04977654,0.00013825987,0.8618063,0.00028051625,0.00014234571,0.0006367799,9.529632e-7,0.00050586165,0.08671247],"genre_scores_gemma":[0.78977257,0.000011745169,0.20678478,0.0005484977,0.00007375647,0.000091474794,0.0000055281425,0.000010098545,0.002701568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882287,0.000015986378,0.00016515912,0.0003945405,0.00016978351,0.00043164816],"domain_scores_gemma":[0.9992318,0.00007073912,0.00006169459,0.00036824177,0.000121321915,0.00014620986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013041911,0.00017256163,0.00019240493,0.000045654604,0.00020188595,0.000083251034,0.0005472263,0.00007038606,0.000023014452],"category_scores_gemma":[0.000016624208,0.00010690012,0.00009394667,0.00023237534,0.0001989811,0.00031119838,0.00009472149,0.00009423029,0.00006700059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001884913,0.00024778617,0.003995669,0.00002498255,0.000032710934,0.00007751236,0.00070648454,0.0000029487953,0.000030306977,0.9547218,0.0015278937,0.038613036],"study_design_scores_gemma":[0.018865785,0.017212229,0.014577549,0.00033069807,0.0001316656,0.009709733,0.0008845721,0.27136645,0.025132766,0.3942665,0.24171156,0.005810494],"about_ca_topic_score_codex":0.000011788189,"about_ca_topic_score_gemma":0.000024009112,"teacher_disagreement_score":0.739996,"about_ca_system_score_codex":0.000024360632,"about_ca_system_score_gemma":0.00017129967,"threshold_uncertainty_score":0.43592605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30143136,0.004680479,0.39781436,0.0004230493,0.0022148506,0.00035332388,0.000006540753,0.001036749,0.2920393],"genre_scores_gemma":[0.99331474,0.00003097605,0.0037562589,0.00016426748,0.0003120613,0.000011409081,0.0000042068827,0.0000083418445,0.0023977533],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99884355,0.000052439515,0.00016525011,0.00029194195,0.00019897931,0.00044782116],"domain_scores_gemma":[0.99920785,0.0001935648,0.00008511823,0.00025767268,0.00011456168,0.00014120141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008169589,0.00013539157,0.00014088335,0.00006858605,0.00030611956,0.0001962544,0.00027374199,0.00007002877,0.000053626896],"category_scores_gemma":[0.00015673891,0.00010927115,0.000034586195,0.00027777912,0.00006160224,0.0010530395,0.00025230699,0.00013670897,0.00016764706],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051786624,0.00014828774,0.80418235,0.000037551046,0.00005056268,0.0000030280235,0.0030638173,0.0000029005355,0.00029798617,0.1554695,0.01934554,0.01739329],"study_design_scores_gemma":[0.001606557,0.00023349986,0.7098187,0.00009510621,0.00008605689,0.00033410318,0.0020620502,0.0629711,0.0031147322,0.0044139028,0.21377516,0.0014889874],"about_ca_topic_score_codex":0.00012212133,"about_ca_topic_score_gemma":0.000040125193,"teacher_disagreement_score":0.6918834,"about_ca_system_score_codex":0.000041428913,"about_ca_system_score_gemma":0.00004692859,"threshold_uncertainty_score":0.44559482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.956231,0.0004687253,0.0017874464,0.0007590399,0.003826117,0.00054987456,0.00010987902,0.00013518077,0.036132723],"genre_scores_gemma":[0.9850658,0.00001974148,0.014200915,0.000053486212,0.00040161193,0.0000027440778,4.405545e-7,0.000013567862,0.0002416776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856865,0.000037764486,0.00033664555,0.00033177962,0.0004393612,0.00028577988],"domain_scores_gemma":[0.9968601,0.0004820358,0.0007737731,0.00023002975,0.0015820835,0.00007201098],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0007924551,0.0002008373,0.00027784638,0.000019578047,0.00030033168,0.00007507994,0.0017022568,0.000114471186,0.0000013079858],"category_scores_gemma":[0.008353176,0.000120212324,0.0002422089,0.00026444078,0.00045311972,0.000090004076,0.0014180893,0.00035290315,4.656442e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028890013,0.00034653454,0.10333691,0.0014925962,0.0011638833,3.4882714e-7,0.1934479,0.0001537985,0.012448753,0.6506103,0.03268802,0.004022046],"study_design_scores_gemma":[0.0066702906,0.001956583,0.06342005,0.003746283,0.0010081375,0.00002835304,0.022180004,0.08163544,0.3741448,0.42224315,0.021018181,0.0019487421],"about_ca_topic_score_codex":0.000048448863,"about_ca_topic_score_gemma":0.0000042414113,"teacher_disagreement_score":0.36169603,"about_ca_system_score_codex":0.000040674746,"about_ca_system_score_gemma":0.000057094734,"threshold_uncertainty_score":0.9999999},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7818327,0.00030083302,0.15939079,0.03615127,0.0021749733,0.0021328423,0.000023991493,0.00075220154,0.017240416],"genre_scores_gemma":[0.987508,0.000010734408,0.009096608,0.0005148448,0.0005267531,0.00020849334,0.000004082091,0.000017086997,0.0021134207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954934,0.0012753665,0.00026981387,0.0006796342,0.0012755339,0.0010062219],"domain_scores_gemma":[0.99493414,0.0019793422,0.00006637369,0.0016448542,0.001092536,0.00028273536],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0137408525,0.00020830338,0.0002425574,0.000044516357,0.0018175502,0.0003385485,0.002661448,0.0001810966,0.00009336103],"category_scores_gemma":[0.0016027059,0.00012915532,0.00035086292,0.0012829896,0.0012183643,0.0003640748,0.0009406014,0.002029692,0.00020790492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006687139,0.0007072822,0.0007862752,0.00014685307,0.00012771112,0.00001378492,0.27676046,0.000048509846,0.010633332,0.54419875,0.15784162,0.008668558],"study_design_scores_gemma":[0.0039739795,0.0016116034,0.007792361,0.00009091312,0.00003379524,0.000025362793,0.009256139,0.30051064,0.041669916,0.44924647,0.18408804,0.001700781],"about_ca_topic_score_codex":0.00035656645,"about_ca_topic_score_gemma":0.00019281819,"teacher_disagreement_score":0.30046216,"about_ca_system_score_codex":0.0001692487,"about_ca_system_score_gemma":0.0009927986,"threshold_uncertainty_score":0.999482},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009548567,0.00093939283,0.98144394,0.0003986936,0.003745762,0.00091093127,0.0000048959787,0.00025355368,0.012207314],"genre_scores_gemma":[0.032612722,0.000046282,0.9582755,0.006370013,0.0020653652,0.000025508554,0.0000058197516,0.000083496954,0.00051531347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465156,0.000023920216,0.00059431104,0.0021724647,0.0012189568,0.0013388202],"domain_scores_gemma":[0.9969043,0.00027192014,0.00029414313,0.001633449,0.00043292978,0.00046326467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014190675,0.00076443603,0.0006902761,0.0013429695,0.00041775507,0.0007045963,0.004145436,0.0005085782,0.000029824958],"category_scores_gemma":[0.000087784996,0.0006747226,0.00018813426,0.0012183831,0.00048279305,0.00082257885,0.002421241,0.0008878542,0.00016919863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070674023,0.0000829286,0.00015019636,0.00009517475,0.000020862992,0.0002525874,0.007872305,0.008864063,0.00025517485,0.045749232,0.000076041746,0.93657434],"study_design_scores_gemma":[0.00075162423,0.00090320926,0.0006047894,0.0020438132,0.00003302593,0.0004725677,7.295209e-7,0.7641626,0.0020872082,0.19309731,0.03240405,0.0034390858],"about_ca_topic_score_codex":0.00009212459,"about_ca_topic_score_gemma":0.00039645945,"teacher_disagreement_score":0.9331353,"about_ca_system_score_codex":0.0005213178,"about_ca_system_score_gemma":0.0004854238,"threshold_uncertainty_score":0.99957037},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018954022,0.00021739767,0.4807289,0.000591082,0.00014179407,0.00024262388,8.789084e-7,0.00027218222,0.49885115],"genre_scores_gemma":[0.95120585,0.000018757519,0.045727555,0.00024742848,0.00008042918,0.000038746926,0.000005184433,0.0000067263913,0.0026693062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989966,0.000034943092,0.00022253234,0.00023579081,0.00016072587,0.00034940898],"domain_scores_gemma":[0.999226,0.00012733946,0.000078234276,0.00030823317,0.00016915952,0.00009105701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026041432,0.00016473177,0.00016601663,0.00017066272,0.0001393199,0.00020040345,0.00039924346,0.00006223753,0.0001108606],"category_scores_gemma":[0.000113605434,0.00011640479,0.00003105696,0.0007544548,0.000033611956,0.0036395236,0.00012266224,0.00014627713,0.0004355947],"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.00012518348,0.0011725755,0.056136835,0.00010579367,0.00006185095,0.000018932718,0.04683121,0.0057283747,0.000030352356,0.51180094,0.017067797,0.36092016],"study_design_scores_gemma":[0.002590612,0.000358645,0.05639836,0.00019357931,0.0000132803925,0.0000548355,0.00084720255,0.63470346,0.0013900561,0.00064212724,0.30199075,0.00081708137],"about_ca_topic_score_codex":0.0001628735,"about_ca_topic_score_gemma":0.0031145453,"teacher_disagreement_score":0.9322519,"about_ca_system_score_codex":0.00012108782,"about_ca_system_score_gemma":0.00013921493,"threshold_uncertainty_score":0.5598834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027243616,0.0019833478,0.96611315,0.0004455843,0.0012752257,0.000112799775,0.0000018935261,0.000034892477,0.0027894885],"genre_scores_gemma":[0.80980545,0.000014866125,0.18926653,0.00007156265,0.0007830824,0.000002322815,2.7313314e-7,0.000002991485,0.00005289472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857026,0.00007325298,0.00052613794,0.00024540868,0.0003371681,0.0002477844],"domain_scores_gemma":[0.9985991,0.00043018826,0.00040597795,0.00015075908,0.0003266857,0.00008725604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016388012,0.000120350254,0.00029335576,0.00017694246,0.00046725402,0.00045284233,0.00064350717,0.00002739183,7.8840105e-7],"category_scores_gemma":[0.000034020606,0.00008005489,0.00010248789,0.0003046863,0.00011949342,0.00077791495,0.00017470407,0.00006968854,0.0000016242766],"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.000023593653,0.00022400044,0.031523813,0.0006921304,0.000064724896,0.00013424225,0.0012494978,0.0034041242,0.00013496497,0.9153719,0.01914496,0.028032042],"study_design_scores_gemma":[0.0018529161,0.001299884,0.017910143,0.001604284,0.000050228635,0.004169815,0.00091249205,0.9326092,0.0002989516,0.004583624,0.034061436,0.0006470096],"about_ca_topic_score_codex":0.00004176323,"about_ca_topic_score_gemma":0.000032910666,"teacher_disagreement_score":0.9292051,"about_ca_system_score_codex":0.00003086963,"about_ca_system_score_gemma":0.0001387009,"threshold_uncertainty_score":0.4366769},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023524903,0.0002573391,0.96035296,0.00067327,0.0005713097,0.00017934754,0.00001070017,0.00023204912,0.0141981505],"genre_scores_gemma":[0.9215004,0.0000032065504,0.07750773,0.00024815078,0.00009432688,0.000039111386,0.000023364853,0.000012126476,0.00057158776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982893,0.00013321282,0.00035602174,0.00053927646,0.00031451674,0.00036770574],"domain_scores_gemma":[0.9987973,0.00052002654,0.00007765718,0.00041160133,0.000113881455,0.00007953664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028940383,0.00022796533,0.00021456993,0.000358556,0.0002780291,0.00012937798,0.00082993304,0.000112978385,0.00007205085],"category_scores_gemma":[0.000010289859,0.00021266604,0.000112534115,0.0006366376,0.00006024407,0.00031912109,0.000029502477,0.00030596124,0.00035191906],"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.000030433028,0.00095456967,0.0012648606,0.000021002596,0.00003001557,0.0001154604,0.0015160078,0.7116567,0.00006976528,0.27157336,0.00085586216,0.011911961],"study_design_scores_gemma":[0.0022142571,0.0003152309,0.051748686,0.00007856883,0.000014488066,0.00015230321,0.0002100333,0.082063824,0.00026640622,0.8547652,0.0074225063,0.00074852904],"about_ca_topic_score_codex":0.000050608414,"about_ca_topic_score_gemma":0.00010287314,"teacher_disagreement_score":0.8979755,"about_ca_system_score_codex":0.00016319624,"about_ca_system_score_gemma":0.00013071555,"threshold_uncertainty_score":0.8672269},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6277146,0.0002977062,0.060490973,0.006061125,0.002768207,0.0014340838,0.000009962097,0.0006796662,0.3005437],"genre_scores_gemma":[0.99459344,0.000025565765,0.004196766,0.00020440378,0.00015007716,0.000035509758,4.666803e-7,0.000014923809,0.00077886734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973904,0.00004461736,0.0005865329,0.00069935806,0.00074511586,0.00053396315],"domain_scores_gemma":[0.99760246,0.00009229542,0.00044678478,0.00045951593,0.001146614,0.00025233277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010836254,0.00033447228,0.0004065301,0.0001471622,0.00021714889,0.00047194856,0.0031154256,0.00014716615,0.000041782718],"category_scores_gemma":[0.0008426568,0.00022741802,0.00014884952,0.000774527,0.0003571588,0.00072326366,0.00070939166,0.0004321951,0.00027317437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083072286,0.00017794542,0.0029656177,0.000037012698,0.000026179945,9.186867e-7,0.007172117,0.00003293122,0.005473911,0.94702196,0.001046891,0.035961438],"study_design_scores_gemma":[0.00014837553,0.00069259945,0.0007385162,0.0004559828,0.000038361755,0.000025552386,0.0033993865,0.07922384,0.42565292,0.4865638,0.0022649325,0.00079571403],"about_ca_topic_score_codex":0.000104933955,"about_ca_topic_score_gemma":0.000046101286,"teacher_disagreement_score":0.46045816,"about_ca_system_score_codex":0.00008175712,"about_ca_system_score_gemma":0.00035015025,"threshold_uncertainty_score":0.9273837},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018947784,0.00023422511,0.9564272,0.0006160294,0.00070931064,0.00011653647,3.0748086e-7,0.00014477395,0.022803813],"genre_scores_gemma":[0.99411297,0.000052000287,0.0052085975,0.00023719807,0.00017683205,0.000006096563,7.37753e-7,0.000006620972,0.0001989654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861467,0.00013574184,0.00032672417,0.0004107076,0.00018667971,0.00032545283],"domain_scores_gemma":[0.9989839,0.00026480464,0.00006908738,0.0005206353,0.000083103914,0.00007842118],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008671384,0.0001348304,0.00017103543,0.000104836465,0.0001269335,0.0001726552,0.0008524597,0.00007065123,0.00004934217],"category_scores_gemma":[0.0005275026,0.00011291155,0.000056961788,0.0005405787,0.00010129307,0.00032891036,0.00022929908,0.00015765302,0.0009806454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032931428,0.0000369721,0.00021988327,0.0000036104793,9.668336e-7,0.0000026642326,0.0009722889,0.000053834152,0.00021033277,0.6649149,0.000056973215,0.3335243],"study_design_scores_gemma":[0.000019852572,0.00015915823,0.00059621764,0.000053479136,0.000002229203,0.0000056813165,0.00013325366,0.06947108,0.041763514,0.8769263,0.01060994,0.00025930224],"about_ca_topic_score_codex":0.00006840188,"about_ca_topic_score_gemma":0.00018241638,"teacher_disagreement_score":0.9751652,"about_ca_system_score_codex":0.000029014333,"about_ca_system_score_gemma":0.00003359112,"threshold_uncertainty_score":0.9997972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06342655,0.00017310656,0.93088144,0.00015227213,0.0002520075,0.00025485473,0.000014497415,0.00005392816,0.004791322],"genre_scores_gemma":[0.9983103,0.000019416337,0.0015931105,0.000025756437,0.000014594068,0.000010698104,0.000016770044,0.0000010237032,0.000008301987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991244,0.00009177178,0.00040144988,0.000073970084,0.000186074,0.00012229719],"domain_scores_gemma":[0.9991965,0.00023714575,0.00020917626,0.00019223448,0.0001310612,0.000033882043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057509914,0.00006858188,0.00013710048,0.00006224618,0.00016639834,0.000089475085,0.00021719145,0.000031536925,0.0000012893381],"category_scores_gemma":[0.00016888358,0.000046197598,0.000018532424,0.00021411655,0.00023503284,0.0013304659,0.00010055597,0.00009088418,0.00001159309],"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.000006915877,0.00003058084,0.030055894,0.000108589215,0.000011220334,9.392084e-7,0.0056991857,0.00022959779,0.000019042684,0.95700955,0.00063710817,0.00619136],"study_design_scores_gemma":[0.0011919106,0.00007217216,0.18662572,0.00021839415,0.0000043463033,0.00035734905,0.0041321116,0.79437417,0.00052789605,0.0026297239,0.009531344,0.00033487388],"about_ca_topic_score_codex":0.00017700171,"about_ca_topic_score_gemma":0.000014273162,"teacher_disagreement_score":0.95437986,"about_ca_system_score_codex":0.00003653421,"about_ca_system_score_gemma":0.000060770457,"threshold_uncertainty_score":0.18838833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9719235,0.0005110687,0.014729011,0.0026853546,0.00023441295,0.0011661232,0.00002087235,0.00014108473,0.0085885795],"genre_scores_gemma":[0.9956379,0.00012777168,0.0009305217,0.0000123931995,0.00007280317,0.000002045419,0.000017425042,0.000009084791,0.0031900548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971074,0.00063301355,0.0001831196,0.000598263,0.0010397072,0.00043852045],"domain_scores_gemma":[0.9971565,0.0005959582,0.00020490757,0.0010480713,0.0008817544,0.0001128093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020184563,0.00015763141,0.0002448716,0.00036086593,0.00087951706,0.00003685613,0.0013710413,0.000111118956,0.00011999612],"category_scores_gemma":[0.0013674508,0.000118733966,0.00010802534,0.0012742421,0.0008652849,0.0005191171,0.0006022267,0.0005030517,0.00009506808],"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.0018664659,0.0023157122,0.0058507454,0.0006864684,0.00034626352,0.00039527437,0.13049011,0.00039675718,0.04905739,0.60105234,0.1339503,0.07359217],"study_design_scores_gemma":[0.013048396,0.01576095,0.15646401,0.0028039673,0.0001658899,0.0005598481,0.027899487,0.021456547,0.49193817,0.067573175,0.19867438,0.0036551775],"about_ca_topic_score_codex":0.00040909852,"about_ca_topic_score_gemma":0.000084125306,"teacher_disagreement_score":0.53347915,"about_ca_system_score_codex":0.00014728506,"about_ca_system_score_gemma":0.0003832942,"threshold_uncertainty_score":0.6764623},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2775394,0.19212408,0.22658783,0.007692764,0.0014930826,0.008803678,0.00012558013,0.00058708794,0.2850465],"genre_scores_gemma":[0.9606881,0.0015667708,0.034856036,0.0014398419,0.000062156236,0.000105821215,0.000004590789,0.000012211169,0.001264453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99652594,0.0012530283,0.00042049936,0.0003227568,0.0007435456,0.00073423045],"domain_scores_gemma":[0.99751556,0.0010146475,0.00014568529,0.00070097647,0.00037484596,0.0002483072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077758296,0.00013634922,0.00039586367,0.00016514005,0.0004867913,0.00015693884,0.0012405103,0.00007779405,0.000039168826],"category_scores_gemma":[0.00012663008,0.000074557865,0.00009129004,0.0007088488,0.00024618214,0.00034696396,0.00053422473,0.00034652246,0.00008115309],"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.000053085398,0.00007686031,0.0035180033,0.0012070109,0.00007064873,0.000002030916,0.00911214,0.000012037697,0.0000032036403,0.97887003,0.00017798958,0.0068969373],"study_design_scores_gemma":[0.015112708,0.0023196884,0.36144683,0.00044703818,0.00014264342,0.0002625501,0.010426882,0.113581024,0.0012853532,0.22225578,0.2713363,0.0013832332],"about_ca_topic_score_codex":0.0011212694,"about_ca_topic_score_gemma":0.0010726532,"teacher_disagreement_score":0.75661427,"about_ca_system_score_codex":0.000033154407,"about_ca_system_score_gemma":0.0007360001,"threshold_uncertainty_score":0.37440544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21502718,0.00048725604,0.7835643,0.000049515238,0.000058633108,0.000119598364,0.0000015928421,0.000029349032,0.0006625714],"genre_scores_gemma":[0.92742306,0.000041978114,0.07247086,0.00001581941,0.000009129388,0.0000134406055,0.000011138764,0.000004551409,0.0000100407215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881595,0.0000921947,0.0003331876,0.0003931553,0.00019153797,0.00017399609],"domain_scores_gemma":[0.9990233,0.00038924653,0.0001506839,0.0001967299,0.00018288368,0.00005715005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066777697,0.000116904535,0.00017059778,0.0001395529,0.00006876713,0.0000738448,0.00044989295,0.000058579913,0.0000022277864],"category_scores_gemma":[0.00031183293,0.00011304528,0.000023805245,0.00055813795,0.00011256697,0.0003071177,0.0001440565,0.00013062349,0.000011710681],"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.00001626706,0.00016263798,0.06920705,0.000041038602,0.000011426258,0.0000028145967,0.0035575156,0.22167782,0.000057610985,0.6652869,0.0000023781272,0.03997651],"study_design_scores_gemma":[0.00009534768,0.00004020296,0.44877002,0.00007145036,0.0000013247856,0.000008031058,0.000046611112,0.5060926,0.00053516467,0.04423392,0.0000029649182,0.00010234891],"about_ca_topic_score_codex":0.00024584157,"about_ca_topic_score_gemma":0.00020757825,"teacher_disagreement_score":0.71239585,"about_ca_system_score_codex":0.0000648918,"about_ca_system_score_gemma":0.00022487811,"threshold_uncertainty_score":0.46098527},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029392426,0.006506679,0.95208204,0.00045757665,0.0069062533,0.00027502247,0.0000021680664,0.00020791317,0.033532977],"genre_scores_gemma":[0.71518916,0.0014577594,0.26894337,0.0024810033,0.0058456534,0.000049333186,0.000008798905,0.00014155626,0.0058833873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959064,0.00005612937,0.00050142384,0.0013366735,0.0010195385,0.0011798228],"domain_scores_gemma":[0.995261,0.0018420122,0.000328813,0.0020071508,0.0002702985,0.00029070443],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001545196,0.0005914789,0.00046956504,0.00034631466,0.0008362869,0.0010881906,0.006069944,0.00036144894,0.000020547615],"category_scores_gemma":[0.0003244629,0.00038509115,0.00020375752,0.0005434699,0.0011102733,0.0006295191,0.0019908203,0.0009720438,0.0003079475],"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.0000028701043,0.00001591584,0.00004925177,0.000011038427,0.00000838022,0.000021206648,0.0007373435,0.00038270265,0.000009007128,0.22595678,0.00007103448,0.77273446],"study_design_scores_gemma":[0.00068423175,0.00031889122,0.0015474928,0.00054494943,0.000029598854,0.00031927737,5.2596977e-7,0.21928833,0.0012498833,0.6291398,0.14474176,0.0021352924],"about_ca_topic_score_codex":0.000013188158,"about_ca_topic_score_gemma":0.000084777064,"teacher_disagreement_score":0.7705992,"about_ca_system_score_codex":0.00026768123,"about_ca_system_score_gemma":0.0005370299,"threshold_uncertainty_score":0.9999488},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90351975,0.0010319388,0.0037004685,0.0014403545,0.00013913587,0.00013803344,6.176242e-7,0.000018057106,0.09001164],"genre_scores_gemma":[0.99858516,0.00015254422,0.00066184,0.00038670513,0.000097243814,0.0000029264647,1.677701e-7,0.0000034874927,0.00010993269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988834,0.00010121897,0.00042321207,0.00011706329,0.00024125875,0.00023380156],"domain_scores_gemma":[0.9990729,0.00018049065,0.0002995727,0.00028746243,0.00010232311,0.000057224035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077780365,0.000101201906,0.00022138421,0.0001228088,0.000061182545,0.00003936229,0.0009172968,0.00006544677,0.00015167755],"category_scores_gemma":[0.0000851013,0.000054967888,0.00011748114,0.00034375172,0.00004574225,0.00032056784,0.00005619214,0.00023730502,0.00006401826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000344561,0.00024746594,0.001431509,0.000005743378,0.0000144731175,0.000012440232,0.0015488536,0.00035226147,0.0020186433,0.8925453,0.00032586642,0.10146298],"study_design_scores_gemma":[0.0008732707,0.0011634716,0.07519466,0.00008138268,0.00001315208,0.000369865,0.00019744686,0.0052214805,0.0050764424,0.90647304,0.0051268176,0.0002089713],"about_ca_topic_score_codex":0.000011092456,"about_ca_topic_score_gemma":0.0000030038705,"teacher_disagreement_score":0.10125401,"about_ca_system_score_codex":0.000047392215,"about_ca_system_score_gemma":0.000068808,"threshold_uncertainty_score":0.22415254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094371505,0.00055885524,0.8938531,0.000064749955,0.00015628326,0.00044469116,9.0432803e-7,0.0003500031,0.010199883],"genre_scores_gemma":[0.54003173,0.000010842,0.45967484,0.000075862816,0.000038400965,0.000019298846,0.000004163299,0.0000052653445,0.00013963062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988471,0.000014587021,0.00025083154,0.00034909596,0.00008404656,0.0004543402],"domain_scores_gemma":[0.99941427,0.0001767152,0.000054712775,0.0002359145,0.0000446175,0.00007377748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244147,0.000100638186,0.00013087514,0.00008485806,0.00011845941,0.00010035746,0.00016920261,0.000021808808,0.0000031747427],"category_scores_gemma":[0.00007453957,0.00008577208,0.00005009301,0.00016532328,0.000028297656,0.000345924,0.00032337508,0.00005362691,0.0000010769244],"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.000028551502,0.00027470614,0.19372992,0.00025944517,0.000052875337,0.00009191298,0.004419861,0.000020065158,0.0016722927,0.34383768,0.00070531206,0.4549074],"study_design_scores_gemma":[0.008370847,0.0011658039,0.06327923,0.00096878555,0.00007992616,0.00036554757,0.011195818,0.61071104,0.03798643,0.0038483802,0.25891554,0.0031126516],"about_ca_topic_score_codex":0.00013694944,"about_ca_topic_score_gemma":0.0014271978,"teacher_disagreement_score":0.61069095,"about_ca_system_score_codex":0.000028685496,"about_ca_system_score_gemma":0.000028064554,"threshold_uncertainty_score":0.3497684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006564556,0.000748908,0.98754555,0.000062828185,0.0017863273,0.00030490992,4.400625e-7,0.0004256182,0.002560845],"genre_scores_gemma":[0.77209866,0.0000072442,0.22721846,0.00013535535,0.00023623966,0.000032861633,5.050047e-7,0.000011492945,0.0002591552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708694,0.00007861662,0.00026164134,0.00099572,0.00085920835,0.0007178938],"domain_scores_gemma":[0.99769866,0.00008415336,0.00014784456,0.00078018423,0.00072947255,0.00055966346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020411685,0.00026319237,0.00024793536,0.00023548845,0.00034059092,0.0008758907,0.0027520943,0.000056552235,8.374138e-7],"category_scores_gemma":[0.000048110775,0.00018570482,0.0000413872,0.0012640654,0.0004156228,0.0015260889,0.0007819565,0.0001904068,0.00015327634],"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.000024056255,0.00033609552,0.0018586644,0.00009702899,0.000024727657,0.00009386948,0.019037904,0.48788285,0.00008200554,0.469983,0.000776323,0.019803436],"study_design_scores_gemma":[0.00043648234,0.0001757715,0.00008983851,0.000039064624,0.00000492457,0.00013062349,0.00006879036,0.99506485,0.00024549596,0.0026988091,0.0007249394,0.00032040363],"about_ca_topic_score_codex":0.00004252597,"about_ca_topic_score_gemma":0.0000028932411,"teacher_disagreement_score":0.7655341,"about_ca_system_score_codex":0.00015731732,"about_ca_system_score_gemma":0.0010540271,"threshold_uncertainty_score":0.84462345},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8328361,0.004496629,0.09323297,0.00051668583,0.001672186,0.0007110022,0.000011530724,0.00039647208,0.06612641],"genre_scores_gemma":[0.9852056,0.00031507295,0.012160873,0.000017790633,0.00022722833,0.000044882407,0.000019795423,0.000017367453,0.0019913923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830675,0.00013847838,0.00040866432,0.0006485335,0.000207202,0.00029036257],"domain_scores_gemma":[0.9983209,0.00040613575,0.00028107248,0.0005192507,0.00024171617,0.00023096001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006995244,0.00022917397,0.00030890075,0.00021843726,0.00039602566,0.0001965566,0.00028526026,0.00017087803,0.000019005289],"category_scores_gemma":[0.0007332826,0.00020159358,0.00008462057,0.00036480816,0.00022768308,0.00074444216,0.0003541344,0.00036020324,0.00002221518],"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.00011286325,0.000827063,0.17590114,0.0003686775,0.00024032753,0.000019384315,0.016305784,0.00012881591,0.01839177,0.4722044,0.0007180878,0.3147817],"study_design_scores_gemma":[0.0054064235,0.00053115276,0.44463077,0.00042091927,0.00025813683,0.0008695327,0.0040831007,0.4540498,0.029695109,0.0042622914,0.05415134,0.0016414345],"about_ca_topic_score_codex":0.00006839215,"about_ca_topic_score_gemma":0.00025493558,"teacher_disagreement_score":0.4679421,"about_ca_system_score_codex":0.000022549648,"about_ca_system_score_gemma":0.00010317015,"threshold_uncertainty_score":0.8220747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032414107,0.0005334933,0.98969257,0.0008793297,0.00053135515,0.00014657428,0.0000021422277,0.00024576308,0.0047273687],"genre_scores_gemma":[0.9325844,0.000020511781,0.065969706,0.0010465223,0.00017120606,0.00002597859,0.000013555044,0.0000074991804,0.0001606079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988326,0.000030660325,0.00022524816,0.00038339465,0.00026857833,0.00025954735],"domain_scores_gemma":[0.9991784,0.0001116262,0.00007317997,0.00024209764,0.00027860896,0.000116105155],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014735259,0.00014742868,0.00012488593,0.00011095545,0.00016201251,0.00017295225,0.00078633206,0.00005497705,0.00004561651],"category_scores_gemma":[0.000057144352,0.00013579676,0.0000627324,0.0005801668,0.00006959896,0.00051640935,0.00019207736,0.00012383233,0.0011329392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002640972,0.000112517155,0.00021041701,0.000008393665,0.000010848118,0.000029694416,0.0023884405,0.03848287,0.000017306498,0.9148795,0.0001632333,0.04369413],"study_design_scores_gemma":[0.0002309483,0.00019797352,0.008044591,0.00007831924,0.000004979,0.00011496325,0.00003870707,0.25538263,0.0022906323,0.728718,0.004431316,0.00046698062],"about_ca_topic_score_codex":0.00003228139,"about_ca_topic_score_gemma":0.000007722942,"teacher_disagreement_score":0.929343,"about_ca_system_score_codex":0.000078795754,"about_ca_system_score_gemma":0.00011826712,"threshold_uncertainty_score":0.9996448},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07021322,0.00019223466,0.05692969,0.00057448423,0.00039269976,0.00015322679,4.896523e-7,0.00022491744,0.87131906],"genre_scores_gemma":[0.99644387,0.00003469855,0.001977373,0.00062152016,0.0001043427,0.000012870978,5.640993e-7,0.0000029228709,0.0008018546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989808,0.000035352892,0.00018615366,0.00021907278,0.00016682595,0.00041178527],"domain_scores_gemma":[0.9994314,0.00006716798,0.000043046584,0.00026950368,0.000089081695,0.000099818884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026674356,0.000120281155,0.00015013343,0.00011349297,0.00008390184,0.0000772141,0.0005739128,0.00008624161,0.00007576115],"category_scores_gemma":[0.00024395552,0.00009548329,0.00006472356,0.0005498189,0.000066611494,0.0006977665,0.00026423408,0.00022475439,0.00058609014],"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.000023877034,0.00013104906,0.017335858,0.0000039682104,0.000006076801,0.00016286658,0.0038835707,0.00005012478,0.000020518759,0.96541494,0.0004499441,0.012517204],"study_design_scores_gemma":[0.0027888995,0.0012021688,0.61753863,0.000038690054,0.000010897209,0.00059794314,0.0010789838,0.07084908,0.00045166843,0.24133681,0.06291437,0.0011918385],"about_ca_topic_score_codex":0.00017783674,"about_ca_topic_score_gemma":0.00018230408,"teacher_disagreement_score":0.9262306,"about_ca_system_score_codex":0.00011771602,"about_ca_system_score_gemma":0.00009595298,"threshold_uncertainty_score":0.75331986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006169232,0.0017620343,0.96756995,0.00056527276,0.0003877122,0.00037548062,4.3661197e-7,0.00032932995,0.022840574],"genre_scores_gemma":[0.6992174,0.000039524017,0.3001001,0.0003206552,0.00015703021,0.000021605769,0.0000028235083,0.000013897151,0.00012702215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706364,0.001096943,0.00039445978,0.00056735397,0.00030347749,0.0005741104],"domain_scores_gemma":[0.9955725,0.0030144525,0.0004458024,0.00055923517,0.00022758565,0.00018043643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008151505,0.00027347068,0.00035785374,0.00011431853,0.00033943812,0.00032053475,0.0006769043,0.00016150156,0.00002007946],"category_scores_gemma":[0.0034042224,0.00022207158,0.00010596505,0.0004047373,0.00026195968,0.0014362246,0.00039824005,0.00036856846,0.000034520956],"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.00008839485,0.00012776267,0.00013714259,0.00006035323,0.000042925505,0.000012344915,0.0020929573,0.000012910475,0.0003813942,0.48365656,0.0000082306815,0.51337904],"study_design_scores_gemma":[0.0024650476,0.00282045,0.0003289783,0.00033015644,0.0004249663,0.0013415081,0.0048758667,0.016030798,0.0042683724,0.53040814,0.43486974,0.0018360039],"about_ca_topic_score_codex":0.000019050003,"about_ca_topic_score_gemma":0.0000028901916,"teacher_disagreement_score":0.6930481,"about_ca_system_score_codex":0.000019945353,"about_ca_system_score_gemma":0.00004766856,"threshold_uncertainty_score":0.90558165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078606434,0.00046809568,0.9058334,0.0040135207,0.0018632791,0.00027968676,5.8095554e-7,0.0000475538,0.0088874195],"genre_scores_gemma":[0.99432087,0.00017357353,0.0034709948,0.000042078256,0.0008354946,0.000010955245,2.712225e-7,0.000008563592,0.0011372031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737877,0.00033928474,0.00062716025,0.000225518,0.0009033949,0.00052588317],"domain_scores_gemma":[0.9959939,0.0006664134,0.00021569664,0.000360756,0.002462233,0.0003009653],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027283886,0.00011027277,0.00020573314,0.0005364262,0.00038603265,0.00067623396,0.001014576,0.000108092565,0.0004895901],"category_scores_gemma":[0.0011042975,0.0000842592,0.00014942368,0.000994377,0.00018756793,0.00144318,0.00015929216,0.00094930455,0.002688553],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055892007,0.0005592451,0.00041286604,0.000013668739,0.000060667655,0.00006732231,0.0015886439,0.000279678,0.022867864,0.11837287,0.021887308,0.833834],"study_design_scores_gemma":[0.00024293053,0.0040997528,0.005876591,0.00022445973,0.000036484995,0.00083852914,0.008411556,0.15036738,0.15827689,0.60610837,0.0646884,0.0008286556],"about_ca_topic_score_codex":0.00017055505,"about_ca_topic_score_gemma":0.00005440811,"teacher_disagreement_score":0.91571444,"about_ca_system_score_codex":0.00015750049,"about_ca_system_score_gemma":0.0003316185,"threshold_uncertainty_score":0.99808794},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07886363,0.00057910784,0.28196278,0.0008366494,0.00094884017,0.0003419561,8.6923563e-7,0.00083526626,0.6356309],"genre_scores_gemma":[0.9762355,0.000010736196,0.018663583,0.000088618704,0.00005779448,0.000017935165,6.823072e-7,0.0000040393334,0.0049210875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901533,0.000051592557,0.00017389585,0.00033859187,0.00016556318,0.0002550443],"domain_scores_gemma":[0.99939376,0.00016121875,0.000041214047,0.0002723491,0.000056549132,0.00007488818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021688036,0.000105917075,0.00011999529,0.00010591359,0.00007332384,0.00010839661,0.00042529588,0.000051877632,0.000339909],"category_scores_gemma":[0.00042436848,0.0000868053,0.00003574347,0.00051221217,0.000037630034,0.0003521185,0.00013894872,0.0001289474,0.00033958556],"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.0000025910253,0.0003197185,0.14894463,0.00001812472,0.000007318465,0.000041754654,0.0016062359,0.00030763925,0.00005955078,0.81103045,0.0032820725,0.034379948],"study_design_scores_gemma":[0.0006215809,0.00014070494,0.056949947,0.000070524206,0.0000028897573,0.0000435341,0.00003261342,0.90212256,0.00021381071,0.02713684,0.01216779,0.00049720873],"about_ca_topic_score_codex":0.00013403881,"about_ca_topic_score_gemma":0.00027312982,"teacher_disagreement_score":0.90181494,"about_ca_system_score_codex":0.000062212974,"about_ca_system_score_gemma":0.000037646496,"threshold_uncertainty_score":0.43647987},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002840779,0.00055213587,0.014563443,0.00063043553,0.8742723,0.0007508134,0.00001215989,0.00026827576,0.10894758],"genre_scores_gemma":[0.0003718351,0.00080981164,0.034886867,0.00010692686,0.96145505,0.00013855714,0.000087657405,0.000039972365,0.0021033143],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99429405,0.0015052662,0.0007824065,0.0012016293,0.0014546481,0.00076200685],"domain_scores_gemma":[0.98780704,0.008219194,0.0014780558,0.0008212465,0.0014228352,0.00025160794],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006518774,0.00068932585,0.000836451,0.00025373045,0.00034035835,0.0012617855,0.0022891725,0.0011513582,0.00031259935],"category_scores_gemma":[0.01620956,0.0005606003,0.00020046071,0.00033330216,0.0004686707,0.0015434589,0.0009277885,0.0017831733,0.00023293882],"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.0003410202,0.0003063042,9.661426e-7,0.000091923604,0.000114477945,0.000027835791,0.0009845032,9.147891e-7,0.000010006215,0.36441246,0.44103816,0.19267143],"study_design_scores_gemma":[0.0006219131,0.0010875781,6.956873e-7,0.0002250123,0.00011254783,0.000027932276,0.00061577104,0.000051650048,0.000023000843,0.07659996,0.9200534,0.0005805203],"about_ca_topic_score_codex":0.00005170527,"about_ca_topic_score_gemma":0.00000672277,"teacher_disagreement_score":0.47901526,"about_ca_system_score_codex":0.000120050376,"about_ca_system_score_gemma":0.0004621762,"threshold_uncertainty_score":0.999775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022543878,0.0018241582,0.98270357,0.000095937015,0.0009801816,0.00027014274,0.0000032077062,0.000180415,0.013716978],"genre_scores_gemma":[0.76090974,0.00041540497,0.23686337,0.0005655291,0.0005574517,0.000010679688,0.000008217283,0.00004744143,0.0006221689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651825,0.000035533598,0.0005205222,0.0014581243,0.0008616771,0.0006058674],"domain_scores_gemma":[0.9968277,0.00032490186,0.00038732018,0.0015523921,0.00070263824,0.00020501029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047760876,0.00050598,0.0006303997,0.0006887817,0.00024025537,0.00022818559,0.0046353647,0.00033682946,0.000020784726],"category_scores_gemma":[0.00016206567,0.00042688518,0.00010467304,0.00090801256,0.0010615328,0.0007880025,0.000789563,0.00054263964,0.000031900076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017355362,0.00028523649,0.00046444396,0.00043076085,0.000030941603,0.0002862627,0.010096605,0.010861472,0.00048635615,0.040768944,0.00020680824,0.93606484],"study_design_scores_gemma":[0.0015329856,0.0025025292,0.0015208226,0.0014034937,0.000036983405,0.0009529276,0.0000017363187,0.52043355,0.027306514,0.42575437,0.014386168,0.004167946],"about_ca_topic_score_codex":0.000043590902,"about_ca_topic_score_gemma":0.00016019745,"teacher_disagreement_score":0.93189687,"about_ca_system_score_codex":0.00012610391,"about_ca_system_score_gemma":0.0018464195,"threshold_uncertainty_score":0.9998183},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4863351,0.00035864022,0.23404369,0.0010165595,0.00031065877,0.00018895962,0.000003473413,0.00020122333,0.2775417],"genre_scores_gemma":[0.99647313,0.0000052963255,0.0006925311,0.0004799365,0.000047677426,0.0000031605516,0.0000022091183,0.0000043833656,0.0022916798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916136,0.000060518152,0.00014997392,0.00020549116,0.00020920028,0.00021343403],"domain_scores_gemma":[0.99881554,0.0006974143,0.00007125617,0.00032953586,0.00005594265,0.000030311143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024680077,0.000104400664,0.000108755965,0.000047709735,0.000101674996,0.000069931026,0.0005069137,0.000038371218,0.000071102],"category_scores_gemma":[0.000040767114,0.00005657588,0.000052153075,0.00025240242,0.000042611602,0.00010345772,0.00009466485,0.00008966263,0.00003422452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005386326,0.00008644501,0.0015712949,0.0000033436847,0.000010185949,0.0000027094645,0.00031803787,0.013172046,0.00009874053,0.9648024,0.019096723,0.00083268556],"study_design_scores_gemma":[0.001347123,0.00085170876,0.16927738,0.00012229351,0.000021716705,0.0000097569355,0.00043870427,0.29514706,0.013103105,0.50269246,0.016234094,0.0007546194],"about_ca_topic_score_codex":0.0002916961,"about_ca_topic_score_gemma":0.000049374783,"teacher_disagreement_score":0.51013803,"about_ca_system_score_codex":0.000027145716,"about_ca_system_score_gemma":0.000039383965,"threshold_uncertainty_score":0.23070973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040344942,0.00007025765,0.93933564,0.00024731402,0.00088929146,0.00011936577,3.2905044e-7,0.00016664555,0.018826237],"genre_scores_gemma":[0.9895404,0.0000062730637,0.009778916,0.00017267239,0.00026525118,0.0000046442137,0.0000011584583,0.000006083215,0.00022462498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986737,0.000039432,0.00030366427,0.00037641972,0.00023730082,0.0003695316],"domain_scores_gemma":[0.99907416,0.00016444385,0.000087562876,0.00036510997,0.00018938261,0.000119354045],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072383764,0.00012422877,0.000115425995,0.000111346606,0.00018150546,0.000121381534,0.0006086341,0.00008514807,0.0000446966],"category_scores_gemma":[0.00023364184,0.00011263339,0.000060910854,0.00061669137,0.00008989765,0.00043612218,0.00015110848,0.00015587412,0.0011312538],"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.0000054709153,0.000056098736,0.00010940945,0.0000014192908,0.000004381392,0.00001394755,0.0026564943,0.000029399962,0.0023618995,0.6263527,0.00006181124,0.36834696],"study_design_scores_gemma":[0.000031249117,0.00021001384,0.0027912657,0.000017876238,0.000009253298,0.000022584372,0.0009751295,0.053489916,0.5454494,0.39272526,0.003792689,0.0004853894],"about_ca_topic_score_codex":0.00013207136,"about_ca_topic_score_gemma":0.00036054078,"teacher_disagreement_score":0.94919544,"about_ca_system_score_codex":0.00007042546,"about_ca_system_score_gemma":0.00005949931,"threshold_uncertainty_score":0.9996465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5732637,0.00048905023,0.0005838925,0.003914696,0.00020546332,0.0007614255,0.0000034358295,0.0003416574,0.42043665],"genre_scores_gemma":[0.9519078,0.00014211088,0.0003576739,0.00018677254,0.00023784357,0.0000066819753,0.000011797786,0.00001093985,0.047138344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99670947,0.0012788675,0.00016846223,0.0005491343,0.0006901662,0.0006039206],"domain_scores_gemma":[0.99860066,0.0002916283,0.000044871336,0.0007752912,0.00011011089,0.00017740777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059177773,0.00016044475,0.0001632477,0.00040821134,0.00076382596,0.0004968931,0.002179625,0.00014620743,0.00016375302],"category_scores_gemma":[0.00002961156,0.00013235473,0.00009219749,0.002139585,0.00017047972,0.0030923137,0.00039177766,0.0005929678,0.0002710008],"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.00055029296,0.002612354,0.097040445,0.00019165972,0.00015801188,0.014490629,0.08497174,0.00010126873,0.0018285287,0.47520876,0.1288652,0.19398113],"study_design_scores_gemma":[0.0024524636,0.00087487214,0.31089193,0.00020982671,0.000020616351,0.00017004788,0.001200803,0.04706826,0.005029966,0.0019377316,0.629196,0.0009475101],"about_ca_topic_score_codex":0.00081712985,"about_ca_topic_score_gemma":0.00009160219,"teacher_disagreement_score":0.50033075,"about_ca_system_score_codex":0.00013712708,"about_ca_system_score_gemma":0.00023630894,"threshold_uncertainty_score":0.5874809},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008074726,0.004449002,0.96754473,0.00027140533,0.00023170389,0.0008581387,5.3719015e-7,0.00014034564,0.018429413],"genre_scores_gemma":[0.5822746,0.00007771058,0.41739976,0.00011130234,0.000022431324,0.000080437356,0.0000012220885,0.0000052005826,0.000027339334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976472,0.0009857331,0.00034209498,0.00043542677,0.00015479435,0.00043470834],"domain_scores_gemma":[0.99331695,0.0058264155,0.00032159797,0.00031328332,0.000135693,0.00008604146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060313195,0.00018931433,0.0003086524,0.0000882634,0.00016412087,0.00018771981,0.00045392112,0.00015156566,0.000007116456],"category_scores_gemma":[0.0071250983,0.00014690576,0.00006856693,0.00041611886,0.00018241737,0.0006593638,0.00011104534,0.00027718514,0.0000034937625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110263674,0.00026529474,0.00046598536,0.000073841125,0.000017450573,0.0000069537014,0.0020805649,0.000005352369,0.000023408822,0.7730833,0.0000010882816,0.22386646],"study_design_scores_gemma":[0.000406282,0.00072199845,0.000065276436,0.0001243337,0.000028732891,0.00007510544,0.0022698478,0.00024822308,0.00024161545,0.9860529,0.009545353,0.00022036568],"about_ca_topic_score_codex":0.000006881708,"about_ca_topic_score_gemma":0.0000052615874,"teacher_disagreement_score":0.57419986,"about_ca_system_score_codex":0.0000170168,"about_ca_system_score_gemma":0.000068069254,"threshold_uncertainty_score":0.8529923},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1999248,0.009774039,0.7222134,0.00012397682,0.0015509215,0.0005150527,0.0000020790724,0.00037324362,0.0655225],"genre_scores_gemma":[0.97705317,0.00018264713,0.01878003,0.000018622302,0.00015698091,0.000031231433,0.000005230614,0.000015509047,0.0037565539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982334,0.00030780575,0.00045181866,0.00052180537,0.00019754568,0.00028764256],"domain_scores_gemma":[0.9983997,0.00028908649,0.0002903714,0.0005455626,0.00029450105,0.00018082076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007042776,0.00019842524,0.0003799968,0.00016528954,0.00020710488,0.00016039588,0.000503182,0.000100015735,0.0000064883934],"category_scores_gemma":[0.0006429501,0.00016679808,0.00010700468,0.0003193852,0.00010785243,0.0003559487,0.00038262698,0.00011874868,0.00004020049],"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.000014470328,0.00017392251,0.032173805,0.00016666966,0.00006304255,0.0000034193054,0.0056800325,0.00040227853,0.0016091869,0.8925655,0.00016450493,0.06698315],"study_design_scores_gemma":[0.0020534385,0.00008537322,0.027305642,0.00023559779,0.000027734606,0.00006505466,0.000426234,0.93818694,0.0049884585,0.00035821198,0.025878647,0.00038866836],"about_ca_topic_score_codex":0.00014065258,"about_ca_topic_score_gemma":0.000060428258,"teacher_disagreement_score":0.9377847,"about_ca_system_score_codex":0.00003204281,"about_ca_system_score_gemma":0.00006440596,"threshold_uncertainty_score":0.6801829},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054387962,0.003942808,0.9754355,0.00013849819,0.0018960799,0.0003874942,0.0000011344157,0.00011168454,0.012648037],"genre_scores_gemma":[0.99678284,0.0002094,0.0002851305,0.00012771247,0.00024237086,0.000023230205,0.000002373899,0.000008760519,0.0023181548],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985778,0.00008940807,0.0003977781,0.00038272562,0.00020941785,0.00034290616],"domain_scores_gemma":[0.9991392,0.00015246299,0.00014809323,0.00033746494,0.000047108,0.00017566174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081778987,0.0001814058,0.00024475565,0.00010510551,0.0001283826,0.00019696109,0.00031144632,0.00008092041,0.000027968077],"category_scores_gemma":[0.000030775635,0.00014263381,0.0000765613,0.000091352114,0.00003992273,0.00027232696,0.000095165524,0.00012774662,0.0002632863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056165643,0.0011782878,0.04025491,0.0003734449,0.00082257594,0.00023054925,0.0052162446,0.0024189071,0.020734724,0.27548775,0.010049156,0.64267176],"study_design_scores_gemma":[0.0023183194,0.00074603874,0.024218798,0.00026059398,0.000070444694,0.00029009584,0.0011837201,0.45091945,0.0032954013,0.0007258773,0.515008,0.00096328586],"about_ca_topic_score_codex":0.00006806678,"about_ca_topic_score_gemma":0.000007206809,"teacher_disagreement_score":0.9913441,"about_ca_system_score_codex":0.00011095841,"about_ca_system_score_gemma":0.00001204433,"threshold_uncertainty_score":0.58164376},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003659485,0.0071648597,0.801259,0.00027095334,0.0024689941,0.00036728595,0.0000041852277,0.0001874222,0.18824074],"genre_scores_gemma":[0.5413564,0.0005820569,0.425787,0.0006777845,0.0047021946,0.00003834894,0.000020718813,0.0001350796,0.02670041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563164,0.00008280401,0.0007938111,0.0019184565,0.00078818353,0.00078512926],"domain_scores_gemma":[0.99559253,0.00084507145,0.0004936735,0.002086389,0.0007241089,0.00025822068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009508517,0.0007029725,0.00091108406,0.0011682461,0.00027586415,0.00034501756,0.004870618,0.00050430733,0.00006506169],"category_scores_gemma":[0.00021477438,0.0006161018,0.0003157158,0.0012530576,0.0011224066,0.00071899145,0.0022028922,0.0009388023,0.00018515393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069434136,0.00012088375,0.00009173086,0.00008043223,0.000022561426,0.000032052052,0.0040783715,0.0013372045,0.00011393303,0.13760717,0.0005002593,0.85600847],"study_design_scores_gemma":[0.0028817942,0.0013306865,0.0057976265,0.0030448043,0.000116643714,0.00076796947,0.0000032238863,0.31003588,0.029542066,0.5374154,0.103793524,0.0052704006],"about_ca_topic_score_codex":0.000018901339,"about_ca_topic_score_gemma":0.00029837037,"teacher_disagreement_score":0.85073805,"about_ca_system_score_codex":0.000335608,"about_ca_system_score_gemma":0.001097641,"threshold_uncertainty_score":0.999629},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79015726,0.0018851411,0.14950156,0.0002480009,0.0004715328,0.0004935083,0.0000010392428,0.00006721411,0.057174735],"genre_scores_gemma":[0.9916918,0.00008722393,0.007470682,0.000011991143,0.000047301717,0.000025536723,0.000002102285,0.000009929586,0.0006533876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998187,0.0003315495,0.00054519833,0.0004114956,0.00027468303,0.00025009492],"domain_scores_gemma":[0.9983172,0.00039901075,0.0004244931,0.00055741693,0.00021901418,0.00008287614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010780724,0.00015841686,0.00032318212,0.00016587053,0.00014900569,0.000049300368,0.0005407464,0.00009134592,0.0000057171355],"category_scores_gemma":[0.0012977079,0.00011845021,0.000106322026,0.0006670461,0.00012433501,0.0002775997,0.0004981249,0.00015176329,0.0000051911475],"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.00003001346,0.00026876733,0.31639317,0.0002552311,0.000041606752,0.000002018042,0.014823523,0.0022138145,0.0058930255,0.59639066,0.000044832723,0.063643344],"study_design_scores_gemma":[0.0014767258,0.00009241149,0.39023423,0.0010060425,0.000028324635,0.00003380888,0.00052634574,0.5708472,0.03121489,0.0030524177,0.0011921828,0.0002954141],"about_ca_topic_score_codex":0.00018710713,"about_ca_topic_score_gemma":0.00028648818,"teacher_disagreement_score":0.59333825,"about_ca_system_score_codex":0.00007423909,"about_ca_system_score_gemma":0.000120229786,"threshold_uncertainty_score":0.48302594},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31413347,0.00002437123,0.67261297,0.0016943064,0.0006118339,0.0011599042,0.000008459253,0.0001708724,0.009583799],"genre_scores_gemma":[0.99380964,0.0000061037963,0.005650357,0.00020666959,0.00010293922,0.000062332816,0.0000018959266,0.000013159679,0.00014687734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984142,0.00003769994,0.00039770728,0.0004964905,0.00028427737,0.00036959935],"domain_scores_gemma":[0.99843025,0.00028212238,0.00032691882,0.00023236765,0.0006366389,0.00009170775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000716669,0.00021121505,0.00028460915,0.00013834421,0.00016039457,0.00021699729,0.0012073572,0.000115767834,0.000009897987],"category_scores_gemma":[0.0010154455,0.00016349596,0.00010332393,0.0004140841,0.00019175264,0.0003914956,0.00013175115,0.00022445631,0.000024310766],"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.00012866993,0.00037733378,0.0005797289,0.00006102077,0.00000841509,3.6728767e-7,0.0029558649,0.00021911602,0.019879602,0.84955025,0.000026284317,0.12621337],"study_design_scores_gemma":[0.00015678896,0.00080459553,0.0005467883,0.00029808513,0.000018152725,0.0000021663434,0.0012062564,0.3764507,0.49115494,0.12901984,0.00004996411,0.00029172588],"about_ca_topic_score_codex":0.00005105852,"about_ca_topic_score_gemma":0.00016709662,"teacher_disagreement_score":0.7205304,"about_ca_system_score_codex":0.00004832061,"about_ca_system_score_gemma":0.00009756611,"threshold_uncertainty_score":0.6667172},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73031837,0.00022407463,0.2611887,0.00013448567,0.0012197384,0.0025613646,0.000013317545,0.00040093288,0.0039390153],"genre_scores_gemma":[0.9843619,0.000013976499,0.01442525,0.00025785292,0.00008751104,0.00006292649,0.0000072656103,0.00003364905,0.0007496836],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9970223,0.00011496596,0.0004629366,0.0011590647,0.00051826134,0.0007225107],"domain_scores_gemma":[0.99816567,0.000055325414,0.00023885719,0.00078388886,0.00022228932,0.0005339713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048004708,0.0004713239,0.0004675853,0.00013734226,0.00037669748,0.00044038208,0.0005216388,0.0001248017,0.0000056321282],"category_scores_gemma":[0.00004095025,0.00034649266,0.00010643286,0.00032743497,0.00009856452,0.00037019933,0.0002561222,0.00021592442,0.00017760441],"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.0013233953,0.015303855,0.013349175,0.0012214483,0.0024754864,0.0056927283,0.11699008,0.039695133,0.0047944034,0.15270224,0.0032295983,0.64322245],"study_design_scores_gemma":[0.026538044,0.013065245,0.6452294,0.004371793,0.0003612261,0.0009930024,0.006026462,0.25933522,0.0022926668,0.0024265728,0.032169953,0.007190432],"about_ca_topic_score_codex":0.0010273475,"about_ca_topic_score_gemma":0.00016313963,"teacher_disagreement_score":0.636032,"about_ca_system_score_codex":0.00032228514,"about_ca_system_score_gemma":0.00012599646,"threshold_uncertainty_score":0.99989873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021379141,0.00048479688,0.7822352,0.001305198,0.000423404,0.0001367658,3.370771e-7,0.00032259247,0.19371253],"genre_scores_gemma":[0.9811909,0.000026115122,0.015851649,0.0010603348,0.00012852711,0.000009413636,2.445094e-7,0.000002950692,0.0017298509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993955,0.000031202275,0.00006159989,0.00024428492,0.000097432305,0.00016998003],"domain_scores_gemma":[0.9995043,0.00006414022,0.000020257117,0.00028136245,0.000030519175,0.00009938549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022521119,0.00007089963,0.00007531163,0.00003173528,0.00007782628,0.00008728458,0.00034081374,0.00003297795,0.00003954387],"category_scores_gemma":[0.000051164516,0.000052345935,0.000017247012,0.00009626978,0.000025176982,0.000304757,0.00023370238,0.000048039758,0.00017225354],"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":[9.644883e-7,0.000035694527,0.006209343,0.000011452303,0.0000030422532,0.000006565436,0.0009936743,2.4840233e-7,0.00017773271,0.7851258,0.0015086074,0.20592688],"study_design_scores_gemma":[0.0022121258,0.0010215184,0.1839959,0.0000910518,0.000022459362,0.00026594754,0.000108871565,0.4961803,0.013030334,0.09302607,0.20840402,0.0016414193],"about_ca_topic_score_codex":0.000060397204,"about_ca_topic_score_gemma":0.0000862909,"teacher_disagreement_score":0.95981175,"about_ca_system_score_codex":0.0000057931175,"about_ca_system_score_gemma":0.000009051611,"threshold_uncertainty_score":0.22140282},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00260114,0.00004091915,0.8723204,0.00039757075,0.00013987452,0.0002789672,0.0000028319948,0.00014041559,0.124077894],"genre_scores_gemma":[0.8977598,0.000014526087,0.099740766,0.000479302,0.000018109537,0.000044150933,0.0000038941744,0.0000059781814,0.0019334957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991468,0.000018849132,0.00017538681,0.00022750076,0.00018500852,0.00024640627],"domain_scores_gemma":[0.9993774,0.000047724123,0.000051809875,0.00021483966,0.00017711874,0.00013109097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002659207,0.00011938249,0.00013089318,0.000058410067,0.000107795364,0.0000932726,0.00041702326,0.000066207394,0.0000043211694],"category_scores_gemma":[0.000049832004,0.000082806895,0.00005582351,0.00020990876,0.00003448908,0.0011578023,0.000035148245,0.000063179265,0.00002471984],"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.00007817302,0.0000561417,0.000017014325,0.000014130105,0.000014533916,0.000001433137,0.02412936,0.0052874642,0.000056080225,0.9523508,0.006503969,0.011490876],"study_design_scores_gemma":[0.0011729365,0.00017306216,0.000007921278,0.000008061734,0.000003983622,0.000003382203,0.0008358137,0.95444256,0.0015642716,0.030739836,0.010875489,0.00017265364],"about_ca_topic_score_codex":0.000008149252,"about_ca_topic_score_gemma":0.00025455165,"teacher_disagreement_score":0.94915515,"about_ca_system_score_codex":0.00011130985,"about_ca_system_score_gemma":0.0003934013,"threshold_uncertainty_score":0.33767673},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26923186,0.0003792295,0.66228575,0.0020971606,0.0016764858,0.0010762603,0.000008867323,0.0005240614,0.06272036],"genre_scores_gemma":[0.98874557,0.000009966427,0.010196248,0.00019280362,0.00012535282,0.0000396622,0.000001399498,0.000019355712,0.0006696656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997269,0.000041798972,0.00064300647,0.0007482834,0.0007045316,0.00059341296],"domain_scores_gemma":[0.99810755,0.0001172525,0.00046537645,0.00038561982,0.00063971145,0.00028445793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091573235,0.000348118,0.00040595556,0.00015730067,0.0002292758,0.00042401362,0.002488499,0.00015608157,0.000012850003],"category_scores_gemma":[0.000599406,0.00024759487,0.00015486145,0.0006445662,0.0003289673,0.0005146972,0.0007132264,0.00052428554,0.000104526676],"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.00014468734,0.0006337359,0.0042335866,0.0001018124,0.00004838038,0.000006135599,0.026717953,0.0018323315,0.0054990007,0.94394654,0.0020320315,0.014803814],"study_design_scores_gemma":[0.00016499902,0.00038279698,0.00067819067,0.0004948731,0.000023556315,0.000026600726,0.0042379615,0.84982693,0.049063455,0.093774535,0.00074652553,0.00057956716],"about_ca_topic_score_codex":0.00003248277,"about_ca_topic_score_gemma":0.0000020812884,"teacher_disagreement_score":0.850172,"about_ca_system_score_codex":0.00013682093,"about_ca_system_score_gemma":0.00022478832,"threshold_uncertainty_score":0.9999976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6180753,0.0010506642,0.22855815,0.00018015498,0.00055144954,0.00025106253,3.4003688e-7,0.0001730656,0.15115981],"genre_scores_gemma":[0.98562604,0.000096497715,0.013263302,0.000011553432,0.000091080095,0.000013269472,0.0000022636764,0.000008449538,0.0008875254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987689,0.00016519641,0.00033140913,0.00037356446,0.00013714097,0.00022375971],"domain_scores_gemma":[0.99898845,0.00030707484,0.00019018003,0.0003127042,0.000116301955,0.0000853171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072170055,0.00012292844,0.00022011643,0.00020936402,0.00011304222,0.00006508738,0.0002854365,0.00007153221,0.0000045568518],"category_scores_gemma":[0.000815435,0.0001116515,0.000057307818,0.00041283152,0.000054977787,0.0004317807,0.0002654862,0.00012508007,0.000012069665],"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.000013097404,0.00012602337,0.1881785,0.00013449516,0.00001665619,0.0000025464801,0.0059674093,0.00025342416,0.00303405,0.50659466,0.000035316792,0.2956438],"study_design_scores_gemma":[0.0014009657,0.00010321167,0.3271306,0.00033880665,0.000013507278,0.000047025485,0.0005241512,0.63421357,0.021345846,0.0043475265,0.010147746,0.0003870768],"about_ca_topic_score_codex":0.00004881895,"about_ca_topic_score_gemma":0.00012740759,"teacher_disagreement_score":0.6339601,"about_ca_system_score_codex":0.000034893594,"about_ca_system_score_gemma":0.000043818487,"threshold_uncertainty_score":0.45530158},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57150394,0.00025848052,0.421028,0.00022400558,0.00037825233,0.00010319039,0.0000021485193,0.00005241679,0.006449566],"genre_scores_gemma":[0.9963033,0.000016600412,0.0033845943,0.00012121735,0.00007042199,0.000005223627,0.000007604022,0.000002264435,0.000088726534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932086,0.000031840376,0.0001203496,0.00021362159,0.00014160371,0.00017172402],"domain_scores_gemma":[0.9997199,0.000024785266,0.000053940297,0.000107772925,0.000042866584,0.00005072005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119043325,0.00007405429,0.00006907097,0.000049312486,0.00018065571,0.00012733375,0.000113465016,0.00003119166,0.000117293326],"category_scores_gemma":[0.000020298397,0.00006919557,0.000018399604,0.00012786851,0.00006774945,0.0005343723,0.00006479514,0.00004304658,0.0001329642],"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.0000069155694,0.00031476165,0.039266966,0.000022136017,0.00003858469,0.00006788265,0.010151179,0.00005351826,0.010646387,0.8716426,0.00043538684,0.06735368],"study_design_scores_gemma":[0.012488691,0.0005613998,0.22141822,0.00017806563,0.00013112758,0.0008609245,0.0019763496,0.6479714,0.029319705,0.035100266,0.048075084,0.0019187445],"about_ca_topic_score_codex":0.000007991106,"about_ca_topic_score_gemma":0.000008571405,"teacher_disagreement_score":0.8365423,"about_ca_system_score_codex":0.00003076122,"about_ca_system_score_gemma":0.000012924542,"threshold_uncertainty_score":0.28217137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5042171,0.001041541,0.3754564,0.04325269,0.0032671962,0.0029544616,0.000016224138,0.0007864883,0.06900792],"genre_scores_gemma":[0.98056716,0.00009363722,0.010778763,0.00006469129,0.0006096987,0.0000120150835,0.000005276129,0.000018228522,0.007850525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956075,0.00030831347,0.00023713642,0.0010234587,0.0014951153,0.0013284972],"domain_scores_gemma":[0.9965187,0.00062103046,0.00012837251,0.0011531675,0.0008993902,0.00067937246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035959473,0.00028700114,0.0005772627,0.00136437,0.00045492454,0.0002690511,0.0032359,0.0002205788,0.0003096396],"category_scores_gemma":[0.00084497425,0.0003042513,0.00018131094,0.0025788208,0.0006227262,0.0013172484,0.0019913432,0.0007108972,0.000033138695],"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.0003482456,0.0015292591,0.039505735,0.000089015164,0.00015995216,0.0007103784,0.0965342,0.00006615689,0.003223517,0.0917462,0.5924873,0.17360005],"study_design_scores_gemma":[0.0068504456,0.0039475244,0.020547803,0.00076895143,0.000028262104,0.00003975048,0.024208516,0.017726067,0.001999751,0.054537304,0.8673878,0.0019578338],"about_ca_topic_score_codex":0.00023294402,"about_ca_topic_score_gemma":0.00021959258,"teacher_disagreement_score":0.47635007,"about_ca_system_score_codex":0.0002625926,"about_ca_system_score_gemma":0.00021165861,"threshold_uncertainty_score":0.99994093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31864715,0.16106603,0.22326458,0.11081762,0.0022378291,0.008406085,0.0000025174952,0.00053913996,0.17501906],"genre_scores_gemma":[0.9957966,0.00071217807,0.0027597374,0.00020584732,0.000028685417,0.000027173242,4.0746894e-8,0.000004443108,0.0004652617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978171,0.0014091096,0.00021641354,0.00017915551,0.00017362375,0.00020462098],"domain_scores_gemma":[0.99565357,0.0034207273,0.00034754054,0.0004412555,0.00010930492,0.000027573902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005000553,0.00011545778,0.00017130886,0.000012865744,0.0005366635,0.00013903782,0.0006707188,0.00005296443,0.0000031753696],"category_scores_gemma":[0.0029173065,0.0000427904,0.000048848935,0.00019810007,0.0016452563,0.00033876393,0.0004997678,0.00020447571,0.0000018830531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019702532,0.00006727378,0.00015524922,0.000044557375,0.00003993259,0.0000016904266,0.0074540917,0.000003958244,0.000076973105,0.88774997,0.000021295255,0.10418799],"study_design_scores_gemma":[0.0028940698,0.001022585,0.0007165351,0.00024966177,0.00050202035,0.0011964921,0.009258116,0.021877278,0.0034684956,0.87019503,0.088028625,0.00059108797],"about_ca_topic_score_codex":0.000009524386,"about_ca_topic_score_gemma":0.000004057089,"teacher_disagreement_score":0.6771495,"about_ca_system_score_codex":0.0000040649697,"about_ca_system_score_gemma":0.000015960293,"threshold_uncertainty_score":0.6062015},"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":"empirical","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8252927,0.0011552012,0.016937437,0.0016773208,0.12444863,0.00025270914,0.000004183402,0.00036447291,0.029867359],"genre_scores_gemma":[0.42353907,0.00003125801,0.005981881,0.0001868697,0.569891,2.5783473e-7,0.000005372496,0.000017400329,0.0003469198],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979423,0.00019712136,0.0005478818,0.00034440687,0.0005849737,0.0003832834],"domain_scores_gemma":[0.9983466,0.00028999327,0.0005701474,0.00023589023,0.00037946153,0.00017788945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045149287,0.00023128188,0.00041553844,0.00020658714,0.00030864787,0.0001354797,0.0006607829,0.0001169252,0.00020358039],"category_scores_gemma":[0.0004966742,0.00018987569,0.00015278897,0.0004898894,0.000058673726,0.00032297825,0.00015598588,0.0005681701,0.00013984769],"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.00011705596,0.00064914295,0.0032881945,0.0000150163805,0.00016785356,0.0008747382,0.009443469,0.00050382933,0.005952241,0.00045464127,0.9103072,0.06822659],"study_design_scores_gemma":[0.0025481423,0.0028962113,0.056999333,0.00028986137,0.00007443005,0.001462124,0.00088233,0.009768978,0.01359108,0.00008038023,0.9104595,0.0009476374],"about_ca_topic_score_codex":0.00004497575,"about_ca_topic_score_gemma":0.000006559671,"teacher_disagreement_score":0.44544235,"about_ca_system_score_codex":0.00014457421,"about_ca_system_score_gemma":0.00014606258,"threshold_uncertainty_score":0.7742906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014604613,0.000041300325,0.98720926,0.0031259877,0.00014542782,0.0009871989,0.0000049098003,0.00009849209,0.0069269803],"genre_scores_gemma":[0.9842773,0.00001681279,0.013731646,0.00051450415,0.00013601955,0.0010495278,0.000038485334,0.000008577562,0.0002270913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787736,0.00010676014,0.0004838233,0.0005202634,0.0007257849,0.0002860094],"domain_scores_gemma":[0.9981637,0.00044410277,0.00014952983,0.00025132557,0.0008391741,0.00015217016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083245465,0.00015562227,0.00014852025,0.00022093214,0.00020544206,0.0002875966,0.0008089987,0.00016150395,0.00019222009],"category_scores_gemma":[0.00091548456,0.00014911694,0.00005624193,0.00042140024,0.00010158203,0.00040600114,0.00009642527,0.00022232415,0.0006060987],"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.0000074482214,0.00023508203,0.000058119662,0.000008517575,0.0000033785436,3.8845448e-7,0.0002745444,0.00033992666,0.000581457,0.7088453,0.00021841243,0.2894274],"study_design_scores_gemma":[0.0000905566,0.000073150244,0.001995122,0.000093857896,0.0000021198964,0.00000290504,0.00014039048,0.8832988,0.005390216,0.10692151,0.0017660253,0.00022531679],"about_ca_topic_score_codex":0.00007156846,"about_ca_topic_score_gemma":0.0003154097,"teacher_disagreement_score":0.9828169,"about_ca_system_score_codex":0.0002554369,"about_ca_system_score_gemma":0.00039710733,"threshold_uncertainty_score":0.7790375},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041480956,0.0036167812,0.98680294,0.0006479999,0.0031016967,0.0003004312,0.0000036491156,0.00018799385,0.004923695],"genre_scores_gemma":[0.45723236,0.0004897977,0.53691494,0.0012189,0.0010688936,0.000021817114,0.000015493006,0.000058907503,0.002978892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996795,0.000047395188,0.0004470702,0.0013587866,0.0005969015,0.000754825],"domain_scores_gemma":[0.9975406,0.0003556532,0.00025709945,0.0013356267,0.00021464816,0.00029638348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008802413,0.00049119355,0.00049895316,0.00060963526,0.0004324042,0.00067438243,0.0023269292,0.00032355858,0.000032669748],"category_scores_gemma":[0.00010343915,0.0004199998,0.00012165549,0.0004768173,0.00096681295,0.00070690585,0.0010748898,0.00059207936,0.000101360805],"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.0000039613915,0.00003553535,0.00024868274,0.00003577876,0.000016804654,0.000022101434,0.002711362,0.0006359116,0.0005405084,0.4755364,0.000128626,0.5200843],"study_design_scores_gemma":[0.0009219724,0.00022311679,0.0015300259,0.00039795093,0.00004987461,0.00033314223,0.0000011540712,0.63613355,0.0033629988,0.32735702,0.027222909,0.0024662619],"about_ca_topic_score_codex":0.00003950785,"about_ca_topic_score_gemma":0.00010093427,"teacher_disagreement_score":0.6354977,"about_ca_system_score_codex":0.00014781444,"about_ca_system_score_gemma":0.00034277063,"threshold_uncertainty_score":0.9998252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07553704,0.00011050196,0.92207605,0.0008288815,0.000115398216,0.00077960687,0.0000034358793,0.0000864792,0.00046261866],"genre_scores_gemma":[0.9881816,0.00005162898,0.010590344,0.0009449541,0.00001994792,0.00015593982,0.0000028194138,0.0000075520525,0.00004519385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803114,0.0006561365,0.00045870975,0.0001629867,0.00039490877,0.00029612985],"domain_scores_gemma":[0.99753493,0.0009047478,0.00038184103,0.001014577,0.0001143724,0.000049531875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067504,0.00016058436,0.00023279368,0.00026988058,0.0001125854,0.00018030312,0.001280847,0.00012847054,0.0000026914197],"category_scores_gemma":[0.000700904,0.00009280616,0.00008081498,0.00062810926,0.00006402516,0.00060873304,0.00019363858,0.00022350141,0.0000120213335],"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.00004957955,0.00021740286,0.004009861,0.000055747663,0.000015574951,0.0000032726875,0.0031733615,0.03800767,0.0007803612,0.93435323,0.005783186,0.013550756],"study_design_scores_gemma":[0.00029333917,0.00030070715,0.028454755,0.00010899622,0.000007539326,0.000018132556,0.00006254619,0.962827,0.0019942487,0.0037827382,0.0020073797,0.00014260501],"about_ca_topic_score_codex":0.0023899116,"about_ca_topic_score_gemma":0.00012743524,"teacher_disagreement_score":0.9305705,"about_ca_system_score_codex":0.00009337932,"about_ca_system_score_gemma":0.000085594176,"threshold_uncertainty_score":0.37845257},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007627523,0.00010505478,0.033418115,0.000014629067,0.00037506744,0.00025450898,0.000023260787,0.00037880227,0.96535426],"genre_scores_gemma":[0.003195336,0.000012324459,0.0022744748,0.000058863618,0.00018091338,6.302789e-7,0.000014916916,0.000035757617,0.99422675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833703,0.000029318553,0.0001416566,0.0007724658,0.00031394616,0.00040557396],"domain_scores_gemma":[0.9981591,0.00008838793,0.0002418144,0.0010317424,0.0002142558,0.0002647149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000109350745,0.0004449553,0.00041644575,0.00019003115,0.00034657796,0.00015147687,0.0017142821,0.00047758568,0.000005517431],"category_scores_gemma":[0.00000812275,0.00042024345,0.00016765739,0.000013881801,0.00027069234,0.00019830084,0.0008223451,0.0009486171,0.000029943734],"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.00003458908,0.000007855805,0.000007893087,0.000032714415,0.000081400314,0.0008492044,0.00019730846,0.0000033768172,0.00003311631,0.991539,0.005971782,0.0012417474],"study_design_scores_gemma":[0.00055892713,0.00010848913,0.000036662554,0.00015953594,0.000079060796,0.00008575371,0.000013337571,0.00034614565,0.00038233475,0.00008217578,0.99751437,0.00063318235],"about_ca_topic_score_codex":0.00008109755,"about_ca_topic_score_gemma":0.000007832445,"teacher_disagreement_score":0.99154264,"about_ca_system_score_codex":0.00011698139,"about_ca_system_score_gemma":0.00021396305,"threshold_uncertainty_score":0.99982494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.747976,0.0019791634,0.09041691,0.0036735176,0.003599285,0.0026148427,0.000009210316,0.00027091568,0.14946014],"genre_scores_gemma":[0.9973082,0.00013841949,0.0005698665,0.000009052441,0.00021166696,0.0000090140275,0.000002337954,0.000010068147,0.0017413505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965168,0.0006577812,0.00029996972,0.00061465404,0.0012080481,0.00070272095],"domain_scores_gemma":[0.99560565,0.00212492,0.0001990736,0.0010651909,0.0007687492,0.0002364213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00588734,0.00021117252,0.00043590178,0.00081048097,0.0003752455,0.000058622078,0.0025836562,0.00017043759,0.00037587932],"category_scores_gemma":[0.00080740685,0.00016288123,0.00016295265,0.0016551784,0.0005925958,0.00047460195,0.001208369,0.00065419334,0.000027545091],"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.00040549578,0.002790085,0.007309463,0.0001974057,0.00015074493,0.000111626505,0.0768307,0.00058984244,0.0046820035,0.47192594,0.3800122,0.054994468],"study_design_scores_gemma":[0.0076784776,0.0058820075,0.010991609,0.004090213,0.000049665847,0.000021026706,0.04054368,0.6572371,0.0062882244,0.04176798,0.22377867,0.0016713289],"about_ca_topic_score_codex":0.00027270702,"about_ca_topic_score_gemma":0.000051251434,"teacher_disagreement_score":0.65664726,"about_ca_system_score_codex":0.00014444314,"about_ca_system_score_gemma":0.00019897403,"threshold_uncertainty_score":0.6642104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016805308,0.00008275609,0.81554645,0.0012507279,0.0024667396,0.0002393873,0.0000064872993,0.00025925363,0.16334286],"genre_scores_gemma":[0.9955771,0.000024439189,0.0030121894,0.00012562303,0.00025064714,0.000046844296,0.0000070823235,0.000009883068,0.0009462227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978253,0.000096112606,0.00036555808,0.0005872956,0.0008113168,0.0003144005],"domain_scores_gemma":[0.9980987,0.00007991788,0.00016465025,0.00047521348,0.00094258774,0.00023897925],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040250676,0.00023354072,0.00020647496,0.00017673883,0.0000939775,0.00076448685,0.0018398317,0.00008437965,0.00008952783],"category_scores_gemma":[0.00017503969,0.00017571912,0.000049142756,0.0002909465,0.00013904147,0.00057386287,0.00018429308,0.00022207825,0.0010560704],"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.000049009206,0.00012238049,0.00018103268,0.0000035787968,0.000026863685,0.000028452081,0.00089159934,0.002696176,0.0002028456,0.9693423,0.00015747511,0.026298294],"study_design_scores_gemma":[0.00009099526,0.0007338932,0.00019930239,0.00015037954,0.000007503865,0.000050518243,0.0011093852,0.733997,0.0080846045,0.25135946,0.003708932,0.0005080592],"about_ca_topic_score_codex":0.00017040355,"about_ca_topic_score_gemma":0.000103399674,"teacher_disagreement_score":0.97877175,"about_ca_system_score_codex":0.000110645946,"about_ca_system_score_gemma":0.00030676604,"threshold_uncertainty_score":0.9997217},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017391622,0.007342553,0.97103125,0.000081522754,0.0019817697,0.00082248414,0.000006527944,0.00020172453,0.0011405317],"genre_scores_gemma":[0.92043304,0.00013109039,0.07466979,0.0001245085,0.00018500265,0.00011437395,0.0000059848944,0.000027370263,0.0043088133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825263,0.00016351555,0.0003775835,0.00062171015,0.00013464896,0.000449911],"domain_scores_gemma":[0.9986817,0.00019810855,0.00019228898,0.0004095635,0.00012287432,0.0003954599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012509848,0.00026389022,0.0004045254,0.00009876016,0.00024358339,0.00047420687,0.00037420218,0.000100849764,0.0000023909847],"category_scores_gemma":[0.00020744004,0.00021198213,0.00007261861,0.00009098468,0.000059243408,0.0002903315,0.00028860988,0.000089663845,0.000017453616],"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.000066352775,0.0010669448,0.026909452,0.0018014462,0.0007597348,0.00015782168,0.054130822,0.00070385006,0.0021941047,0.10561174,0.028440781,0.77815694],"study_design_scores_gemma":[0.0019234064,0.00024597844,0.005873594,0.000083344275,0.000051919815,0.00009874158,0.000561604,0.81803924,0.0001637234,0.00038832985,0.17206052,0.00050957076],"about_ca_topic_score_codex":0.00022829628,"about_ca_topic_score_gemma":0.000011586784,"teacher_disagreement_score":0.9030414,"about_ca_system_score_codex":0.00008608238,"about_ca_system_score_gemma":0.00008933196,"threshold_uncertainty_score":0.86443806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027996877,0.000044684923,0.9631725,0.0011727933,0.0011164953,0.00010279948,8.261579e-7,0.00023283392,0.0061601736],"genre_scores_gemma":[0.9965777,0.00003637452,0.0022501706,0.00010418467,0.00022572643,0.000014351876,7.236166e-7,0.0000062513336,0.0007845255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988251,0.00008039269,0.00024424886,0.00035788352,0.00021058075,0.0002818221],"domain_scores_gemma":[0.9990564,0.00021583335,0.00008844798,0.00040283496,0.00015593518,0.00008053939],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036055836,0.00012291949,0.000109253146,0.0000700695,0.0002300996,0.00018889607,0.00051947124,0.00007069055,0.000108203305],"category_scores_gemma":[0.00033376907,0.00008122114,0.00006345562,0.00031457958,0.00013442956,0.00072132924,0.0001185585,0.0000656439,0.0015929209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058020178,0.000026497099,0.000037103477,0.0000014752245,0.0000035211397,0.0000020831023,0.00079980877,0.0000039305446,0.0071184537,0.63950366,0.000053514534,0.35244414],"study_design_scores_gemma":[0.000017669077,0.00007233631,0.00023682455,0.000015013613,0.0000037150176,0.0000065308814,0.00013171519,0.0067668357,0.314371,0.6764714,0.0017482002,0.00015875392],"about_ca_topic_score_codex":0.000052875675,"about_ca_topic_score_gemma":0.00023955171,"teacher_disagreement_score":0.96858084,"about_ca_system_score_codex":0.000076208824,"about_ca_system_score_gemma":0.000073023286,"threshold_uncertainty_score":0.9991844},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.792159,0.016901111,0.120820075,0.007439211,0.0053970865,0.004774833,0.00026226576,0.0017543992,0.050492007],"genre_scores_gemma":[0.96478665,0.0005320926,0.021241188,0.003386372,0.0012706167,0.0005114481,0.00009547342,0.00022235536,0.007953829],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9854814,0.0013364848,0.0026679572,0.002191676,0.0020199378,0.0063025635],"domain_scores_gemma":[0.986995,0.0020514843,0.0016793209,0.0028041836,0.0015731206,0.0048969067],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0061579305,0.0020063997,0.0020840557,0.0008942247,0.0014843345,0.0030626934,0.0048841084,0.0020456398,0.00068737473],"category_scores_gemma":[0.004032511,0.0019820894,0.0011748581,0.0024383161,0.0018431299,0.002269497,0.0017450656,0.0031359345,0.00070094975],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011456048,0.002992176,0.67562085,0.0015473918,0.0016362157,0.0025097632,0.07865455,0.0012710695,0.00044300832,0.07714467,0.10961924,0.047415487],"study_design_scores_gemma":[0.02452562,0.005723947,0.29143724,0.013915333,0.003921473,0.02827656,0.043504685,0.4034691,0.00875864,0.030491997,0.12925382,0.016721597],"about_ca_topic_score_codex":0.0006974907,"about_ca_topic_score_gemma":0.0004624281,"teacher_disagreement_score":0.40219802,"about_ca_system_score_codex":0.0034243767,"about_ca_system_score_gemma":0.01987031,"threshold_uncertainty_score":0.9998156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056476407,0.000010378519,0.86388797,0.006238953,0.0029415747,0.00027480363,0.000014575261,0.00023127961,0.12075284],"genre_scores_gemma":[0.9909049,0.000012302788,0.005505493,0.0027870908,0.0005635616,0.000030261686,0.000017155178,0.000009342148,0.00016984642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974152,0.00006621016,0.00056124775,0.0006837253,0.000832991,0.00044066104],"domain_scores_gemma":[0.998362,0.00019640978,0.00022671543,0.00049621693,0.0005227006,0.00019597035],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007418838,0.00027484138,0.00020066834,0.00025509976,0.0001499759,0.00034726813,0.0012221404,0.00013314158,0.00039543898],"category_scores_gemma":[0.00037667403,0.00025481576,0.00013871903,0.00039769107,0.000117134994,0.00037653188,0.00014604944,0.00023580094,0.0016575019],"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.000059178376,0.00026479273,0.00022637295,0.0000027743324,0.000008555345,0.00003134916,0.00029739915,0.00012997919,0.00030060962,0.7130979,0.00013195374,0.28544915],"study_design_scores_gemma":[0.00016607296,0.00088954373,0.0140374955,0.0002576836,0.000009165922,0.000020750635,0.0002354219,0.69704235,0.06167292,0.2196566,0.0052199475,0.00079203496],"about_ca_topic_score_codex":0.00010732518,"about_ca_topic_score_gemma":0.0002401351,"teacher_disagreement_score":0.9852573,"about_ca_system_score_codex":0.0003134819,"about_ca_system_score_gemma":0.0001429497,"threshold_uncertainty_score":0.9999904},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8234304,0.0012448947,0.15016389,0.0017628717,0.00042015404,0.00042870137,0.0000029557903,0.00014395356,0.022402162],"genre_scores_gemma":[0.991867,0.000010876554,0.0077876076,0.000105899795,0.00003676498,0.000004702442,0.0000022382555,0.0000027554709,0.00018215325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990525,0.00012443872,0.00025893212,0.00027804993,0.00013586062,0.00015017444],"domain_scores_gemma":[0.9992046,0.00009264449,0.00007933765,0.00036310364,0.0001690737,0.00009125062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554059,0.000083983476,0.0001669259,0.00007222326,0.00004025246,0.00005967576,0.0001735943,0.0000581146,0.000018081604],"category_scores_gemma":[0.00033513724,0.000066596716,0.00003392848,0.0003025617,0.000033222124,0.0006378948,0.00014118305,0.00008039413,0.000015091849],"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.00008282764,0.0018364945,0.22383593,0.0002524314,0.000035741516,0.0016579024,0.03946752,0.0002491627,0.0024585521,0.39757082,0.086125225,0.2464274],"study_design_scores_gemma":[0.0061965487,0.0020435008,0.014209772,0.0003254293,0.000045049495,0.0012351123,0.0015718089,0.8732017,0.037928518,0.018343529,0.043104865,0.0017941237],"about_ca_topic_score_codex":0.0026990587,"about_ca_topic_score_gemma":0.0011856031,"teacher_disagreement_score":0.8729526,"about_ca_system_score_codex":0.00006122571,"about_ca_system_score_gemma":0.00006438505,"threshold_uncertainty_score":0.40801877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44184026,0.00006891389,0.5230374,0.0027544377,0.00059808017,0.0006118528,0.0000047379112,0.00013905272,0.030945305],"genre_scores_gemma":[0.98609674,0.00006940783,0.013363728,0.00017010252,0.000060144976,0.00006228705,0.000004250152,0.000008249987,0.00016506373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981627,0.0000763924,0.0005332453,0.00051969656,0.00042142576,0.00028655853],"domain_scores_gemma":[0.99862677,0.00015841173,0.0002649706,0.0002859978,0.000562539,0.000101328835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003628388,0.00020570388,0.0002689308,0.00038558195,0.000073708026,0.00033828086,0.0006207709,0.00009262386,0.00026021033],"category_scores_gemma":[0.00036491375,0.00016670534,0.00004302531,0.00045167212,0.00017581166,0.0006013363,0.00021136258,0.00025394344,0.0001431117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021031019,0.00020736639,0.004141186,0.000006360149,0.000020367532,0.000007762031,0.0009901955,0.0002881999,0.0025120825,0.94110394,0.000027862492,0.05067367],"study_design_scores_gemma":[0.00027938778,0.001170341,0.056135222,0.0006869311,0.000011483066,0.00007063467,0.00071687,0.35062617,0.07656531,0.5127571,0.0003082844,0.0006722673],"about_ca_topic_score_codex":0.00040904077,"about_ca_topic_score_gemma":0.0004075158,"teacher_disagreement_score":0.5442565,"about_ca_system_score_codex":0.00007505698,"about_ca_system_score_gemma":0.00010952801,"threshold_uncertainty_score":0.6798047},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005105471,0.00093057076,0.98371226,0.0005393583,0.000613442,0.00028152423,0.0000025073946,0.00025299363,0.013156829],"genre_scores_gemma":[0.37505665,0.000020744585,0.62279576,0.0011061709,0.00057817786,0.0000063525963,0.000006109352,0.000045665915,0.00038440345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965535,0.00004759295,0.00041216306,0.0014578148,0.00083223375,0.00069668656],"domain_scores_gemma":[0.9975605,0.0004458355,0.00029686457,0.0009217599,0.0003850098,0.0003900238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001036468,0.0005240581,0.00052324875,0.0005501317,0.00047753903,0.0007494931,0.0018450498,0.00023151045,0.0000072713515],"category_scores_gemma":[0.00017690739,0.00041883916,0.000059933638,0.00071054377,0.0013459239,0.00061447395,0.0014202539,0.00076845894,0.000029082368],"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.0000034496436,0.000050393068,0.001323015,0.000111252564,0.000038129336,0.00014859483,0.008064158,0.028485006,0.0000962123,0.39451513,0.0001777155,0.5669869],"study_design_scores_gemma":[0.00043601403,0.0003336644,0.0003583815,0.0007646589,0.00001698665,0.0003091063,0.0000010347638,0.6707017,0.00020891715,0.32430026,0.0016664864,0.0009028492],"about_ca_topic_score_codex":0.000026973423,"about_ca_topic_score_gemma":0.00020154833,"teacher_disagreement_score":0.6422166,"about_ca_system_score_codex":0.00019728328,"about_ca_system_score_gemma":0.0007949388,"threshold_uncertainty_score":0.9998264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8830837,0.0041038278,0.06159954,0.013025777,0.0005555578,0.001953832,0.000021918771,0.00023374075,0.0354221],"genre_scores_gemma":[0.9968631,0.00006881532,0.0017883604,0.000022620388,0.00007981051,0.0000015333627,0.000016478722,0.0000054499897,0.0011537821],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99716353,0.0006728834,0.00014968278,0.00054802955,0.0009415684,0.0005243182],"domain_scores_gemma":[0.99783206,0.00022431849,0.000080984624,0.0010017945,0.00070117845,0.00015965386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038656427,0.00012333231,0.00020234275,0.00041777774,0.00026038263,0.00008439945,0.0023459313,0.00007136214,0.000014118519],"category_scores_gemma":[0.00082925207,0.000102612554,0.0000623314,0.0014751554,0.0004623105,0.0007116167,0.0007363657,0.000429388,0.00024989227],"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.00030919883,0.0027227849,0.015906444,0.00030940882,0.00014977677,0.0013834491,0.38356012,0.0007579701,0.0031070267,0.07697345,0.3063855,0.2084349],"study_design_scores_gemma":[0.009132989,0.003981192,0.21113968,0.0003410435,0.00005757275,0.00043898527,0.056987926,0.029783227,0.007860995,0.030119278,0.6480607,0.0020964167],"about_ca_topic_score_codex":0.0025571468,"about_ca_topic_score_gemma":0.0008509218,"teacher_disagreement_score":0.34167522,"about_ca_system_score_codex":0.00028438805,"about_ca_system_score_gemma":0.0006130056,"threshold_uncertainty_score":0.43593627},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39867383,0.003093793,0.5352847,0.018251568,0.00068165077,0.0039942325,0.000045794324,0.0006139105,0.03936049],"genre_scores_gemma":[0.9800687,0.00017359252,0.018267581,0.00055918575,0.00018953823,0.0000137308825,0.000013921903,0.000023028142,0.00069072645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961081,0.00058216933,0.0006881283,0.0013162734,0.00040008232,0.0009052339],"domain_scores_gemma":[0.9977392,0.00039923427,0.0002946272,0.0010102065,0.0002347853,0.00032194797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003935582,0.00047717162,0.00077313185,0.000299687,0.00023549965,0.000105099236,0.0015362696,0.00029746324,0.0001134671],"category_scores_gemma":[0.00028771392,0.0004248342,0.00011698841,0.00067064643,0.000663075,0.00023710523,0.0010367094,0.00045934957,0.000011277274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004735522,0.0016476938,0.0063108085,0.00013647642,0.000023523782,0.00006749567,0.0024933596,0.010721949,0.000047910646,0.9678259,0.0026439072,0.0076074065],"study_design_scores_gemma":[0.0039728694,0.0018403959,0.08487315,0.00017475375,0.0000612055,0.00016783443,0.0011627339,0.06305949,0.00027438678,0.7674177,0.07541233,0.001583093],"about_ca_topic_score_codex":0.00028242922,"about_ca_topic_score_gemma":0.00071002124,"teacher_disagreement_score":0.58139485,"about_ca_system_score_codex":0.000250031,"about_ca_system_score_gemma":0.000119096236,"threshold_uncertainty_score":0.99982035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022694675,0.0009020371,0.86613506,0.000055551296,0.00022244784,0.00037962725,8.0752625e-7,0.00020885265,0.10940096],"genre_scores_gemma":[0.84538823,0.0000017321545,0.14830868,0.000034004104,0.00038356346,0.000025711408,0.0000037833254,0.000016497903,0.0058378214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892145,0.00006287432,0.00011020759,0.00045530227,0.0000910129,0.0003591295],"domain_scores_gemma":[0.9991557,0.0003131581,0.00008530394,0.0002604886,0.00010914442,0.00007623289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033209132,0.00017872179,0.00020596979,0.00008292372,0.00024441342,0.00015842974,0.00023539053,0.00008820801,0.0000011365198],"category_scores_gemma":[0.00011356964,0.00015550895,0.000060827453,0.00020434966,0.00005224273,0.00015100502,0.00017541797,0.000123895,0.000010578329],"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.00014575277,0.0008436584,0.008835297,0.0007597448,0.0002078343,0.00006276495,0.12783177,0.0007222832,0.00784037,0.1861545,0.081166215,0.5854298],"study_design_scores_gemma":[0.003706935,0.000543498,0.021666003,0.00018295848,0.00007428226,0.00020243954,0.0024481427,0.87315375,0.018865585,0.010308785,0.0673964,0.0014512172],"about_ca_topic_score_codex":0.000113939226,"about_ca_topic_score_gemma":0.000023114604,"teacher_disagreement_score":0.87243146,"about_ca_system_score_codex":0.00004521791,"about_ca_system_score_gemma":0.00004133478,"threshold_uncertainty_score":0.6341471},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09854816,0.00005937207,0.77595514,0.013651083,0.0022212344,0.00086126593,0.000005870737,0.00021892543,0.108478956],"genre_scores_gemma":[0.9966279,0.000038195943,0.0015179048,0.0010921542,0.00021891865,0.00013765007,0.000011321141,0.000008591591,0.00034731848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975001,0.00021392335,0.0006275567,0.0005734948,0.0006732631,0.0004116697],"domain_scores_gemma":[0.99827117,0.00028454865,0.00023038294,0.0005159221,0.0006046307,0.000093342285],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007886696,0.00024357838,0.00022707366,0.00022535886,0.00016309935,0.0009426313,0.0018025002,0.00010350204,0.000517251],"category_scores_gemma":[0.000717354,0.00017784645,0.00011314411,0.00039735084,0.0001451225,0.0006205116,0.00018837868,0.00040295118,0.0019081099],"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.00000892358,0.00014206873,0.00013556248,0.000002181813,0.000009647106,0.000018151955,0.0027662397,0.0007965435,0.0008800155,0.82345796,0.00031729962,0.17146543],"study_design_scores_gemma":[0.000078121775,0.00016232689,0.006314888,0.00014956847,0.000004263619,0.000030661355,0.0015228457,0.7642715,0.0047369944,0.22139332,0.00096719584,0.0003683133],"about_ca_topic_score_codex":0.0011514943,"about_ca_topic_score_gemma":0.0005943179,"teacher_disagreement_score":0.8980798,"about_ca_system_score_codex":0.00015344129,"about_ca_system_score_gemma":0.00014207953,"threshold_uncertainty_score":0.998869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07299673,0.00035833413,0.9153126,0.0021603156,0.00047748743,0.00069123745,9.4025535e-7,0.00042131956,0.007581057],"genre_scores_gemma":[0.96530426,0.00002034605,0.03416,0.00022755879,0.00020986056,0.00002792039,0.000002059642,0.000008669244,0.0000393187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985319,0.000087823944,0.00027956138,0.0005848038,0.00018817137,0.00032773192],"domain_scores_gemma":[0.9993228,0.00009629471,0.00009434529,0.0002730152,0.00008295723,0.00013063129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030934098,0.00016288106,0.00014157037,0.00017508611,0.0001658107,0.00023074976,0.000287588,0.000093319744,0.000032162425],"category_scores_gemma":[0.00031379395,0.00015368553,0.000034381308,0.0006341143,0.000081577346,0.0005444836,0.000046269015,0.00020888897,0.00010040254],"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.000020037995,0.0003691212,0.00045970306,0.000016222997,0.0000021137375,0.000019809493,0.0032817968,0.00049698283,0.00039331106,0.51385045,0.000045328787,0.48104516],"study_design_scores_gemma":[0.000083269406,0.0009469291,0.0005839407,0.0001221022,0.000006502911,0.000032390577,0.0008837831,0.6191715,0.009916172,0.36755425,0.00028461806,0.0004145247],"about_ca_topic_score_codex":0.000096010954,"about_ca_topic_score_gemma":0.00027261578,"teacher_disagreement_score":0.8923075,"about_ca_system_score_codex":0.000059217484,"about_ca_system_score_gemma":0.00004304994,"threshold_uncertainty_score":0.62671137},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024211373,0.0035124994,0.97822493,0.00022809298,0.0017141444,0.00019047214,0.0000023988562,0.00017523703,0.015710082],"genre_scores_gemma":[0.44991815,0.00034308113,0.54445976,0.0018511303,0.0022032037,0.000009272951,0.000005502455,0.00006142024,0.001148484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969287,0.000031896103,0.00037235662,0.0012509043,0.00057270867,0.0008434255],"domain_scores_gemma":[0.9981397,0.00033968847,0.0002223151,0.00092123036,0.00011918575,0.0002579021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009279126,0.00048242815,0.00045839272,0.0004943211,0.0003733594,0.0005917844,0.002089029,0.0003036688,0.000014465472],"category_scores_gemma":[0.00007425623,0.000414994,0.00008794837,0.00032330252,0.0005119894,0.00065066636,0.0017830569,0.00065202883,0.00004339302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017858603,0.000016666223,0.00065719517,0.00004171595,0.000010099465,0.00005855313,0.0025171828,0.0008696936,0.00022981086,0.12115262,0.00003527071,0.87440944],"study_design_scores_gemma":[0.0008164326,0.00032201296,0.0016510725,0.0010688158,0.000039926752,0.00089423097,9.987656e-7,0.64075863,0.0036306072,0.32088724,0.02689149,0.0030385195],"about_ca_topic_score_codex":0.000023922526,"about_ca_topic_score_gemma":0.0000664329,"teacher_disagreement_score":0.8713709,"about_ca_system_score_codex":0.00015383624,"about_ca_system_score_gemma":0.00022662159,"threshold_uncertainty_score":0.9998302},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016318245,0.00014512983,0.99648595,0.00013931264,0.00020650293,0.0009102997,0.000009647087,0.00007239022,0.00039891514],"genre_scores_gemma":[0.47169805,0.0000033469796,0.52784216,0.000117073854,0.00014742838,0.00007870981,0.00004771411,0.000013079372,0.000052410247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970176,0.00004254284,0.00056664844,0.0012828206,0.0006058409,0.0004845127],"domain_scores_gemma":[0.99780864,0.00040180396,0.00034697045,0.0009484395,0.0003690378,0.00012514122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011297937,0.00034777276,0.0005776156,0.0012909406,0.00012389505,0.00029957463,0.002152367,0.0002806949,0.0000159183],"category_scores_gemma":[0.00004617397,0.00031721866,0.00019804113,0.0014471647,0.0003757429,0.00056904793,0.00027463897,0.00029857675,0.000009983665],"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.000007073861,0.00011007732,0.00044476657,0.00005087296,0.000038290073,0.000004475863,0.0022731717,0.077855736,0.00010889554,0.04618011,0.0000066156786,0.8729199],"study_design_scores_gemma":[0.00027084805,0.00017320996,0.0011042648,0.00005411546,0.000026278474,0.000006292008,6.3223666e-7,0.91227454,0.00008779613,0.08512136,0.0005122073,0.00036847792],"about_ca_topic_score_codex":0.000046762187,"about_ca_topic_score_gemma":0.00069641933,"teacher_disagreement_score":0.87255144,"about_ca_system_score_codex":0.00019150728,"about_ca_system_score_gemma":0.00032870294,"threshold_uncertainty_score":0.999928},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7750168,0.0025458117,0.20809376,0.0002668872,0.0017606306,0.0011630997,0.00016387043,0.00041621923,0.010572931],"genre_scores_gemma":[0.9961892,0.0015925515,0.0013805192,0.00010449336,0.00009732335,0.000009016315,0.000045757693,0.000015918695,0.0005652416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731606,0.00034671562,0.00023892468,0.0015577086,0.00010603997,0.00043455962],"domain_scores_gemma":[0.99767464,0.0002216939,0.00022090021,0.0013541306,0.0002498095,0.00027883035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066858943,0.00039960694,0.0005285095,0.00029093196,0.000109303845,0.00013831689,0.0013942923,0.00023510307,0.000028418825],"category_scores_gemma":[0.00017952833,0.00041561,0.00011030075,0.00061587803,0.00022017365,0.0008051358,0.003769658,0.00062086945,0.00007963875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062895306,0.0007190199,0.32569808,0.00030718552,0.00021152008,0.0013223356,0.0030126953,0.005692121,0.000008430089,0.65255475,0.007618354,0.0027926117],"study_design_scores_gemma":[0.0044047204,0.00037319516,0.06873453,0.0012472242,0.00046873966,0.00005425134,0.0015630451,0.245374,0.0006193677,0.61507934,0.05725188,0.00482973],"about_ca_topic_score_codex":0.0020818056,"about_ca_topic_score_gemma":0.0013519676,"teacher_disagreement_score":0.25696355,"about_ca_system_score_codex":0.0003130587,"about_ca_system_score_gemma":0.00037265223,"threshold_uncertainty_score":0.9998296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22260825,0.0047922283,0.44703546,0.00024777543,0.0036382054,0.0025965804,0.000014950512,0.0009879469,0.3180786],"genre_scores_gemma":[0.7576751,0.00018297942,0.016839163,0.00033756837,0.00065085414,0.00027711163,0.0009706941,0.00008434802,0.22298218],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982283,0.000060094597,0.00021252083,0.00073034305,0.00028292212,0.00048579075],"domain_scores_gemma":[0.99861944,0.00015161747,0.0002916382,0.00039661175,0.00039278032,0.00014791395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021938204,0.00035662265,0.00039586623,0.00014311259,0.0002420382,0.00022714678,0.00074714463,0.00029659923,0.000034985635],"category_scores_gemma":[0.00034580854,0.00034699778,0.000216238,0.00026475202,0.000018585766,0.00019586552,0.000058138965,0.0002548831,0.00015744501],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009460177,0.0015280829,0.0016974871,0.0013875762,0.0009806984,0.0004068284,0.19019245,0.00008418048,0.0005742896,0.075930946,0.06842273,0.6578487],"study_design_scores_gemma":[0.020203367,0.0057697613,0.5242675,0.012705899,0.0019356591,0.0001903402,0.025887841,0.24085417,0.055511247,0.04696394,0.052465174,0.013245098],"about_ca_topic_score_codex":0.000061784434,"about_ca_topic_score_gemma":0.00023405474,"teacher_disagreement_score":0.6446036,"about_ca_system_score_codex":0.00007762623,"about_ca_system_score_gemma":0.00019843473,"threshold_uncertainty_score":0.9998982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7757457,0.0017868638,0.15990473,0.0052146264,0.0007118815,0.00041494667,0.0000064465517,0.00034177868,0.055873036],"genre_scores_gemma":[0.98443097,0.00018814436,0.014796083,0.00014498769,0.000119342854,0.000010978015,2.6170142e-7,0.00000452252,0.00030473564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864936,0.000091675916,0.00022176224,0.0005104615,0.00019462752,0.00033212063],"domain_scores_gemma":[0.99903184,0.0002477869,0.000112678936,0.00040459115,0.000117630174,0.00008548516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422115,0.0001657543,0.00029529157,0.000044803353,0.00013176251,0.000038502738,0.00056718563,0.00010380692,0.000028621826],"category_scores_gemma":[0.00029571226,0.0000843366,0.000049889888,0.00020893732,0.00024571313,0.00018478282,0.0006813188,0.00010685471,0.00004108832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010821239,0.0001509026,0.0076267556,0.000019729818,0.000024009087,0.000024125893,0.0012265776,0.0000016329944,0.0051025925,0.9719244,0.00041765327,0.0134708],"study_design_scores_gemma":[0.0013358342,0.0013253592,0.17042778,0.00008207392,0.000026418997,0.000085907595,0.00029817846,0.00009554333,0.0055335453,0.81091934,0.00913546,0.0007345313],"about_ca_topic_score_codex":0.000010751821,"about_ca_topic_score_gemma":0.0000043840537,"teacher_disagreement_score":0.20868525,"about_ca_system_score_codex":0.000020955722,"about_ca_system_score_gemma":0.000051381372,"threshold_uncertainty_score":0.34391466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00977846,0.0005986213,0.9837585,0.0000135085,0.00065089104,0.0003499826,0.0000039803176,0.00007369015,0.0047723763],"genre_scores_gemma":[0.9957339,0.00005886996,0.0025937231,0.00012321633,0.00008068187,0.000021826987,0.0000045910074,0.000011603673,0.0013715528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982403,0.000426234,0.00034421074,0.00045067296,0.00025817758,0.0002804091],"domain_scores_gemma":[0.9989684,0.00012339828,0.00022173987,0.00036931364,0.00016468423,0.00015241813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067301036,0.00019808052,0.00032534995,0.00008286768,0.00015038595,0.00008520986,0.00043599078,0.00010960399,0.00001526936],"category_scores_gemma":[0.00011122344,0.00014530499,0.00007300517,0.00018477417,0.00010048219,0.00022748664,0.00024630767,0.00008095968,0.000049250175],"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.000062217645,0.00088885607,0.024395669,0.00021296472,0.00026264729,0.000027843962,0.0069060177,0.0032561787,0.00061285135,0.91789204,0.0017786153,0.04370407],"study_design_scores_gemma":[0.0015031181,0.0003542011,0.03723232,0.00014095454,0.000032556087,0.000020178726,0.00033699576,0.94856924,0.00019488217,0.0013947017,0.009869374,0.0003514632],"about_ca_topic_score_codex":0.00010002217,"about_ca_topic_score_gemma":0.000007624856,"teacher_disagreement_score":0.9859555,"about_ca_system_score_codex":0.000028221977,"about_ca_system_score_gemma":0.000021002346,"threshold_uncertainty_score":0.59253657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11007254,0.00035450739,0.8778389,0.0018562368,0.0014690191,0.0005554278,0.0000024280089,0.0005489857,0.0073019685],"genre_scores_gemma":[0.97544634,7.284372e-7,0.023472797,0.00033060132,0.0001989561,0.00006537636,0.000009258002,0.0000209686,0.00045498784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997836,0.00015802337,0.00033688327,0.0005838364,0.000433172,0.0006520678],"domain_scores_gemma":[0.99862975,0.0001880868,0.00010006058,0.000636479,0.00010602339,0.0003395842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006787336,0.00025096178,0.00031285183,0.0001894999,0.00009152269,0.00019340019,0.001013094,0.00016306982,0.000012698959],"category_scores_gemma":[0.00035969753,0.00022245424,0.000107073305,0.00062533305,0.0000995272,0.0003612218,0.00028373933,0.00032522297,0.0002946688],"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.00032601762,0.0041280217,0.013376175,0.0001597074,0.0001422683,0.0013866472,0.022334669,0.036114804,0.0003340508,0.6560333,0.0071710967,0.25849327],"study_design_scores_gemma":[0.006292182,0.0009891897,0.0060475767,0.00021114913,0.000024289657,0.000078361714,0.00032409778,0.9280832,0.000115092815,0.022426287,0.03418494,0.0012236573],"about_ca_topic_score_codex":0.00012186554,"about_ca_topic_score_gemma":0.00040470355,"teacher_disagreement_score":0.89196837,"about_ca_system_score_codex":0.00024086518,"about_ca_system_score_gemma":0.00034065096,"threshold_uncertainty_score":0.9071421},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17858408,0.0020070265,0.10259127,0.006371527,0.0019743557,0.0019038181,0.00019042267,0.0015325212,0.70484495],"genre_scores_gemma":[0.9196718,0.0015736193,0.016893076,0.0002182978,0.0015694336,0.000002791325,0.00012786925,0.00008035214,0.059862774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939697,0.0013995608,0.00028101835,0.0011814153,0.001781397,0.0013869319],"domain_scores_gemma":[0.9946216,0.00041316138,0.00010950384,0.0015405974,0.0018624726,0.0014527088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002447125,0.000375197,0.00064771285,0.0011834904,0.0006144099,0.00027122407,0.0021909133,0.0002872893,0.000020609908],"category_scores_gemma":[0.0013755371,0.00035728738,0.0004419936,0.0031316741,0.0004310122,0.0010383357,0.0026375102,0.0010355066,0.0006524132],"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.0007924568,0.0025630614,0.006844079,0.0002404854,0.0011149326,0.010872843,0.00932989,0.0005549476,0.0024936814,0.48829472,0.24815944,0.22873946],"study_design_scores_gemma":[0.0026848735,0.00076807686,0.002906102,0.00013672355,0.000050851544,0.00011698604,0.0026163645,0.009702132,0.00079407607,0.0021660393,0.9772962,0.00076160464],"about_ca_topic_score_codex":0.00021111475,"about_ca_topic_score_gemma":0.000043832028,"teacher_disagreement_score":0.7410877,"about_ca_system_score_codex":0.00092868955,"about_ca_system_score_gemma":0.0012043631,"threshold_uncertainty_score":0.9998879},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018822415,0.0004668747,0.8997003,0.0006603131,0.0015534037,0.00037094625,0.000013344715,0.00028652,0.096929476],"genre_scores_gemma":[0.08986682,0.00021782515,0.88585967,0.003823242,0.003130089,0.000058920898,0.00015238632,0.00012512562,0.016765932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562347,0.00006423158,0.0005219827,0.0016365931,0.0013584385,0.0007952996],"domain_scores_gemma":[0.996817,0.00048248528,0.0003280008,0.0014779693,0.0005285426,0.00036603084],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012405822,0.00062985957,0.0006659034,0.00060240296,0.00031133468,0.0005273883,0.003985893,0.0003964162,0.00017108377],"category_scores_gemma":[0.00010969025,0.00052921637,0.00017402384,0.0004766559,0.0009535184,0.00053094444,0.0018516368,0.0007006974,0.00086980686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010976678,0.00014006913,0.00005784518,0.000040832067,0.00003726742,0.00039021665,0.0010905025,0.011408636,0.0002005235,0.8063112,0.0035887528,0.17672317],"study_design_scores_gemma":[0.00042674827,0.0003355495,0.00012467537,0.00015524888,0.000010693836,0.00015943947,1.1273429e-7,0.18179172,0.00021179019,0.80466974,0.011292412,0.00082188094],"about_ca_topic_score_codex":0.000022703154,"about_ca_topic_score_gemma":0.000026956708,"teacher_disagreement_score":0.1759013,"about_ca_system_score_codex":0.00068543095,"about_ca_system_score_gemma":0.0011015581,"threshold_uncertainty_score":0.99990815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33848146,0.000052158684,0.47005466,0.0002639097,0.00028101553,0.00022776773,8.482699e-7,0.00013210897,0.1905061],"genre_scores_gemma":[0.98803866,0.0000049258265,0.010213912,0.00006419277,0.000022600389,0.000014157216,2.2749606e-7,0.0000019650413,0.0016393652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99954873,0.000008944256,0.00010198177,0.00012456239,0.00007094798,0.00014483285],"domain_scores_gemma":[0.9995938,0.000053946453,0.000037579823,0.00019676477,0.00006333597,0.00005456568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005922492,0.000057522084,0.00008632959,0.000040281862,0.000063517895,0.000082706545,0.00021986608,0.000028558152,0.00012953833],"category_scores_gemma":[0.000023896195,0.000040686977,0.000024212837,0.00008811591,0.000035610894,0.0006189057,0.0001591045,0.00003783331,0.00012414932],"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.000005662343,0.00024486007,0.014089637,0.00008383324,0.00004500853,0.000006449285,0.0039808094,0.0000046689106,0.005449904,0.7632717,0.007422792,0.20539472],"study_design_scores_gemma":[0.0019843297,0.00087739335,0.50410455,0.00005435271,0.000037782993,0.00014841688,0.00075724546,0.42342857,0.010875014,0.038978897,0.01786561,0.00088787236],"about_ca_topic_score_codex":0.000075986485,"about_ca_topic_score_gemma":0.000028537359,"teacher_disagreement_score":0.72429276,"about_ca_system_score_codex":0.0000071993204,"about_ca_system_score_gemma":0.000027985669,"threshold_uncertainty_score":0.16591668},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2838761,0.0051817093,0.45887476,0.14021432,0.0030018012,0.001768479,0.000007645352,0.00022971154,0.10684548],"genre_scores_gemma":[0.9873546,0.00032249297,0.009397529,0.0002972777,0.00017264843,0.0000030689346,5.9503165e-8,0.0000070390015,0.0024453283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986543,0.00019115079,0.00038631272,0.00022037898,0.00021842305,0.000329418],"domain_scores_gemma":[0.99856687,0.0002483887,0.00045768693,0.00042001758,0.00014964196,0.00015738542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655198,0.00015943286,0.00028047067,0.000059446695,0.00015879271,0.00026866343,0.0025153488,0.00006709595,0.000046293924],"category_scores_gemma":[0.00022078416,0.00006625951,0.00008387833,0.00020194899,0.00019100848,0.00079712784,0.0004388845,0.00022331515,0.00005922876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011024974,0.00026717826,0.006801646,0.000043724838,0.00014450116,0.0005300071,0.0030956268,0.00004334703,0.012507805,0.7462922,0.012831141,0.21733259],"study_design_scores_gemma":[0.0028763078,0.0020070004,0.040281825,0.00042108627,0.00004747336,0.004461204,0.00017812995,0.00013009245,0.0024468282,0.9213159,0.025365336,0.00046878774],"about_ca_topic_score_codex":0.0000029930793,"about_ca_topic_score_gemma":0.0000049244018,"teacher_disagreement_score":0.70347846,"about_ca_system_score_codex":0.000037694157,"about_ca_system_score_gemma":0.00008801689,"threshold_uncertainty_score":0.46741858},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41971332,0.000025099387,0.005411848,0.0035107443,0.0017579604,0.00017720963,0.00000282956,0.0000877208,0.5693133],"genre_scores_gemma":[0.9902565,0.000004976581,0.00570385,0.00045715086,0.000081020036,0.0000052505075,5.839984e-7,0.000002353937,0.0034883257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993955,0.0000038887893,0.0001151532,0.00019162186,0.0001782787,0.00011559404],"domain_scores_gemma":[0.9995844,0.00007220194,0.00005672847,0.00018277428,0.00007857142,0.000025350502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020793574,0.00006453462,0.000067538655,0.000059061596,0.000028338216,0.000052923406,0.001144962,0.000029153782,0.00010596207],"category_scores_gemma":[0.00024883501,0.000036237296,0.000031743297,0.00023332516,0.000042327923,0.00023515694,0.00036568005,0.00017468458,0.000034941804],"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.000003587815,0.0001155056,0.01755373,0.0000029113155,0.0000028840464,8.1909e-7,0.00022392835,0.0000027947497,0.004147728,0.9649519,0.008123905,0.0048703547],"study_design_scores_gemma":[0.0025877329,0.0002368624,0.4576129,0.00043155908,0.000013928237,0.000092808965,0.0006696171,0.06968832,0.20040761,0.07869033,0.18842103,0.0011473163],"about_ca_topic_score_codex":0.00002188104,"about_ca_topic_score_gemma":0.00017873653,"teacher_disagreement_score":0.8862615,"about_ca_system_score_codex":0.000010370638,"about_ca_system_score_gemma":0.000028235896,"threshold_uncertainty_score":0.21276434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024310958,0.00008210936,0.9664227,0.00008622072,0.00007227381,0.00017482966,0.0000016867301,0.00013270506,0.030596398],"genre_scores_gemma":[0.9761586,0.000038288108,0.023274694,0.000396163,0.000028443852,0.000041509746,0.000025709498,0.0000019269835,0.00003465634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994938,0.000019724233,0.00019397256,0.000103330975,0.00009036772,0.00009881067],"domain_scores_gemma":[0.9996003,0.000028639633,0.00009958493,0.0000922124,0.00011306426,0.00006620248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011533624,0.00007612245,0.00006957349,0.00009803107,0.00020039857,0.00018496743,0.000109263034,0.0000435421,0.000009228129],"category_scores_gemma":[0.000013819937,0.00006950235,0.000014020768,0.00015991756,0.000048053233,0.0012026199,0.00007086067,0.000054540375,0.0000994518],"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.000002951927,0.000020804153,0.00023595779,0.000022377582,0.000004368632,3.0198066e-7,0.0029430788,0.000077965335,0.0000026783491,0.69708335,0.00022106452,0.29938507],"study_design_scores_gemma":[0.00076524186,0.00016982699,0.036482252,0.000016790087,0.000013026116,0.00009575059,0.00033899228,0.6130784,0.00007835913,0.335625,0.013008702,0.0003276417],"about_ca_topic_score_codex":0.000018752613,"about_ca_topic_score_gemma":0.0000031767843,"teacher_disagreement_score":0.9737275,"about_ca_system_score_codex":0.00001419718,"about_ca_system_score_gemma":0.00002549696,"threshold_uncertainty_score":0.28342235},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031069353,0.0029849592,0.24180314,0.00012259086,0.008102709,0.002479245,0.00024532713,0.0023145352,0.71087813],"genre_scores_gemma":[0.8637243,0.000022566377,0.009000585,0.000060040926,0.00042635083,0.000027558413,0.0017149615,0.00011396013,0.124909714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974062,0.00016581734,0.00035508742,0.0010841801,0.00029190088,0.00069684855],"domain_scores_gemma":[0.99742985,0.0003816099,0.00040532602,0.00087782316,0.00064524444,0.00026015792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002889116,0.00055828434,0.00064859906,0.0010026478,0.0006219772,0.00018653806,0.0016949335,0.00051478104,0.000017989221],"category_scores_gemma":[0.00007558169,0.00061861484,0.0005474312,0.0012079338,0.00006533991,0.000396357,0.00011295534,0.0003333542,0.00012651333],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.00084800797,0.0016122103,0.030217733,0.009356111,0.00078082137,0.001844016,0.0008630578,0.0007354249,0.000117343596,0.64802295,0.27977586,0.025826437],"study_design_scores_gemma":[0.006791318,0.00044390143,0.00041547717,0.0019958324,0.0008756757,7.2863145e-8,0.027970277,0.05815529,0.012058065,0.00062150945,0.88758767,0.003084924],"about_ca_topic_score_codex":0.00021126603,"about_ca_topic_score_gemma":0.057606846,"teacher_disagreement_score":0.8326549,"about_ca_system_score_codex":0.0005955492,"about_ca_system_score_gemma":0.0011624123,"threshold_uncertainty_score":0.9996265},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21805881,0.0025384382,0.36969367,0.025521442,0.004876812,0.0027549746,0.00008924818,0.0017712173,0.37469536],"genre_scores_gemma":[0.93101835,0.00035191418,0.04138353,0.0016795014,0.0017665118,0.00001644678,0.000031227464,0.000042444797,0.023710094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974598,0.00015249643,0.00036768516,0.0008889307,0.00037715287,0.0007538975],"domain_scores_gemma":[0.99795943,0.000033712757,0.00021484945,0.0009944239,0.00045762936,0.00033992375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005290933,0.0003436525,0.00044514716,0.0001421741,0.000259968,0.000103489496,0.0014083766,0.00018350761,0.00006328436],"category_scores_gemma":[0.00018016524,0.00031010862,0.0001325247,0.00056989834,0.00016461969,0.00034285488,0.0006444364,0.0002596461,0.00041990724],"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.00008787277,0.0005183039,0.00018103141,0.000058414545,0.000037600716,0.00010371555,0.0004882717,0.0007332854,0.0004893954,0.780357,0.21482082,0.0021243156],"study_design_scores_gemma":[0.0016648293,0.0011387649,0.016047264,0.000039036768,0.000043287608,0.00025404835,0.00015298839,0.0002593833,0.0032892982,0.00033407687,0.9760475,0.00072950945],"about_ca_topic_score_codex":0.0006747354,"about_ca_topic_score_gemma":0.000011024656,"teacher_disagreement_score":0.7800229,"about_ca_system_score_codex":0.0002018596,"about_ca_system_score_gemma":0.00018933731,"threshold_uncertainty_score":0.9999351},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045621186,0.005300035,0.0014873802,0.00014011192,0.0011203773,0.0012483228,0.0000119043725,0.000048291266,0.99059796],"genre_scores_gemma":[0.007904408,0.00020009138,0.0009412882,0.00006952456,0.0014324045,0.00008348765,0.000009017937,0.000024414878,0.98933536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976647,0.0003782225,0.0006850163,0.0005389381,0.00047917903,0.00025393273],"domain_scores_gemma":[0.9972667,0.0007240439,0.0008445463,0.0006283574,0.00043888882,0.000097465025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709259,0.00032360762,0.00078592467,0.0001259283,0.00011975204,0.00009285224,0.00056688406,0.00036731927,0.000017862008],"category_scores_gemma":[0.00036937164,0.00021136583,0.00018977396,0.000066273366,0.0005023492,0.00014216857,0.00037121485,0.000546048,0.00003120051],"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.00085044786,0.00018131165,0.0000068590675,0.00038391323,0.00035981458,0.000044374316,0.0044650873,6.147944e-7,0.0000073219453,0.15916124,0.0064535034,0.8280855],"study_design_scores_gemma":[0.0051763635,0.0008997644,0.00003045899,0.0008771494,0.00030350138,0.00030000648,0.000082556995,0.0003733488,0.000030495808,0.0053983834,0.9861228,0.00040519354],"about_ca_topic_score_codex":0.0000022188985,"about_ca_topic_score_gemma":0.000008232613,"teacher_disagreement_score":0.9796693,"about_ca_system_score_codex":0.00007714715,"about_ca_system_score_gemma":0.00081236614,"threshold_uncertainty_score":0.8619248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03416709,0.000037962316,0.9153161,0.0011404319,0.000071453906,0.00018821172,0.000014753385,0.00012681307,0.048937198],"genre_scores_gemma":[0.9917759,0.000016251677,0.00782542,0.000042183594,0.00001675284,0.0000056628523,0.0000051009774,0.0000036545277,0.000309094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923337,0.00007665238,0.00013159144,0.00024607065,0.00013114922,0.00018119141],"domain_scores_gemma":[0.9993485,0.00012197256,0.00009516973,0.0002694558,0.00010952199,0.00005536426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008650443,0.00009688747,0.00013581525,0.00013342529,0.00007359915,0.000030816052,0.00036657552,0.000055555814,0.00008209575],"category_scores_gemma":[0.000041219293,0.000059135742,0.000036503614,0.00041318848,0.00011725613,0.0003905085,0.000086866596,0.00005396669,0.000022105301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016806462,0.00009717343,0.0022647593,0.000008994944,0.000008142166,0.00003689956,0.0005769967,0.000070365,0.0008770333,0.99241114,0.00012306278,0.0035086253],"study_design_scores_gemma":[0.016442256,0.008435993,0.34424448,0.0022492148,0.00018812211,0.0002685102,0.0039904355,0.019996095,0.012401683,0.5782824,0.010454496,0.0030462858],"about_ca_topic_score_codex":0.00007396211,"about_ca_topic_score_gemma":0.00015500248,"teacher_disagreement_score":0.9576088,"about_ca_system_score_codex":0.00010000174,"about_ca_system_score_gemma":0.00006330455,"threshold_uncertainty_score":0.24114856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84354603,0.000044363285,0.054591168,0.00030414114,0.00029349048,0.00021770174,0.000002194504,0.0000654911,0.100935444],"genre_scores_gemma":[0.9989698,0.000008092524,0.00028945442,0.00033337963,0.00002105011,0.000013437836,4.6786187e-7,0.000002051382,0.00036229214],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99935305,0.00004505045,0.00017272035,0.00011246442,0.00014247501,0.00017422301],"domain_scores_gemma":[0.999444,0.00009637736,0.00009115734,0.00029396074,0.000039780363,0.000034739303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029763402,0.00007666493,0.00008426788,0.00008123588,0.000032342283,0.00003878933,0.0006088175,0.000042559077,0.000058871028],"category_scores_gemma":[0.00006181933,0.000035711706,0.000030685525,0.00014729639,0.000040512303,0.00072909176,0.000099780606,0.000056245608,0.00018641469],"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.000060006663,0.00015096834,0.020194326,0.000016034739,0.00000939535,0.00000710034,0.010468474,0.00003920197,0.0006194225,0.38962397,0.00015291487,0.57865816],"study_design_scores_gemma":[0.0020859062,0.0038102518,0.8940442,0.00036034497,0.0000066780603,0.000012258863,0.00017299075,0.04143908,0.008351766,0.045521833,0.0035989846,0.0005956799],"about_ca_topic_score_codex":0.000016636677,"about_ca_topic_score_gemma":0.000020557656,"teacher_disagreement_score":0.8738499,"about_ca_system_score_codex":0.000022397446,"about_ca_system_score_gemma":0.000018337667,"threshold_uncertainty_score":0.23960459},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009402801,0.16638283,0.2959356,0.14057754,0.0021573466,0.0033241988,0.00001090695,0.00055214163,0.38165662],"genre_scores_gemma":[0.9654227,0.016680792,0.0011066182,0.015579477,0.0004059499,0.00006433621,0.000005578342,0.000010725912,0.0007238278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809915,0.0005651357,0.0004039461,0.00030320926,0.0003679482,0.0002606353],"domain_scores_gemma":[0.997661,0.00078606757,0.00026902108,0.0010838371,0.00014638781,0.000053694752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024223907,0.00019241955,0.0004067207,0.0000337188,0.00021330589,0.000049567763,0.0017921859,0.00005293975,0.00015099406],"category_scores_gemma":[0.0007379641,0.00007938755,0.0002035461,0.0003959245,0.00016604795,0.00008198831,0.00024450547,0.00020981782,0.00054971466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020669843,0.00005583369,0.000010839029,0.00024524037,0.000012222181,6.010263e-7,0.00011208332,0.000021154654,0.00007532251,0.9855184,0.00261683,0.011329409],"study_design_scores_gemma":[0.00075233076,0.0009380959,0.0040614954,0.004407081,0.0001337743,0.00010791925,0.00003730239,0.042284977,0.0017416409,0.83472013,0.11000963,0.0008056223],"about_ca_topic_score_codex":0.000007551049,"about_ca_topic_score_gemma":0.0000019215952,"teacher_disagreement_score":0.9560199,"about_ca_system_score_codex":0.000018794213,"about_ca_system_score_gemma":0.0000635509,"threshold_uncertainty_score":0.7065653},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067403833,0.00064394606,0.038335834,0.0008796541,0.0059946496,0.00061975984,0.000011688355,0.00029213424,0.94648194],"genre_scores_gemma":[0.99182737,0.000095841,0.0009953884,0.00009796443,0.0042077797,0.00002532326,4.6168384e-7,0.0000076232623,0.002742228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982219,0.00015174158,0.0003101709,0.0005531438,0.00035935393,0.00040373136],"domain_scores_gemma":[0.9987564,0.0002656255,0.00015938432,0.000556127,0.00012465386,0.00013781522],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031312185,0.00021585965,0.00039100365,0.000072585935,0.00012650403,0.00004974334,0.000877584,0.00010860772,0.00020916738],"category_scores_gemma":[0.00025065185,0.00011166918,0.00012664704,0.0002409765,0.00013053004,0.00010451777,0.00038203833,0.00009980414,0.001395181],"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.000027306834,0.0008149287,0.0016507391,0.000024512943,0.00006330389,0.00014125613,0.0008444805,0.000017196233,0.0008225885,0.9293838,0.035600647,0.030609246],"study_design_scores_gemma":[0.0039505786,0.0032254157,0.08877646,0.00026536186,0.000037284524,0.000046879395,0.00024870445,0.00051421253,0.0032075078,0.008721446,0.8899131,0.0010930923],"about_ca_topic_score_codex":0.000011254628,"about_ca_topic_score_gemma":0.000011598975,"teacher_disagreement_score":0.985087,"about_ca_system_score_codex":0.00008171877,"about_ca_system_score_gemma":0.00006507023,"threshold_uncertainty_score":0.9993824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48147666,0.0012603923,0.50011814,0.0035376258,0.00083761255,0.0014549842,0.000017101267,0.00018953865,0.011107921],"genre_scores_gemma":[0.9893767,0.0072687077,0.0027843872,0.00038404338,0.000036663507,0.000037923528,0.00006647212,0.000004784567,0.000040265655],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981801,0.00014156911,0.00095559057,0.00010018361,0.00045335686,0.00016923809],"domain_scores_gemma":[0.99794585,0.00028303085,0.0007948427,0.0005285002,0.00039628323,0.000051514275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083215174,0.00012820702,0.00020808239,0.00018766352,0.00013951115,0.00007209253,0.00055419793,0.00011359532,0.00004307488],"category_scores_gemma":[0.0008692394,0.00006678182,0.000060883784,0.00042356813,0.000049924634,0.0036473642,0.00024519116,0.00012098272,0.00003716799],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047762387,0.000072145725,0.003913454,0.0011975374,0.0000088055585,2.9827976e-7,0.010085748,0.00014951505,0.0015492426,0.110674374,0.00054894155,0.8717522],"study_design_scores_gemma":[0.0073473207,0.001104074,0.48651215,0.03773435,0.00008206968,0.00003491972,0.004287733,0.25997883,0.07594974,0.02537273,0.09980081,0.0017952579],"about_ca_topic_score_codex":0.000040490668,"about_ca_topic_score_gemma":0.00001656577,"teacher_disagreement_score":0.8699569,"about_ca_system_score_codex":0.00007641762,"about_ca_system_score_gemma":0.00007935677,"threshold_uncertainty_score":0.27232835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015369478,0.0020659226,0.97726667,0.00091373216,0.0009052085,0.00046541492,0.0000015070682,0.00018834698,0.018039519],"genre_scores_gemma":[0.6675113,0.00031476453,0.3312914,0.00041819568,0.0002904171,0.000016295475,0.0000055649853,0.000041188625,0.00011085581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959638,0.000045099147,0.00048719608,0.0018790973,0.00087869575,0.00074607664],"domain_scores_gemma":[0.99795353,0.000361644,0.00028709345,0.0009785634,0.00023723472,0.00018190476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007495972,0.00060474325,0.0006184547,0.0009608633,0.00016598288,0.00036176285,0.0023036955,0.00033789637,0.000011680723],"category_scores_gemma":[0.00006260194,0.00049143605,0.0000934628,0.00058683765,0.00055712316,0.0006328185,0.00084241753,0.0008401861,0.00007226335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009842826,0.000077949684,0.000102641265,0.00007465293,0.000008931983,0.00034137853,0.0034593358,0.08725466,0.000012834877,0.07356256,0.0000042174183,0.835091],"study_design_scores_gemma":[0.0017765367,0.00082390476,0.0048649185,0.0021128638,0.000010399029,0.00030724943,0.0000012104294,0.50306606,0.0005261228,0.48428002,0.0005856787,0.0016450636],"about_ca_topic_score_codex":0.00004655859,"about_ca_topic_score_gemma":0.0011268453,"teacher_disagreement_score":0.8334459,"about_ca_system_score_codex":0.0006012936,"about_ca_system_score_gemma":0.00076528743,"threshold_uncertainty_score":0.9997537},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100224686,0.00035506135,0.0046365396,0.00008922817,0.0013385467,0.00020723628,0.000015871212,0.00034070876,0.9929166],"genre_scores_gemma":[0.37148562,0.000029551407,0.017603347,0.0006453173,0.00085180637,0.00006080991,0.0000052934447,0.000051023904,0.60926723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984067,0.000018762643,0.00030818826,0.00061429205,0.00024876973,0.0004032935],"domain_scores_gemma":[0.9986994,0.000050536622,0.00015178137,0.00088236097,0.000090689726,0.000125229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013071489,0.00036165756,0.00040633066,0.00010077288,0.000104593266,0.00016935992,0.0013796511,0.00063842355,0.000046076988],"category_scores_gemma":[0.000041626205,0.0003259333,0.00019120928,0.000027956388,0.0001669891,0.000096507116,0.0005497469,0.0005889301,0.0007258709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022684937,0.000010002059,0.0000939548,0.000007771559,0.000011993199,0.00008067,0.00014008221,4.3789967e-7,0.000014638411,0.9872576,0.00090583303,0.011474746],"study_design_scores_gemma":[0.00020500855,0.000055502678,0.0006510406,0.000069359696,0.000010048935,0.000059560556,0.000004036877,0.000033217417,0.000024665827,0.90439534,0.094098106,0.0003940981],"about_ca_topic_score_codex":0.00010933396,"about_ca_topic_score_gemma":0.0027433042,"teacher_disagreement_score":0.38364935,"about_ca_system_score_codex":0.0001765393,"about_ca_system_score_gemma":0.00025547465,"threshold_uncertainty_score":0.9999193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83031905,0.0020539486,0.1528396,0.00074684597,0.0012398793,0.0037608375,0.0000060631255,0.0010676925,0.0079661105],"genre_scores_gemma":[0.96402675,0.000053605116,0.03377352,0.000041716612,0.00025444405,0.000727519,0.00016107575,0.000046654757,0.0009147449],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.995909,0.00028258836,0.00091373164,0.001644581,0.0005936953,0.00065642025],"domain_scores_gemma":[0.9962612,0.00012717395,0.0010825949,0.0018077749,0.00045954806,0.00026173037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045315837,0.0006888319,0.00085199537,0.00022173843,0.00024711993,0.000173349,0.0015289538,0.0006169084,0.000023100616],"category_scores_gemma":[0.00012017822,0.00049860845,0.00036185826,0.00068996404,0.00041424285,0.00045191514,0.0010071382,0.000876891,0.000035379995],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007318414,0.006471499,0.72956294,0.0014107892,0.0006670882,0.0020324884,0.03212522,0.0006728097,0.0014282789,0.0013707454,0.00083286676,0.22269341],"study_design_scores_gemma":[0.009572145,0.021584224,0.8482488,0.009706648,0.0016548276,0.0027606385,0.0026632403,0.05619706,0.006492761,0.016880885,0.015227252,0.0090115415],"about_ca_topic_score_codex":0.00024036969,"about_ca_topic_score_gemma":0.000083924766,"teacher_disagreement_score":0.21368188,"about_ca_system_score_codex":0.0001365265,"about_ca_system_score_gemma":0.00036529757,"threshold_uncertainty_score":0.99974656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3540903,0.0000984738,0.31331673,0.0044728625,0.0014764265,0.003292035,0.0000034059276,0.00041722384,0.32283252],"genre_scores_gemma":[0.98858416,0.000003760148,0.01074178,0.00017802068,0.00007376444,0.00012441912,4.4971745e-7,0.000012796338,0.00028082397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743426,0.000034622244,0.0005486646,0.0007485004,0.00066124863,0.00057272834],"domain_scores_gemma":[0.9982911,0.000057405075,0.00030318805,0.00034041103,0.00076690345,0.00024102151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012002263,0.00028512866,0.0003533948,0.00019735472,0.00012288315,0.00034399139,0.0025372019,0.0001180061,0.000004757249],"category_scores_gemma":[0.00095190346,0.00019857154,0.00011598371,0.0012375455,0.00016291418,0.00045821496,0.00084956095,0.00037769254,0.0001109474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059606642,0.00049596507,0.0017180039,0.000027970924,0.000009328275,9.855861e-7,0.007996157,0.00009633578,0.0015219923,0.92749035,0.0000766847,0.0605066],"study_design_scores_gemma":[0.0001504587,0.0010696962,0.0011143745,0.0005093674,0.000019492581,0.000022105261,0.009168935,0.15545502,0.116750136,0.714661,0.0002491351,0.0008302534],"about_ca_topic_score_codex":0.00010533125,"about_ca_topic_score_gemma":0.000044382406,"teacher_disagreement_score":0.6344939,"about_ca_system_score_codex":0.00015965385,"about_ca_system_score_gemma":0.0001851523,"threshold_uncertainty_score":0.8097512},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97711474,0.0001909563,0.0012928033,0.00017709396,0.0011137275,0.00038809224,0.000005034215,0.000027147675,0.019690404],"genre_scores_gemma":[0.9983731,0.0000051316624,0.0013500187,0.00003431192,0.000002753416,0.000011889167,8.5070275e-7,0.000003770881,0.00021821089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989249,0.00005477416,0.00026623573,0.00016581561,0.00042187914,0.00016635741],"domain_scores_gemma":[0.99864614,0.00009830844,0.00026523258,0.00046521574,0.00048672553,0.00003840258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024561601,0.000091603695,0.00019287817,0.000036962174,0.000058424208,0.000018113089,0.0009803744,0.000075137345,0.000051773073],"category_scores_gemma":[0.00007001743,0.000060371956,0.00007698739,0.000303558,0.00013587812,0.0003376499,0.00032729437,0.00010349938,0.000019156247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002544043,0.00016420161,0.0112210475,0.000039250393,0.000013991238,3.8904932e-7,0.00039155563,0.000009781419,0.003320198,0.9834986,0.0009858692,0.00035261776],"study_design_scores_gemma":[0.00044406104,0.00016744046,0.04313428,0.000057083358,0.000006990881,0.0000075338066,0.00002532539,0.0023111762,0.06558193,0.8880962,0.000075190546,0.00009278201],"about_ca_topic_score_codex":0.00015585091,"about_ca_topic_score_gemma":0.000004767007,"teacher_disagreement_score":0.09540235,"about_ca_system_score_codex":0.000026823473,"about_ca_system_score_gemma":0.0001593846,"threshold_uncertainty_score":0.2461897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033328234,0.0011321903,0.9914425,0.0004141998,0.0010740567,0.0004588445,0.000006701945,0.00015323094,0.004984964],"genre_scores_gemma":[0.079964876,0.00015577207,0.91493654,0.000592762,0.0014567417,0.000049137143,0.000011794497,0.000050749215,0.0027816074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739355,0.00002426401,0.00028894935,0.0012188455,0.0005707281,0.0005036464],"domain_scores_gemma":[0.99812764,0.0003041009,0.00020092519,0.00074798695,0.00041145887,0.00020786736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000648258,0.00040950676,0.0003931839,0.0005138504,0.00033443508,0.0005354225,0.0013134821,0.00024783416,0.0000032950888],"category_scores_gemma":[0.000082435334,0.0003114884,0.0000703031,0.00039802244,0.0005691079,0.0005480793,0.0005123061,0.00037055643,0.000009608578],"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.000024675886,0.000049892064,0.00027469944,0.00006652332,0.000028066625,0.000036629302,0.0015444184,0.022957982,0.00012407068,0.5501744,0.0004334241,0.4242852],"study_design_scores_gemma":[0.0007028319,0.00079712056,0.00057458144,0.00024906374,0.000025502786,0.00019958467,3.6708104e-7,0.5346236,0.0003147898,0.44910064,0.0125743,0.00083761156],"about_ca_topic_score_codex":0.000047094665,"about_ca_topic_score_gemma":0.00015934334,"teacher_disagreement_score":0.51166564,"about_ca_system_score_codex":0.00020465777,"about_ca_system_score_gemma":0.00061193627,"threshold_uncertainty_score":0.9999337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.956183,0.0005903864,0.028619038,0.00058270333,0.00022129012,0.00022789466,9.266675e-7,0.000037888647,0.013536835],"genre_scores_gemma":[0.9977003,0.000031696425,0.0019718679,0.00007566497,0.000033215016,0.000009954706,6.177413e-7,0.0000030517276,0.00017365665],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99882174,0.0001954082,0.00024992294,0.00028124725,0.00025459597,0.0001970784],"domain_scores_gemma":[0.9991338,0.00033145622,0.00009435694,0.00029673826,0.000076754055,0.00006685909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010939576,0.00010557658,0.00015727147,0.00008946208,0.00003864704,0.00007406075,0.0004213901,0.000058692614,0.0000061503647],"category_scores_gemma":[0.0005832245,0.00006320745,0.000021849231,0.00024687964,0.000043944357,0.00036699112,0.00013056249,0.00017792798,0.000006599928],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002852924,0.0014424559,0.6234346,0.00014802412,0.000027305754,0.00040667786,0.042848166,0.00053035724,0.0075293407,0.21988913,0.0014065929,0.10205206],"study_design_scores_gemma":[0.004476103,0.0004437007,0.6175594,0.00031178337,0.000017333348,0.00017530481,0.0046734437,0.32885402,0.015601021,0.027063772,0.0002359163,0.00058824907],"about_ca_topic_score_codex":0.00075943593,"about_ca_topic_score_gemma":0.0020543225,"teacher_disagreement_score":0.32832366,"about_ca_system_score_codex":0.000041857365,"about_ca_system_score_gemma":0.00007602781,"threshold_uncertainty_score":0.2577525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014205588,0.000039966217,0.85173315,0.00017233269,0.00010949222,0.00004941293,0.0000031178986,0.00008820883,0.13359874],"genre_scores_gemma":[0.966443,3.144657e-7,0.032826208,0.00015910083,0.000035493355,0.0000070133906,0.0000209981,0.0000025529716,0.00050533185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993848,0.0000270809,0.00015768589,0.00015812195,0.00016231627,0.000109999295],"domain_scores_gemma":[0.9995687,0.000057629546,0.00006390872,0.00015887796,0.00012332253,0.000027540285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011092312,0.00006720923,0.000092255206,0.00006629967,0.00003234691,0.000036454163,0.00027602148,0.00003528035,0.000096292],"category_scores_gemma":[0.000027079328,0.00005384094,0.00006300344,0.00015287842,0.00004218624,0.00016922728,0.00004216904,0.000036296562,0.00006248907],"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.000010567829,0.00015862951,0.001925554,0.000018374643,0.000007830035,0.0000040063774,0.0001784072,0.0007106237,0.00080835,0.9751164,0.004086087,0.01697517],"study_design_scores_gemma":[0.0011083386,0.00016659584,0.06158486,0.000031743457,0.000009553771,0.000010646644,0.000017838172,0.7264155,0.041361973,0.16668727,0.0023394756,0.00026619414],"about_ca_topic_score_codex":0.00010631743,"about_ca_topic_score_gemma":0.00003448558,"teacher_disagreement_score":0.9522374,"about_ca_system_score_codex":0.000023565512,"about_ca_system_score_gemma":0.00009926815,"threshold_uncertainty_score":0.21955699},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89143723,0.00037787255,0.057521496,0.012260266,0.0025558476,0.0020667035,0.00025157907,0.001281782,0.032247234],"genre_scores_gemma":[0.9377498,0.00021791355,0.0250918,0.0002849328,0.0010813867,0.000006736204,0.00013189108,0.00004824991,0.035387285],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99387604,0.0008691451,0.00042615784,0.0013083064,0.0017677315,0.001752641],"domain_scores_gemma":[0.9950201,0.00046803715,0.00018091555,0.0011763218,0.0014657417,0.0016888775],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023359456,0.00048005712,0.0005809947,0.0012132771,0.0006763117,0.0004385757,0.0026677682,0.0004253108,0.0000748391],"category_scores_gemma":[0.000639841,0.00045450192,0.00020769765,0.0027018024,0.00031409741,0.0013558713,0.0013592183,0.0016907458,0.00091715995],"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.0020761504,0.0045139943,0.086120375,0.00031139262,0.0005944256,0.00868762,0.008739937,0.0023003037,0.0026675845,0.41589385,0.43356478,0.03452957],"study_design_scores_gemma":[0.009489344,0.004142791,0.21143715,0.00048224552,0.00011882265,0.00060205907,0.006650399,0.00933219,0.0014327734,0.0139188515,0.73940617,0.0029871846],"about_ca_topic_score_codex":0.0016191972,"about_ca_topic_score_gemma":0.0020720684,"teacher_disagreement_score":0.401975,"about_ca_system_score_codex":0.00074369315,"about_ca_system_score_gemma":0.0007714234,"threshold_uncertainty_score":0.99986076},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03426185,0.00021493914,0.9584511,0.000047990183,0.0022431752,0.00057920505,0.000011746599,0.0003442524,0.0038457569],"genre_scores_gemma":[0.9945472,0.000060988827,0.0029428054,0.00003693521,0.00032731768,0.0000034388854,0.000014578571,0.00002421157,0.002042558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979922,0.000076906144,0.0002054011,0.0011720891,0.00009356275,0.0004598509],"domain_scores_gemma":[0.99741244,0.00015991986,0.00028747087,0.0016440493,0.00030999348,0.00018612573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040765642,0.00035151737,0.00047608058,0.0001864257,0.00020864469,0.00024195232,0.0024902984,0.00040006853,0.0000039704687],"category_scores_gemma":[0.000061621664,0.00036884937,0.0003176557,0.0002661822,0.00008146456,0.00020245709,0.0017330997,0.0003542433,0.000117070915],"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.000009132062,0.00005666897,0.0011330153,0.00029484864,0.00009555652,0.000059432394,0.00011450208,0.13240007,0.000011209984,0.8642578,0.0013399406,0.00022781455],"study_design_scores_gemma":[0.00039313937,0.00006155214,0.00029009505,0.00009834291,0.000070989045,0.000004749395,0.000015115511,0.89599454,0.000027464504,0.09741103,0.005202049,0.00043094016],"about_ca_topic_score_codex":0.00010632103,"about_ca_topic_score_gemma":0.00005722307,"teacher_disagreement_score":0.9602853,"about_ca_system_score_codex":0.00015127625,"about_ca_system_score_gemma":0.00016093889,"threshold_uncertainty_score":0.9998763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026584128,0.0000049354458,0.9673817,0.00004431407,0.000039230013,0.023374053,0.0000010640612,0.00012534324,0.006370934],"genre_scores_gemma":[0.7631369,0.0000012083781,0.1823594,0.00016716441,0.00011097292,0.054062493,0.0000026990124,0.0000093337285,0.00014978484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919385,0.000011767766,0.0001896091,0.00026330206,0.00012693144,0.0002145579],"domain_scores_gemma":[0.9991739,0.000029862369,0.00008918636,0.00046474676,0.00016345328,0.00007886066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046499728,0.00008764929,0.00010478846,0.000118397,0.00006928129,0.00003175031,0.00052732485,0.00006258574,0.0000062578947],"category_scores_gemma":[0.000013254295,0.000070767564,0.000058823945,0.00026510112,0.000020533284,0.0004172969,0.00004078814,0.00003545202,0.000004970279],"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.000025877524,0.0003119216,0.0006263288,0.00005465466,0.00000511737,1.9354584e-7,0.0019823478,0.000026531552,0.01336588,0.9405121,0.00014886036,0.04294019],"study_design_scores_gemma":[0.0009712503,0.00068342645,0.0054464587,0.000018561888,0.0000051645243,0.0000014649821,0.000067654946,0.9032023,0.054184675,0.03185575,0.003286078,0.00027723942],"about_ca_topic_score_codex":0.000020312747,"about_ca_topic_score_gemma":0.00003883498,"teacher_disagreement_score":0.90865636,"about_ca_system_score_codex":0.000012559352,"about_ca_system_score_gemma":0.000028660488,"threshold_uncertainty_score":0.28858176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037425652,0.00003733922,0.77764964,0.00033730708,0.00012328639,0.000106212945,1.7518123e-7,0.0002189733,0.18410142],"genre_scores_gemma":[0.91489625,0.0000050697163,0.08214633,0.00024220216,0.00008764797,0.0000053375807,6.2961976e-7,0.000008432858,0.0026081256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890476,0.000012084687,0.00010663442,0.0003198333,0.00024286757,0.00041381264],"domain_scores_gemma":[0.99930924,0.00003528891,0.000025538695,0.00039910516,0.00008720002,0.00014363915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017608966,0.00012668363,0.00012392826,0.00006407346,0.00016111713,0.00018905207,0.00065264106,0.00004657818,0.00004037747],"category_scores_gemma":[0.000013213816,0.00008305968,0.000041548883,0.00028244848,0.00004662166,0.0005267563,0.00024553348,0.00012943895,0.00043830386],"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.000018465278,0.0002496025,0.0038442882,0.000036778223,0.000045962737,0.00016710027,0.0064902217,0.0010150843,0.0015427534,0.9644658,0.0017369236,0.020387048],"study_design_scores_gemma":[0.022670314,0.00857795,0.09032985,0.0008399242,0.0000910374,0.0016015064,0.0016511854,0.37342274,0.29418987,0.15551215,0.044888187,0.006225287],"about_ca_topic_score_codex":0.00016784904,"about_ca_topic_score_gemma":0.00022461804,"teacher_disagreement_score":0.87747055,"about_ca_system_score_codex":0.0000632764,"about_ca_system_score_gemma":0.00018814032,"threshold_uncertainty_score":0.5633656},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035262365,0.000014560649,0.9412017,0.014989657,0.00061755005,0.0004084317,0.000018590637,0.00006380249,0.0074233385],"genre_scores_gemma":[0.97747546,0.000010039287,0.020761376,0.0007166153,0.00015536275,0.000068818306,0.000013999669,0.00000801322,0.00079028565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980678,0.00006202807,0.0004883164,0.00042489872,0.0007082763,0.00024868784],"domain_scores_gemma":[0.9980241,0.00011526687,0.00017490365,0.0004333326,0.0011430171,0.0001093441],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000340742,0.00017476198,0.00016999048,0.00016595585,0.00013942449,0.00030716273,0.0011002077,0.00005932721,0.00055296917],"category_scores_gemma":[0.00027568638,0.00012492388,0.000094143186,0.00023801465,0.000103468985,0.00040299844,0.00030009827,0.00018681631,0.0012574784],"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.000022214528,0.0001818607,0.000009048803,0.00000447522,0.000016382734,0.0000036133317,0.0014781869,0.011753139,0.05158342,0.91012275,0.0010091787,0.023815718],"study_design_scores_gemma":[0.0000237147,0.00012051696,0.00020382433,0.000059044778,0.0000030974113,0.000011501245,0.00023500736,0.82640016,0.059401583,0.11327677,0.00011633788,0.00014842807],"about_ca_topic_score_codex":0.00011214361,"about_ca_topic_score_gemma":0.00009035621,"teacher_disagreement_score":0.9422131,"about_ca_system_score_codex":0.00006828467,"about_ca_system_score_gemma":0.0002212288,"threshold_uncertainty_score":0.9995202},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073024254,0.008375981,0.9234108,0.00017260948,0.00051301543,0.0007774143,0.000008605674,0.00008035724,0.06658824],"genre_scores_gemma":[0.74499667,0.010494747,0.18391371,0.00051147444,0.0017751271,0.0014911005,0.00011769602,0.00017978337,0.056519706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794674,0.00003253525,0.0006416031,0.0007173924,0.00020974502,0.00045199052],"domain_scores_gemma":[0.9988432,0.00008910494,0.00022836727,0.00061508146,0.000070337956,0.00015394339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048457686,0.00032442436,0.00040966424,0.0003822949,0.00016070182,0.000110157576,0.0007375229,0.0003255275,0.000025096586],"category_scores_gemma":[0.00003433809,0.00032424278,0.000094133924,0.00023781082,0.00021583564,0.00008421243,0.0002741447,0.0005067529,0.0001782292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033347972,0.00007689823,0.00024816897,0.000019704903,0.000006891027,0.000004779194,0.00068874285,0.00075385335,0.000008094089,0.71741927,0.00014791296,0.28062236],"study_design_scores_gemma":[0.00007617724,0.00005683546,0.00021759019,0.0003719908,0.00003530107,0.000018885812,0.00043541024,0.20650423,0.00038317454,0.69611883,0.094690345,0.0010912137],"about_ca_topic_score_codex":0.00002757935,"about_ca_topic_score_gemma":0.000085825304,"teacher_disagreement_score":0.74492365,"about_ca_system_score_codex":0.0002075022,"about_ca_system_score_gemma":0.0000812108,"threshold_uncertainty_score":0.99992096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021370335,0.0030459382,0.9793194,0.0001775138,0.004386049,0.0006965578,0.0000029598357,0.00033356875,0.012016676],"genre_scores_gemma":[0.45545253,0.00012547614,0.52502614,0.0008617651,0.004546346,0.000125613,0.000029817045,0.00019075641,0.01364156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957137,0.000058091427,0.0005386135,0.0017692585,0.001013148,0.000907187],"domain_scores_gemma":[0.99668854,0.00055012625,0.0003758975,0.0013333999,0.00073727424,0.00031472967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018557417,0.0006057366,0.0007317759,0.00066223106,0.00038253458,0.00096789957,0.003957273,0.00047866776,0.000006553556],"category_scores_gemma":[0.0003403388,0.0005231339,0.00018983845,0.0004845548,0.00043708566,0.0005912315,0.0012954188,0.00087348744,0.000088862354],"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.000012583638,0.000047598252,0.00008217132,0.0001938938,0.0000364761,0.0001006137,0.0018988695,0.29377094,0.00010703023,0.3303656,0.0005311884,0.37285304],"study_design_scores_gemma":[0.00035403937,0.00030540588,0.00001393012,0.0002969941,0.000010426096,0.00007412408,3.3623186e-7,0.8401012,0.00009464685,0.113104984,0.04496474,0.0006792069],"about_ca_topic_score_codex":0.00002191319,"about_ca_topic_score_gemma":0.00002215898,"teacher_disagreement_score":0.5463302,"about_ca_system_score_codex":0.00046036005,"about_ca_system_score_gemma":0.00081176934,"threshold_uncertainty_score":0.999722},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6566109,0.00033503713,0.11730203,0.0015854898,0.0011306726,0.0005096556,4.802239e-7,0.0008140075,0.22171171],"genre_scores_gemma":[0.9738048,6.2493933e-7,0.02487218,0.00026765972,0.00004678627,0.000007661413,0.0000011844329,0.0000050363383,0.0009941105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991641,0.00003395181,0.00012534433,0.00024779738,0.00014639153,0.00028240232],"domain_scores_gemma":[0.9995083,0.000070783935,0.00003141866,0.00023510728,0.000056294313,0.00009804635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041637398,0.00009113782,0.000099007324,0.000078126075,0.000038857484,0.00012477288,0.00037892055,0.000042731546,0.000006143133],"category_scores_gemma":[0.0001584595,0.00006736362,0.00002753494,0.00028011322,0.000013910523,0.00025902945,0.00014895886,0.00008912172,0.00012585352],"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.00001729043,0.0003141386,0.07770743,0.00002037892,0.000015045558,0.00010522014,0.015053305,0.00019160981,0.00011690237,0.65324736,0.0104215555,0.24278979],"study_design_scores_gemma":[0.007426713,0.0033932158,0.045969475,0.00039162618,0.000017748498,0.00017166264,0.003551375,0.49720186,0.013574407,0.24600314,0.17923658,0.0030621926],"about_ca_topic_score_codex":0.000068206355,"about_ca_topic_score_gemma":0.00009292833,"teacher_disagreement_score":0.49701026,"about_ca_system_score_codex":0.0000403667,"about_ca_system_score_gemma":0.000045233417,"threshold_uncertainty_score":0.27470085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74877924,0.0020949726,0.23531325,0.00023411415,0.001196496,0.0007971897,0.000042736345,0.000689866,0.010852158],"genre_scores_gemma":[0.9954411,0.0024605885,0.0014755216,0.00014001902,0.00007791956,0.0000048344878,0.000034470213,0.000015887652,0.00034969478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974469,0.00033200346,0.00025383921,0.0014466833,0.000089013636,0.00043154828],"domain_scores_gemma":[0.9976648,0.00037775727,0.00023133605,0.0014277673,0.00009777842,0.00020055231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065308355,0.00036446066,0.00048094837,0.0003173475,0.0001545472,0.000163093,0.0014392644,0.00020586565,0.000022442468],"category_scores_gemma":[0.00017694607,0.00039091316,0.000116991214,0.0005059602,0.0001641981,0.00050140533,0.00457904,0.0005486432,0.000050408027],"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.000018241013,0.0002547496,0.46665463,0.00047819223,0.00009025861,0.0008440246,0.0008202791,0.0077497237,0.000007943063,0.51827234,0.001958671,0.0028509253],"study_design_scores_gemma":[0.0025699388,0.00022277884,0.10341328,0.0019622205,0.00027207346,0.00005476262,0.00046511402,0.6863201,0.000543913,0.15430732,0.046381567,0.0034868764],"about_ca_topic_score_codex":0.0010391889,"about_ca_topic_score_gemma":0.0010243163,"teacher_disagreement_score":0.67857045,"about_ca_system_score_codex":0.00014493236,"about_ca_system_score_gemma":0.00014091215,"threshold_uncertainty_score":0.99985427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009791253,0.000078680576,0.7103163,0.00008000859,0.00012777782,0.000033188524,7.437822e-7,0.000091982365,0.27948004],"genre_scores_gemma":[0.9520106,0.000002753584,0.044581577,0.00007856851,0.000053135926,0.0000036887304,0.0000015672778,0.0000041910985,0.0032639382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901515,0.00006852816,0.00023691932,0.0002948052,0.00014790519,0.0002366897],"domain_scores_gemma":[0.9989896,0.00013852034,0.00009502032,0.0005163007,0.00017648708,0.00008406312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061650603,0.00010919314,0.0003063205,0.00029371466,0.00006893728,0.000051304996,0.00076991675,0.000053228716,0.00006152576],"category_scores_gemma":[0.00020509974,0.0000822109,0.00021840734,0.0014396848,0.000033310273,0.00017797585,0.0003070089,0.00005928527,0.000056977515],"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.0000014068595,0.00011189313,0.007196252,0.000020455946,0.00029160926,6.5801396e-7,0.0024395569,0.000051529667,0.00043807927,0.77412724,0.0013225501,0.21399876],"study_design_scores_gemma":[0.00035974392,0.00011220618,0.07317907,0.000014007643,0.00023519348,0.000002241822,0.000057281955,0.89566165,0.007880017,0.0071039386,0.015072523,0.00032213682],"about_ca_topic_score_codex":0.00007784064,"about_ca_topic_score_gemma":0.00020456596,"teacher_disagreement_score":0.9422193,"about_ca_system_score_codex":0.000020321995,"about_ca_system_score_gemma":0.000056718563,"threshold_uncertainty_score":0.33524632},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025185915,0.000052515254,0.92722476,0.0031616907,0.0030581048,0.00028815703,0.0000032906046,0.00022064072,0.04080491],"genre_scores_gemma":[0.9931678,0.000026090363,0.004372847,0.0013639856,0.0002920681,0.000011266149,0.0000028536954,0.00000880802,0.0007542902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758166,0.000054859785,0.0004354716,0.0006275338,0.0008299092,0.00047057288],"domain_scores_gemma":[0.99777997,0.00047293075,0.00011066347,0.00032347348,0.0010572406,0.00025572535],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012587248,0.0002080029,0.00019064259,0.0003033557,0.00024177291,0.0008482138,0.0010955706,0.00010616466,0.00016907229],"category_scores_gemma":[0.00069086003,0.00016986541,0.00006940498,0.0006700804,0.00011104981,0.0008366507,0.00021134582,0.00022511966,0.0018282644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019449155,0.00007914971,0.00005017824,0.000003616598,0.000005384626,0.000011557847,0.0011566437,0.00016978166,0.0015284156,0.8315149,0.000084500796,0.16537642],"study_design_scores_gemma":[0.000056774723,0.00023575003,0.002096024,0.00019361528,0.000004683714,0.000016835416,0.0013832966,0.039897643,0.2535573,0.6970776,0.004756735,0.0007237668],"about_ca_topic_score_codex":0.00002883483,"about_ca_topic_score_gemma":0.00075805053,"teacher_disagreement_score":0.9679819,"about_ca_system_score_codex":0.00014326256,"about_ca_system_score_gemma":0.0002889365,"threshold_uncertainty_score":0.99894893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6510102,0.00006729319,0.20803916,0.010605711,0.0024654844,0.0015477425,0.0000063899192,0.00066919887,0.1255888],"genre_scores_gemma":[0.9981402,0.00003144931,0.0008743059,0.00016368179,0.000104008745,0.00004946544,3.412568e-7,0.000011814241,0.00062470546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800664,0.00003345044,0.00044691688,0.00058048265,0.0004903147,0.0004421701],"domain_scores_gemma":[0.99826294,0.00018590176,0.00037832948,0.00036636752,0.0007053488,0.000101119345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006293319,0.00026070114,0.0002694757,0.000104159866,0.0003113665,0.00035268124,0.0018309507,0.0001264622,0.000047083195],"category_scores_gemma":[0.0008780023,0.00014493412,0.00013463019,0.00048949383,0.0005258701,0.0004989071,0.0003369658,0.00020454104,0.0002644913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000516995,0.00011491738,0.00028401008,0.000013060243,0.000010525646,4.1609803e-7,0.0013177816,0.0000010340501,0.016900348,0.7782175,0.000038243776,0.2030505],"study_design_scores_gemma":[0.000058135225,0.0004930284,0.00032660895,0.0003183498,0.000009930822,0.0000045423817,0.00030069274,0.005025815,0.45538607,0.5375058,0.00031464003,0.0002563764],"about_ca_topic_score_codex":0.000023912062,"about_ca_topic_score_gemma":0.000020182057,"teacher_disagreement_score":0.43848574,"about_ca_system_score_codex":0.0000863783,"about_ca_system_score_gemma":0.00012360663,"threshold_uncertainty_score":0.5910242},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89493454,0.00009485382,0.07400604,0.0061377496,0.0003700072,0.0009214151,0.000004358397,0.00009956167,0.023431491],"genre_scores_gemma":[0.9934513,0.000060633785,0.006200618,0.000053008287,0.000023888211,0.000018723951,5.077943e-8,0.000006599468,0.00018515435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982314,0.000027173399,0.0005560204,0.0005321406,0.00031067478,0.0003426089],"domain_scores_gemma":[0.9984778,0.00023841776,0.00032482276,0.00030287995,0.00058028905,0.00007576088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007775808,0.00020327853,0.00032479252,0.00012824428,0.00012491293,0.00009718169,0.001330707,0.00010238624,0.00002645073],"category_scores_gemma":[0.0012675462,0.000117950876,0.000078847894,0.00069031434,0.00054803945,0.00040987047,0.00051084004,0.00016203462,0.00001819435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004175349,0.00017740077,0.0058103274,0.000065615954,0.000006807973,3.8293425e-7,0.001715656,0.0000038203707,0.012345081,0.9442359,0.000013063311,0.035584148],"study_design_scores_gemma":[0.00009301819,0.0002807127,0.0048375553,0.0005597915,0.0000074195787,0.000006563779,0.00018384698,0.0074498393,0.10927175,0.8769895,0.00008934006,0.00023068227],"about_ca_topic_score_codex":0.000070393064,"about_ca_topic_score_gemma":0.00023341499,"teacher_disagreement_score":0.0985168,"about_ca_system_score_codex":0.00006623236,"about_ca_system_score_gemma":0.00017165113,"threshold_uncertainty_score":0.4809897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010740126,0.00062630844,0.9575756,0.0003560137,0.0022291776,0.00083937286,0.0000084818075,0.00040992387,0.03794433],"genre_scores_gemma":[0.028474912,0.000031594223,0.9629676,0.0012325003,0.0014609378,0.00010157828,0.0000056560307,0.00009393344,0.0056313025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953565,0.000056967114,0.0007168601,0.0020046,0.00077239063,0.0010926923],"domain_scores_gemma":[0.9956809,0.0015532973,0.00050203543,0.0016682101,0.00035012647,0.00024541488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025865142,0.000709714,0.00075344037,0.0007207369,0.00048892427,0.0006389328,0.0043140706,0.0004235109,0.00003024163],"category_scores_gemma":[0.00045035937,0.0005159679,0.000298452,0.00044286443,0.0008075207,0.0007103293,0.001658686,0.00056049495,0.00008811303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066215152,0.000018756902,0.000010728954,0.00006954282,0.000010496081,0.000009051926,0.00061162567,0.00031488884,0.00006235848,0.52068025,0.00003105365,0.4781746],"study_design_scores_gemma":[0.00041937415,0.00018408286,0.000009352245,0.00051228976,0.000009617453,0.000052287054,3.3460088e-7,0.13176852,0.003265955,0.8593815,0.003610578,0.0007860738],"about_ca_topic_score_codex":0.0000019960778,"about_ca_topic_score_gemma":0.0000065536046,"teacher_disagreement_score":0.47738853,"about_ca_system_score_codex":0.0003489224,"about_ca_system_score_gemma":0.0006606907,"threshold_uncertainty_score":0.9997292},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7839294,0.00004639138,0.19687848,0.00541062,0.00058213907,0.0010813029,0.0000064788906,0.00016549091,0.011899685],"genre_scores_gemma":[0.9934225,0.000020550684,0.005561407,0.00014668274,0.000067287096,0.000015501406,2.125425e-7,0.000014778687,0.0007510732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977452,0.000020630647,0.000513066,0.0006800494,0.0006074886,0.00043352952],"domain_scores_gemma":[0.9976023,0.00014025532,0.0004907027,0.00042998267,0.0011061289,0.00023063924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004422538,0.000298869,0.0003874047,0.00016987906,0.00015895595,0.000118176016,0.0018916198,0.000103146755,0.000051769708],"category_scores_gemma":[0.00065266405,0.00015532564,0.000119301636,0.0008141036,0.00039315442,0.0005101144,0.00046197406,0.00018062498,0.00023976977],"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.0002779316,0.00017260632,0.0027282767,0.000037290087,0.000032173964,0.0000011813435,0.005210314,0.000013198198,0.24413717,0.6483723,0.000579172,0.09843842],"study_design_scores_gemma":[0.00007978817,0.0008892497,0.0017290129,0.0007328895,0.000018525814,0.00000721376,0.0004858882,0.0014848212,0.9241857,0.06990049,0.00018147068,0.0003049715],"about_ca_topic_score_codex":0.000054345157,"about_ca_topic_score_gemma":0.000051865085,"teacher_disagreement_score":0.6800485,"about_ca_system_score_codex":0.000070839844,"about_ca_system_score_gemma":0.0003675121,"threshold_uncertainty_score":0.6333996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06610348,0.000206065,0.9173292,0.003803066,0.00088954344,0.00013536184,0.0000040093632,0.000032633096,0.0114966305],"genre_scores_gemma":[0.9910923,0.00003702857,0.008118374,0.00027761015,0.00032035983,0.0000014333497,1.5163442e-7,0.0000062324575,0.00014647609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998685,0.00017972421,0.00034720913,0.00017965617,0.0003100719,0.00029832337],"domain_scores_gemma":[0.998635,0.00036188425,0.00038305053,0.00033901114,0.00015045433,0.00013062675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012167186,0.00011705306,0.00024146825,0.00016520705,0.00013175143,0.00008592165,0.0010758927,0.00004894021,0.000024875682],"category_scores_gemma":[0.00032640225,0.000041453866,0.00011304735,0.0002841797,0.00005178477,0.0004304071,0.00017452771,0.00012082537,0.0000072619814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013957212,0.00016557096,0.0024946523,0.000016729953,0.00012861572,0.00014108697,0.023025597,0.000026960828,0.038832963,0.89918447,0.0005929451,0.035250816],"study_design_scores_gemma":[0.0023817746,0.0025127146,0.011312275,0.0008886902,0.00008057712,0.00021210953,0.0061267377,0.0010506735,0.030547986,0.9402006,0.0040827845,0.0006030319],"about_ca_topic_score_codex":0.00002611433,"about_ca_topic_score_gemma":0.000092808295,"teacher_disagreement_score":0.92498887,"about_ca_system_score_codex":0.00011450261,"about_ca_system_score_gemma":0.00011920926,"threshold_uncertainty_score":0.19992943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026872428,0.000034955538,0.6616668,0.00007374656,0.00017081728,0.00025822315,1.7374406e-7,0.00041099952,0.33469707],"genre_scores_gemma":[0.3525841,6.187093e-7,0.6403079,0.00043336855,0.000101469144,0.000028551302,8.545724e-7,0.000008974865,0.0065341527],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984607,0.00004166651,0.00020355594,0.0005867529,0.00021508645,0.0004922308],"domain_scores_gemma":[0.9987631,0.0000552081,0.00006310297,0.0005632083,0.000092471855,0.00046293324],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035330065,0.00017290797,0.00015689565,0.000080138605,0.00013944233,0.00019615826,0.0012127246,0.000060598035,0.000050853316],"category_scores_gemma":[0.00046179432,0.0001373482,0.00005591573,0.00077979953,0.000030280404,0.00042143962,0.00039393792,0.000120938734,0.0007970302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006904596,0.0002858331,0.0063040694,0.00002893604,0.00002054682,0.00004135658,0.016644767,0.000018686962,0.00062362145,0.36611044,0.0068249227,0.6030899],"study_design_scores_gemma":[0.004886911,0.006151618,0.025485307,0.0007260758,0.00015085415,0.0029783468,0.0045366385,0.32750028,0.040070295,0.19108854,0.3875211,0.008904049],"about_ca_topic_score_codex":0.0009273245,"about_ca_topic_score_gemma":0.000028780201,"teacher_disagreement_score":0.5941859,"about_ca_system_score_codex":0.000038176735,"about_ca_system_score_gemma":0.00028166096,"threshold_uncertainty_score":0.999981},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004502238,0.0015214693,0.9833246,0.00040651404,0.006710804,0.00065155426,0.0000023114235,0.00029835227,0.006634156],"genre_scores_gemma":[0.3812857,0.00006671086,0.6122263,0.0030221208,0.0023692653,0.000038287355,0.0000072960042,0.00006357515,0.00092070893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911079,0.00016494594,0.0009348668,0.0031473925,0.0020651773,0.002579755],"domain_scores_gemma":[0.99496305,0.0008063932,0.0004659928,0.0026594473,0.0005177318,0.00058739644],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004070908,0.0009793313,0.0010734014,0.0025842667,0.0006018804,0.0015014785,0.010892061,0.00055325706,0.000027486352],"category_scores_gemma":[0.000320523,0.0008342575,0.00021955199,0.0053235367,0.0031675443,0.0022561667,0.0048709745,0.0016649949,0.00032684064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000864415,0.00033279596,0.0021283622,0.0001441594,0.000011910266,0.00040275377,0.0042538573,0.019702928,0.00019508383,0.03398886,0.00033210576,0.93849856],"study_design_scores_gemma":[0.0007776934,0.0003783806,0.0049600126,0.0007454489,0.00001435503,0.00039255028,3.652603e-7,0.8290073,0.00089492864,0.15851572,0.0023922396,0.0019209447],"about_ca_topic_score_codex":0.000053393494,"about_ca_topic_score_gemma":0.00023872776,"teacher_disagreement_score":0.9365776,"about_ca_system_score_codex":0.0017720355,"about_ca_system_score_gemma":0.0040145316,"threshold_uncertainty_score":0.9995453},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09365603,0.000027983668,0.3261303,0.005474995,0.0003659882,0.00024550752,7.4405e-7,0.00026186515,0.5738366],"genre_scores_gemma":[0.96800804,6.777881e-7,0.031577405,0.000064562555,0.00012153037,0.00001321045,6.991692e-8,0.000002292871,0.00021223008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862194,0.00005493975,0.00019491586,0.00034689726,0.00039771016,0.00038360024],"domain_scores_gemma":[0.99917084,0.00014692846,0.00014674068,0.00039686912,0.000050476698,0.000088166],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011692836,0.00010892997,0.00021808014,0.000023663752,0.0030220002,0.0011985204,0.0023593982,0.000060640457,0.000064824104],"category_scores_gemma":[0.0007855918,0.00007691907,0.000089790454,0.00014072431,0.001044356,0.00064499147,0.00073478423,0.000109316774,0.00022252242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3787163e-7,0.00008148508,0.004791501,0.000014812206,0.000002792124,0.0000011276153,0.0011645897,9.34889e-7,0.000018467748,0.9890923,0.00053202134,0.0042996258],"study_design_scores_gemma":[0.00012337885,0.000046200064,0.039639607,0.000019205949,0.0000047537305,0.0000033835029,0.000078422985,0.018994221,0.00017530927,0.93849367,0.0022206956,0.0002011598],"about_ca_topic_score_codex":0.000033977085,"about_ca_topic_score_gemma":0.000034289355,"teacher_disagreement_score":0.874352,"about_ca_system_score_codex":0.0000358716,"about_ca_system_score_gemma":0.00008585353,"threshold_uncertainty_score":0.99983835},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010611133,0.0008756345,0.9837723,0.0003464134,0.0028740072,0.00037265336,0.0000018691782,0.00019035787,0.011460702],"genre_scores_gemma":[0.30304158,0.0005743858,0.68819857,0.003083799,0.0026527536,0.000048780585,0.00001598924,0.000083802595,0.0023003523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949251,0.00011012106,0.00078993203,0.0020130684,0.0010272337,0.0011345895],"domain_scores_gemma":[0.9969955,0.0007350781,0.00029250846,0.0015205651,0.00024163404,0.00021469577],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011745805,0.0006247203,0.00071396143,0.0012180208,0.00027428145,0.00053007615,0.005902783,0.0005253201,0.000013341905],"category_scores_gemma":[0.0003714264,0.0005482138,0.00016121822,0.0025829752,0.0011173894,0.0006470341,0.0019169418,0.0013834161,0.0001998628],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058719424,0.0001372178,0.00017534688,0.00003661065,0.0000045697834,0.00055549067,0.002961937,0.026138486,0.000026418611,0.07037566,0.00016563294,0.89941674],"study_design_scores_gemma":[0.00008288192,0.00019597694,0.00022428494,0.00025574208,0.00000270564,0.00016752923,3.9711043e-7,0.51559955,0.0011669287,0.47945723,0.0020129948,0.0008337727],"about_ca_topic_score_codex":0.00003468741,"about_ca_topic_score_gemma":0.00036740932,"teacher_disagreement_score":0.898583,"about_ca_system_score_codex":0.0007870232,"about_ca_system_score_gemma":0.0022394583,"threshold_uncertainty_score":0.9996969},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000119991055,0.00019847752,0.045141038,0.000015002076,0.0007764379,0.0003568485,0.000032663094,0.00034821552,0.95311934],"genre_scores_gemma":[0.0009965131,0.000029018523,0.0011423897,0.0000734299,0.00024138941,8.739372e-7,0.000011533125,0.00003522551,0.9974696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982858,0.00006286879,0.00016919615,0.00079357764,0.00029804945,0.00039053356],"domain_scores_gemma":[0.9978493,0.00012276,0.00024146566,0.0013058636,0.00022800462,0.0002526142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024558674,0.00043490095,0.00040954983,0.00019371462,0.00030832025,0.00013226652,0.0023054043,0.0006197056,0.0000105605595],"category_scores_gemma":[0.000021140359,0.00045000986,0.00028891818,0.000012018917,0.0003342379,0.00020422216,0.0013430427,0.0009433263,0.000087960325],"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.000018830473,0.000011689778,6.766588e-7,0.000036505866,0.0000666086,0.00027586223,0.00012222663,1.8047507e-7,0.00007013582,0.9850492,0.00861196,0.005736161],"study_design_scores_gemma":[0.0003612565,0.00005772571,0.0000077164095,0.00007035314,0.00007555363,0.000039042246,0.000005440096,0.00010162547,0.001541298,0.0017147798,0.9954661,0.00055908674],"about_ca_topic_score_codex":0.00001915989,"about_ca_topic_score_gemma":0.0000033110475,"teacher_disagreement_score":0.98685414,"about_ca_system_score_codex":0.000112128,"about_ca_system_score_gemma":0.00022981288,"threshold_uncertainty_score":0.99979514},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015099365,0.0016067638,0.3850531,0.000055427907,0.0005788699,0.0004361349,0.00006723804,0.00005608778,0.6121313],"genre_scores_gemma":[0.7338281,0.0006533799,0.010196654,0.00042927978,0.0003212165,0.000054187487,0.00003719632,0.00008627518,0.25439367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651897,0.00017506597,0.0010899424,0.0007971156,0.000852401,0.00056648726],"domain_scores_gemma":[0.9944791,0.0019083819,0.0014236254,0.0006663126,0.0013226281,0.00019994732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009287313,0.00054926047,0.0012407387,0.00019526099,0.000104334846,0.000072382754,0.00068236596,0.0006414903,0.000062194405],"category_scores_gemma":[0.0013465055,0.00045551898,0.00040185289,0.000106597996,0.00040238033,0.00066130474,0.00035940192,0.0007161067,0.00020652333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051486153,0.00011591388,0.0000061986307,0.0003059746,0.00016633884,0.00006692741,0.0001913528,0.000050807095,0.000046166304,0.9950197,0.0011402929,0.0028388742],"study_design_scores_gemma":[0.00528777,0.0045723263,0.00006909613,0.007669652,0.0014148068,0.001107658,0.0004967214,0.17948298,0.0023768775,0.6470803,0.14557296,0.004868875],"about_ca_topic_score_codex":0.000014119848,"about_ca_topic_score_gemma":0.000005292697,"teacher_disagreement_score":0.73381305,"about_ca_system_score_codex":0.00008125068,"about_ca_system_score_gemma":0.0003920908,"threshold_uncertainty_score":0.99978966},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020366925,0.00027410546,0.033312187,0.000056999335,0.00041319733,0.00034425754,0.00005749692,0.00023474894,0.9651033],"genre_scores_gemma":[0.018796984,0.0000466854,0.0012446146,0.00016354279,0.00023280196,8.834217e-7,0.000006720124,0.000026707603,0.97948104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839497,0.000060054335,0.00015811551,0.00075324276,0.0002686299,0.00036497548],"domain_scores_gemma":[0.99844426,0.00016861198,0.00015793763,0.0007698978,0.000105317085,0.0003539987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012954645,0.0004038865,0.00044310535,0.00019414895,0.00029819444,0.00013915668,0.0011985695,0.00047024523,0.0000034348084],"category_scores_gemma":[0.000019733949,0.00039682977,0.00020374007,0.000007877806,0.00047037555,0.000059080077,0.00088522845,0.0010672306,0.000015400385],"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.000033756143,0.000009182624,0.000004318584,0.00003367998,0.000082506274,0.00035138038,0.00014153552,8.019964e-7,0.00010461117,0.98991334,0.002224013,0.0071008545],"study_design_scores_gemma":[0.000927413,0.00009407756,0.00012726353,0.0000569546,0.00009147155,0.00009353238,0.000002376632,0.00062699965,0.00020846244,0.00052271655,0.99672985,0.0005188616],"about_ca_topic_score_codex":0.0000415751,"about_ca_topic_score_gemma":0.0000071796103,"teacher_disagreement_score":0.9945059,"about_ca_system_score_codex":0.000043636825,"about_ca_system_score_gemma":0.00012490006,"threshold_uncertainty_score":0.99984837},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002417678,0.0010870708,0.16954449,0.00016115156,0.0022823927,0.0007765517,0.000039109196,0.00016384774,0.82592124],"genre_scores_gemma":[0.68057823,0.00021771337,0.0019180871,0.00018069414,0.0021993553,0.000054452077,0.000051808798,0.0000675252,0.31473213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99640566,0.00014401553,0.00096518185,0.00110677,0.0008593339,0.00051904377],"domain_scores_gemma":[0.9948939,0.0018367001,0.0010757245,0.00071590673,0.0011936155,0.00028414914],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00085961877,0.00062561163,0.0011066434,0.0002672321,0.00015366657,0.00020036235,0.00062742777,0.0007596936,0.00030920943],"category_scores_gemma":[0.0010246572,0.0005237142,0.00035001172,0.00012244353,0.00035422674,0.0005503696,0.00034673288,0.00089559593,0.0020970313],"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.000051217237,0.00017142778,0.00001177461,0.00020690213,0.0001891031,0.00019463825,0.00020283836,0.000007066225,0.000026202073,0.99037737,0.0021978808,0.0063636103],"study_design_scores_gemma":[0.0062346486,0.0065983674,0.0010923374,0.010418188,0.002526011,0.005676648,0.00091261626,0.02889467,0.00051855383,0.3160047,0.6135398,0.0075834417],"about_ca_topic_score_codex":0.000037088925,"about_ca_topic_score_gemma":0.00001576446,"teacher_disagreement_score":0.68055403,"about_ca_system_score_codex":0.00018948155,"about_ca_system_score_gemma":0.00038518524,"threshold_uncertainty_score":0.99972147},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009672834,0.009458682,0.07257626,0.00015259339,0.0025017476,0.0007234187,0.000110457164,0.0011155567,0.9133516],"genre_scores_gemma":[0.032904543,0.0019867553,0.00038729815,0.00013861689,0.001140083,0.00005519836,0.00013255927,0.0001337413,0.9631212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960712,0.0001501124,0.0010765285,0.0013837378,0.0006357023,0.00068269804],"domain_scores_gemma":[0.9962661,0.00036812449,0.0007565263,0.0019967877,0.00020882713,0.0004036144],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022608263,0.00084725244,0.001069914,0.0004418965,0.00016828503,0.00078875234,0.0031974926,0.00082984474,0.001202963],"category_scores_gemma":[0.000042974993,0.000601715,0.00029895885,0.00013982199,0.00014187263,0.0014850955,0.0010578509,0.00067035813,0.0060397494],"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.000009825372,0.000017553783,0.00005441587,0.00022429455,0.000108734945,0.00010028985,0.00012576347,0.0000012976739,0.000011413502,0.96838164,0.015823588,0.015141205],"study_design_scores_gemma":[0.00016075102,0.00014483245,0.000016057129,0.0033705889,0.000030402294,0.00008570714,0.000017304654,0.00048945576,0.00026753877,0.03434751,0.9600193,0.0010505628],"about_ca_topic_score_codex":0.000008527358,"about_ca_topic_score_gemma":0.0000012241462,"teacher_disagreement_score":0.9441957,"about_ca_system_score_codex":0.00012077716,"about_ca_system_score_gemma":0.00036647098,"threshold_uncertainty_score":0.9997101},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001857693,0.00037355907,0.012991922,0.000013360165,0.00033649354,0.00027724265,0.0000140023685,0.00035320738,0.98545444],"genre_scores_gemma":[0.0026508854,0.00003990956,0.0029967078,0.000019662317,0.00017835385,0.0000010096719,0.000026915615,0.000033288972,0.99405324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826574,0.000057702106,0.00019115114,0.0008299572,0.00031154783,0.0003439053],"domain_scores_gemma":[0.99854624,0.00018561707,0.00031593587,0.0004857722,0.00021042117,0.0002560049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021425179,0.00040336742,0.000375529,0.00019283082,0.00053455215,0.0001537947,0.0007450939,0.0005691075,0.0000065144145],"category_scores_gemma":[0.00009196411,0.00044814078,0.00013853193,0.000013989114,0.00028782434,0.0002125038,0.000944618,0.0013440234,0.000022224845],"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.000015192679,0.0000066053,0.0000724019,0.000045189507,0.000050305138,0.00020583802,0.00022433883,0.000008787221,0.000018892217,0.995979,0.0025593198,0.000814129],"study_design_scores_gemma":[0.00043096076,0.00008420896,0.00020086055,0.00020381137,0.000079205005,0.00010012153,0.000009286411,0.0024331321,0.000030000348,0.00037818096,0.9954927,0.0005575306],"about_ca_topic_score_codex":0.00002688178,"about_ca_topic_score_gemma":0.0000019951415,"teacher_disagreement_score":0.9956008,"about_ca_system_score_codex":0.000112286354,"about_ca_system_score_gemma":0.0001934361,"threshold_uncertainty_score":0.99979705},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013616483,0.0007059447,0.024635097,0.00001705823,0.0005128647,0.00024314351,0.000040493494,0.00010412496,0.97372764],"genre_scores_gemma":[0.0016937334,0.00018843068,0.00015148653,0.00005770901,0.00005772883,4.625128e-7,0.0000050902972,0.00002065271,0.9978247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985959,0.00013090463,0.00019574273,0.00047861572,0.00028544498,0.00031342657],"domain_scores_gemma":[0.99783885,0.00030558213,0.00031980546,0.0011772022,0.00022703358,0.00013154813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038095834,0.00031514207,0.00034638046,0.000105148116,0.00035147392,0.00007767369,0.002072474,0.00027892066,0.0000025603797],"category_scores_gemma":[0.000026824082,0.00025870517,0.00027981336,0.00001588759,0.00047248247,0.000104614905,0.00076535594,0.00037817506,0.000020204134],"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.000020470998,0.000005518047,5.3540015e-7,0.000025381021,0.00009640214,0.000067510955,0.00017040367,6.292885e-7,0.0000085444135,0.97406745,0.022501266,0.0030359009],"study_design_scores_gemma":[0.0002980307,0.000057888396,0.0000065492873,0.00006337188,0.0000710693,0.00002065021,0.000033824537,0.00011261428,0.0004165335,0.0014403454,0.9971595,0.00031962636],"about_ca_topic_score_codex":0.000021757116,"about_ca_topic_score_gemma":0.0000018065176,"teacher_disagreement_score":0.97465825,"about_ca_system_score_codex":0.0000969732,"about_ca_system_score_gemma":0.00014450967,"threshold_uncertainty_score":0.9999865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5089194,0.0018390415,0.2840125,0.000053479143,0.0012320428,0.0004661733,0.000006788292,0.00017345013,0.2032971],"genre_scores_gemma":[0.98408103,0.000058533908,0.007420006,0.0000109423,0.00012065986,0.000013829678,0.00028409084,0.000007692216,0.008003236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99942505,0.000019518358,0.00012625194,0.00020534714,0.00012707007,0.00009678142],"domain_scores_gemma":[0.99946064,0.000015037671,0.00013745943,0.00023244906,0.00011363239,0.0000407671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009279011,0.00010654883,0.00012637468,0.00006319446,0.0000469284,0.0000442177,0.00017506487,0.00010866905,0.000018223587],"category_scores_gemma":[0.000008243952,0.00007676225,0.000016569822,0.00009943547,0.000012796364,0.00022569534,0.000011607106,0.000060795835,0.000012325377],"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.000058938545,0.0002695354,0.00936505,0.00043241185,0.00011210775,0.0000025927748,0.01755628,0.000016073578,0.034450926,0.7873533,0.0032967727,0.14708602],"study_design_scores_gemma":[0.0019303488,0.0010527316,0.6741973,0.00032512445,0.00028228236,0.00006325449,0.0013319015,0.045872554,0.2580949,0.002213349,0.012571576,0.0020646506],"about_ca_topic_score_codex":0.00004016448,"about_ca_topic_score_gemma":0.0005664788,"teacher_disagreement_score":0.7851399,"about_ca_system_score_codex":0.000010294555,"about_ca_system_score_gemma":0.00005802545,"threshold_uncertainty_score":0.31302738},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008990482,0.0024397469,0.21747197,0.00017857518,0.0013153541,0.00096984976,0.000039093036,0.00011350449,0.777382],"genre_scores_gemma":[0.8716646,0.0004714618,0.003203627,0.00066354504,0.0003848761,0.00008011506,0.000050543887,0.00006215595,0.12341912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514174,0.0005677428,0.0013783926,0.0011520181,0.001149852,0.0006102489],"domain_scores_gemma":[0.99374294,0.0020078896,0.001654004,0.000716756,0.0015276462,0.00035078474],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012969623,0.0007319711,0.0016374069,0.0003150136,0.000129002,0.0001545407,0.0007439927,0.0010286341,0.0004051085],"category_scores_gemma":[0.002305176,0.00056381634,0.0005999882,0.00018987287,0.0006577934,0.0004158328,0.0004056299,0.00089398696,0.00088560116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000949457,0.00036523302,0.000026295442,0.00026300963,0.00023628387,0.00038720868,0.0002213031,0.0000029180492,0.000092103866,0.99545366,0.0013657149,0.001491329],"study_design_scores_gemma":[0.0033816358,0.008177123,0.00044056072,0.004697845,0.001147825,0.0031055799,0.00067662983,0.0018551648,0.00050131493,0.8642298,0.10885856,0.0029279469],"about_ca_topic_score_codex":0.00004327286,"about_ca_topic_score_gemma":0.000005564668,"teacher_disagreement_score":0.87157464,"about_ca_system_score_codex":0.0001697678,"about_ca_system_score_gemma":0.0003695633,"threshold_uncertainty_score":0.99989235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086562664,0.00080666546,0.98208994,0.00043399775,0.0017256879,0.00034402267,0.000016580112,0.00024056103,0.014255977],"genre_scores_gemma":[0.3813358,0.00033197895,0.615217,0.0006102517,0.0010377902,0.000021985448,0.000013203727,0.000070757065,0.001361243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959599,0.000051340776,0.00055384624,0.0019999233,0.0006420191,0.0007929726],"domain_scores_gemma":[0.9966357,0.00095812767,0.00026784168,0.0016104142,0.00023381182,0.00029412142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011023725,0.0005875834,0.00059001986,0.0005987398,0.0005199547,0.00075342605,0.0027552675,0.00033532287,0.000048449147],"category_scores_gemma":[0.00037897128,0.00046380365,0.0001159275,0.00044824326,0.0009965801,0.0012826438,0.0020937973,0.00064750225,0.000045201607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005515962,0.00005298674,0.0003157448,0.00008036246,0.000019198016,0.00008810873,0.0013635237,0.0051820977,0.00032919267,0.14609705,0.000026360483,0.84643984],"study_design_scores_gemma":[0.0006158914,0.00025872214,0.0012834,0.00108529,0.000034749864,0.000372998,8.2705037e-7,0.66732514,0.0010438359,0.3204019,0.0055949,0.0019823664],"about_ca_topic_score_codex":0.000014142099,"about_ca_topic_score_gemma":0.00010422537,"teacher_disagreement_score":0.8444575,"about_ca_system_score_codex":0.00028905724,"about_ca_system_score_gemma":0.00045680586,"threshold_uncertainty_score":0.99978137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1180657,0.0007623677,0.6726057,0.0015926973,0.00017917453,0.00025730926,1.01557696e-7,0.00046974022,0.2060672],"genre_scores_gemma":[0.893985,0.000008524043,0.10269469,0.00022262304,0.000089345995,0.000008904584,8.88802e-7,0.0000023184402,0.0029877198],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995239,0.00001930736,0.00008995577,0.00014686887,0.00007574626,0.00014426204],"domain_scores_gemma":[0.99977356,0.000015510239,0.00001669212,0.00014280305,0.000019118492,0.000032339343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013425598,0.000050014354,0.000049979088,0.00004556414,0.00003489668,0.000097416196,0.00020087378,0.000024646446,0.000029957831],"category_scores_gemma":[0.000013103281,0.000038825234,0.000018749914,0.00014609986,0.000006591023,0.0002715525,0.000044870678,0.000042593896,0.00015970408],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.323382e-7,0.00006507282,0.0013139714,0.0000027436913,0.0000016081806,0.0000076341985,0.002255621,0.00006507401,0.0001228994,0.11548959,0.00065740716,0.8800179],"study_design_scores_gemma":[0.0015698888,0.00023069138,0.042555492,0.000052292016,0.0000064532464,0.00005422705,0.0005389497,0.3031437,0.020560408,0.002424759,0.6280054,0.00085776055],"about_ca_topic_score_codex":0.000038251528,"about_ca_topic_score_gemma":0.0009983949,"teacher_disagreement_score":0.8791601,"about_ca_system_score_codex":0.000031793326,"about_ca_system_score_gemma":0.000021732441,"threshold_uncertainty_score":0.20527261},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002729794,0.0012112514,0.9810112,0.0007226213,0.003214724,0.0006343871,0.00000865688,0.0001986768,0.012971181],"genre_scores_gemma":[0.023172293,0.00023406834,0.95706725,0.0031843379,0.003995102,0.000036636633,0.00000853757,0.00009077162,0.012211001],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957767,0.00003203302,0.0005295552,0.0019453035,0.00077609054,0.00094032683],"domain_scores_gemma":[0.9968631,0.00056737044,0.00032065503,0.001593887,0.00040840547,0.00024656596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010459989,0.0006136736,0.0006364652,0.00057598227,0.00037209256,0.00056036416,0.0039626895,0.00042557484,0.000039222203],"category_scores_gemma":[0.00017182644,0.00043785182,0.00030325132,0.0003440068,0.0005326745,0.0006260341,0.0015568999,0.0004391592,0.00014003062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073681667,0.000019701461,0.000018396177,0.0000447491,0.000010390319,0.000030276069,0.00038105005,0.00039192595,0.0002190789,0.16013183,0.00043330243,0.8383119],"study_design_scores_gemma":[0.0009651522,0.00050958135,0.00006896624,0.0009459146,0.000019953111,0.000111952875,6.5430825e-8,0.30956936,0.0021932095,0.5742523,0.10979715,0.0015663687],"about_ca_topic_score_codex":0.000004816403,"about_ca_topic_score_gemma":0.000022699765,"teacher_disagreement_score":0.83674556,"about_ca_system_score_codex":0.00032335846,"about_ca_system_score_gemma":0.0005984172,"threshold_uncertainty_score":0.9998073},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053018063,0.044121727,0.33596322,0.07163752,0.0037065514,0.00061428174,0.00007824455,0.0005783195,0.4902821],"genre_scores_gemma":[0.90860397,0.0034072215,0.031940643,0.0002407069,0.001480073,0.000020582334,5.971632e-7,0.000028898106,0.0542773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938167,0.0022114522,0.00048365598,0.0014996703,0.0007924653,0.0011960746],"domain_scores_gemma":[0.9940362,0.004311154,0.00034281018,0.00050372473,0.0005001372,0.0003059639],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.0032935273,0.00052899995,0.00058555,0.00024313857,0.0013970807,0.0006834265,0.002505179,0.00045167937,0.0007906654],"category_scores_gemma":[0.00173243,0.00037576593,0.0003913607,0.0011243365,0.009278733,0.0012983549,0.00088463305,0.00035684032,0.0011979681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007384633,0.00035474403,0.0015036691,0.00002238339,0.00005005322,0.000034238205,0.08101828,0.000006427126,0.0011567523,0.8891305,0.007883262,0.018832363],"study_design_scores_gemma":[0.002079556,0.00090594054,0.016319783,0.0008013358,0.000085434134,0.00029206468,0.16938864,0.003271609,0.0027564496,0.6315899,0.1701758,0.0023334927],"about_ca_topic_score_codex":0.00066154974,"about_ca_topic_score_gemma":0.0007612186,"teacher_disagreement_score":0.85558593,"about_ca_system_score_codex":0.00097468623,"about_ca_system_score_gemma":0.00437503,"threshold_uncertainty_score":0.99990296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09590445,0.004146694,0.55812955,0.032362763,0.0012431396,0.0013747467,0.0000716158,0.0012244389,0.30554265],"genre_scores_gemma":[0.8886823,0.00037488464,0.095699415,0.0001220248,0.00013999005,0.00009004105,0.00014567154,0.000040551753,0.014705123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948963,0.0026341395,0.0004694863,0.0010979966,0.0005087011,0.00039336167],"domain_scores_gemma":[0.99293333,0.001931355,0.00048182195,0.0029235864,0.0014606217,0.0002692566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0052493284,0.0003692329,0.00041160875,0.00025783648,0.0005147012,0.00083486794,0.0021504704,0.0005219107,0.000041901378],"category_scores_gemma":[0.0023765634,0.00035667216,0.0001701609,0.00030666342,0.00027266785,0.00032694582,0.0026810758,0.0014213012,0.00009742119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030772917,0.00029266253,0.0068240943,0.00009597509,0.00006406799,0.000004795811,0.008330109,0.000012494686,0.0002915267,0.8768947,0.002295198,0.1048913],"study_design_scores_gemma":[0.0020984425,0.0000059623962,0.23442864,0.0058070696,0.00020435332,0.00004425609,0.00009466081,0.083431594,0.039478276,0.5053099,0.12597176,0.003125089],"about_ca_topic_score_codex":0.00023499533,"about_ca_topic_score_gemma":0.00056217035,"teacher_disagreement_score":0.79277784,"about_ca_system_score_codex":0.000115896466,"about_ca_system_score_gemma":0.00038468486,"threshold_uncertainty_score":0.99988854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042752046,0.0052954485,0.9369325,0.0015799169,0.010209006,0.00047474605,0.0015252845,0.00010936018,0.0011216783],"genre_scores_gemma":[0.5154698,0.0053555267,0.4744108,0.0002454405,0.0031732093,0.000043111722,0.001118211,0.00006444635,0.00011948397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971312,0.00013017702,0.0009253072,0.00076739304,0.0006905461,0.00035536996],"domain_scores_gemma":[0.99482244,0.00037883202,0.0021863375,0.00085172086,0.0015198014,0.00024088948],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015316539,0.00044538596,0.00074669294,0.00032303584,0.00026153572,0.0014044528,0.0033123735,0.00024124046,0.000029309482],"category_scores_gemma":[0.0018676588,0.00038584784,0.00028237817,0.000052533967,0.00038686348,0.0016368249,0.0020910974,0.0011269479,0.000005627067],"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.0009889633,0.001429595,0.031011151,0.0010293487,0.008526308,0.0017487926,0.009941132,0.000470122,0.0021321995,0.4507192,0.03605313,0.45595005],"study_design_scores_gemma":[0.01525845,0.00087494805,0.021680892,0.02997627,0.0017043913,0.011071347,0.003319727,0.21929234,0.015558068,0.44880706,0.22562312,0.0068333833],"about_ca_topic_score_codex":0.00039693105,"about_ca_topic_score_gemma":0.00007012368,"teacher_disagreement_score":0.47271773,"about_ca_system_score_codex":0.00023523631,"about_ca_system_score_gemma":0.00075539254,"threshold_uncertainty_score":0.99985933},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012037139,0.0017200422,0.18881223,0.00008583201,0.004590494,0.00036832815,0.000019654886,0.0008558529,0.7915104],"genre_scores_gemma":[0.3984089,0.0014861601,0.20455058,0.00092828326,0.0017725768,0.000066181965,0.010394228,0.00018163839,0.38221148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787,0.000061927705,0.00033333755,0.0010562341,0.00028943527,0.00038904822],"domain_scores_gemma":[0.99683535,0.00009126537,0.00023340425,0.0026342892,0.00011817346,0.000087529435],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025481876,0.00035343677,0.00035177995,0.00008260123,0.00019948168,0.00033685227,0.006264396,0.00027727403,0.000354855],"category_scores_gemma":[0.00017693506,0.0002785288,0.00008587866,0.0002504952,0.000026863232,0.0016794498,0.001312463,0.00034502026,0.000988872],"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.00001840258,0.0002114446,0.00039901916,0.000101024256,0.00012801177,0.000026933538,0.015344982,4.6008256e-7,0.00017333889,0.83162063,0.05248668,0.09948909],"study_design_scores_gemma":[0.0014995118,0.0007320697,0.01815773,0.00076554005,0.0002986107,0.000068126916,0.0023300992,0.009069448,0.008547919,0.0496048,0.9042372,0.004688904],"about_ca_topic_score_codex":0.00018896698,"about_ca_topic_score_gemma":0.0002121055,"teacher_disagreement_score":0.85175055,"about_ca_system_score_codex":0.000021898737,"about_ca_system_score_gemma":0.00022899777,"threshold_uncertainty_score":0.9999667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012357687,0.00016296342,0.98363614,0.0029353162,0.00035230085,0.00085600815,0.000023164033,0.00015497672,0.0118668],"genre_scores_gemma":[0.120660126,0.000017853392,0.8724233,0.0034002897,0.00052769476,0.000115699164,0.000019739911,0.00007150257,0.0027637733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609566,0.000048796763,0.00031428298,0.0020855567,0.0006956349,0.00076006417],"domain_scores_gemma":[0.9947005,0.00088330876,0.0003369791,0.0035306243,0.0003845347,0.00016408172],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00087054836,0.0005726854,0.00053277373,0.00029065958,0.00061793433,0.00068893656,0.011583184,0.00026897635,0.000005476319],"category_scores_gemma":[0.00011195127,0.00021913218,0.000065974884,0.00033695094,0.0010970642,0.0011034681,0.003166582,0.00057316566,0.000005172638],"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.00020422123,0.00013884771,0.00020846345,0.00014280235,0.00006100143,0.00010900869,0.001153302,0.1316745,0.00020543413,0.09788253,0.00071074074,0.76750916],"study_design_scores_gemma":[0.00061045744,0.00033607037,0.0000294314,0.0005172769,0.00002019862,0.000046975754,1.933621e-7,0.96299225,0.00026640226,0.031083584,0.0035300646,0.000567107],"about_ca_topic_score_codex":0.000016238517,"about_ca_topic_score_gemma":0.0013204367,"teacher_disagreement_score":0.8313177,"about_ca_system_score_codex":0.00015176818,"about_ca_system_score_gemma":0.0014481276,"threshold_uncertainty_score":0.99376464},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1993646,0.00030584264,0.7936211,0.0008687834,0.0006875169,0.0017402968,0.0017703194,0.00025927313,0.0013822288],"genre_scores_gemma":[0.5368933,0.000083805,0.4581834,0.0028175141,0.00025057248,0.0007264825,0.0006107314,0.000056805216,0.00037736475],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803877,0.000029101426,0.00062639115,0.00043179665,0.0002907923,0.00058315916],"domain_scores_gemma":[0.9977121,0.0003639876,0.0002151392,0.0008029714,0.00034780716,0.0005579898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000529957,0.00036921402,0.000446413,0.00017485821,0.00025981967,0.00058266503,0.00067217805,0.00014424564,0.000006703558],"category_scores_gemma":[0.00044185924,0.00031567726,0.000108218715,0.0001901843,0.00013655346,0.0017661055,0.00061957224,0.00014234717,0.000050368464],"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.001715256,0.0020671443,0.1233741,0.004317863,0.0008717059,0.000035350102,0.21633798,0.0035409827,0.00020639143,0.12285701,0.46613076,0.058545448],"study_design_scores_gemma":[0.004989444,0.0007441409,0.000363836,0.00026855498,0.00007340022,0.00001597927,0.0016166001,0.85108864,0.0022760388,0.005896046,0.1317375,0.0009298406],"about_ca_topic_score_codex":0.00008898076,"about_ca_topic_score_gemma":0.00012958587,"teacher_disagreement_score":0.84754765,"about_ca_system_score_codex":0.00007763688,"about_ca_system_score_gemma":0.0001596032,"threshold_uncertainty_score":0.99992955},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02019459,0.0053421096,0.0045298403,0.005520802,0.00057215756,0.0011088073,0.000015690652,0.00018397195,0.96253204],"genre_scores_gemma":[0.8985384,0.0028703285,0.0026244994,0.003701936,0.00028844096,0.0000123997115,0.000020933614,0.000030355632,0.09191271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968768,0.0002526301,0.00072036614,0.0010056633,0.00053708884,0.0006074609],"domain_scores_gemma":[0.9971172,0.0007075291,0.0007578218,0.00090606796,0.00031375987,0.00019761427],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0044953893,0.00045204887,0.00089026237,0.00044487405,0.0014477157,0.00018935838,0.0016262027,0.0004948519,0.000012058861],"category_scores_gemma":[0.0006008424,0.0003173571,0.000118924756,0.00038365705,0.008919761,0.00043428363,0.0009618786,0.0008224663,0.0000069083735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006875693,0.00006500561,0.00011493539,0.00003809579,0.000013192518,0.000024487901,0.0009913376,0.00002768608,0.000056481338,0.9893998,0.00034061613,0.008859584],"study_design_scores_gemma":[0.0025044736,0.000874269,0.007638341,0.0003026086,0.00005982084,0.00069546705,0.00019056928,0.002663999,0.00011804091,0.7395007,0.24468966,0.0007620543],"about_ca_topic_score_codex":0.00013048196,"about_ca_topic_score_gemma":0.00013827275,"teacher_disagreement_score":0.8783438,"about_ca_system_score_codex":0.00012249181,"about_ca_system_score_gemma":0.00022623253,"threshold_uncertainty_score":0.9999279},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15622842,0.0005783324,0.79709023,0.0042003724,0.0015137912,0.0009867524,0.00012002829,0.0006658399,0.03861625],"genre_scores_gemma":[0.97204006,0.002917365,0.021444896,0.0013234292,0.00046383007,0.00031770003,0.00027957433,0.000023493478,0.0011896341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99491435,0.00062837324,0.0019637928,0.00032397624,0.0008612091,0.0013082817],"domain_scores_gemma":[0.9947823,0.00046813895,0.0018232685,0.00073095167,0.0017424304,0.0004529016],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0029203207,0.0006847724,0.00053400634,0.0009385887,0.0011925024,0.0021714268,0.0012671395,0.000796136,0.00022200274],"category_scores_gemma":[0.0017701851,0.00055053865,0.00026825373,0.0009560455,0.00046741703,0.044737395,0.00041611167,0.00038630172,0.001477759],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052048315,0.00011252954,0.0065847533,0.0010503988,0.00004945905,0.0000028472327,0.1380923,0.00013616672,0.0007673877,0.3059814,0.0043833856,0.5427874],"study_design_scores_gemma":[0.0028878474,0.0010183561,0.21436961,0.0058769784,0.00014631222,0.0007033431,0.02184398,0.40326583,0.014121876,0.11498374,0.21801156,0.0027705566],"about_ca_topic_score_codex":0.003430165,"about_ca_topic_score_gemma":0.00016640728,"teacher_disagreement_score":0.81581163,"about_ca_system_score_codex":0.0019362617,"about_ca_system_score_gemma":0.0018803998,"threshold_uncertainty_score":0.9996946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052250925,0.0005448564,0.8785825,0.0039328793,0.0001879276,0.0006344176,0.000008455334,0.0005190965,0.063338965],"genre_scores_gemma":[0.9690369,0.000034889694,0.027602503,0.0001834874,0.000065075044,0.00021958712,0.00001289301,0.00001811565,0.0028265628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980272,0.00013232397,0.00042401918,0.0006074962,0.0003237366,0.00048520192],"domain_scores_gemma":[0.99768037,0.00031108878,0.00029016068,0.0010616067,0.00048350167,0.00017327056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503364,0.00021063778,0.00028267063,0.00053090433,0.0001566934,0.00013613715,0.00094281405,0.00013721005,0.00008492995],"category_scores_gemma":[0.0005766416,0.0001384675,0.0000704765,0.0022370035,0.000109370165,0.0013162477,0.0002003147,0.00015711309,0.00013608462],"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.000032207394,0.0004727979,0.084952325,0.00002419104,0.00004595895,0.0000022265476,0.00062225247,0.000030394673,0.0011161825,0.87330174,0.0015517474,0.03784799],"study_design_scores_gemma":[0.0053708507,0.0014774473,0.86172825,0.000674963,0.000100487916,0.00010371543,0.00019155483,0.016277142,0.00407903,0.04509686,0.06345982,0.0014398901],"about_ca_topic_score_codex":0.00007175088,"about_ca_topic_score_gemma":0.00019390802,"teacher_disagreement_score":0.91678596,"about_ca_system_score_codex":0.00015118698,"about_ca_system_score_gemma":0.00032339152,"threshold_uncertainty_score":0.56465405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8661976,0.000438205,0.12663904,0.0010965187,0.0002847649,0.00011650576,0.000006114172,0.0000768627,0.005144411],"genre_scores_gemma":[0.9954769,0.000024140154,0.0023786863,0.00007196488,0.000031205745,3.2617692e-7,0.000004898036,0.0000038731023,0.0020080188],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991119,0.0000924807,0.00007991006,0.00027849557,0.000264828,0.00017236552],"domain_scores_gemma":[0.9994044,0.00004663361,0.00013184105,0.00025456698,0.00007891533,0.000083666004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019353836,0.00009430131,0.00016197065,0.00014955045,0.00039750815,0.000072916926,0.001164175,0.000036544225,0.00023582767],"category_scores_gemma":[0.000020262285,0.00010556885,0.000057714522,0.00036667107,0.00007705141,0.00075498055,0.0013558462,0.0001316146,0.000004054194],"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.00018478434,0.0005315398,0.034597185,0.00024359596,0.0002742857,0.00049973506,0.0668073,0.0034131121,0.00877606,0.42032066,0.027309174,0.43704256],"study_design_scores_gemma":[0.004986293,0.00062807184,0.5747849,0.000041437914,0.00015340846,0.00028425152,0.0064864648,0.28154385,0.0015495287,0.04656018,0.08164982,0.0013318232],"about_ca_topic_score_codex":0.00066220027,"about_ca_topic_score_gemma":0.00024878487,"teacher_disagreement_score":0.54018766,"about_ca_system_score_codex":0.00005277888,"about_ca_system_score_gemma":0.000060671842,"threshold_uncertainty_score":0.4304973},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5567088,0.0015443263,0.4084175,0.00066750625,0.00053553405,0.0011538949,0.0000015033105,0.0003420934,0.03062885],"genre_scores_gemma":[0.97553986,0.00011321284,0.023358881,0.000008340824,0.00007024463,0.000066226465,0.0000034909374,0.000011767513,0.00082799915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982692,0.00019880391,0.00048484775,0.00054191175,0.00020949553,0.0002957308],"domain_scores_gemma":[0.99859774,0.00036358106,0.00030000598,0.0003702821,0.000259038,0.00010932692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499848,0.00017791163,0.00027352665,0.00024575938,0.000119859484,0.00009225565,0.00032906473,0.00009753228,0.000007775813],"category_scores_gemma":[0.001373366,0.00012459526,0.00006416199,0.00055530627,0.00013806541,0.00069446315,0.0002555967,0.00009466624,0.000018004699],"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.00002955994,0.00020104393,0.2395868,0.00013890541,0.000019264835,0.0000052697305,0.00442449,0.000101684585,0.0029963737,0.41450626,0.000010385354,0.33797997],"study_design_scores_gemma":[0.0059239347,0.00047794188,0.6994034,0.0024416116,0.00006413769,0.00014356332,0.0008227688,0.22296873,0.02021653,0.041315425,0.0049685775,0.0012533724],"about_ca_topic_score_codex":0.00004581595,"about_ca_topic_score_gemma":0.00017636402,"teacher_disagreement_score":0.4598166,"about_ca_system_score_codex":0.00009643052,"about_ca_system_score_gemma":0.00011536072,"threshold_uncertainty_score":0.5080847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9487524,0.00075344543,0.03424746,0.013069207,0.00019904786,0.0007668945,0.000033654756,0.00007994126,0.002097965],"genre_scores_gemma":[0.99651134,0.00029581488,0.0014839743,0.000027217355,0.000077576165,8.9963083e-7,0.00002195531,0.0000054820266,0.0015757125],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99725944,0.0006238925,0.00016518701,0.00058483897,0.00087047525,0.0004961785],"domain_scores_gemma":[0.9979285,0.00034847704,0.00006770624,0.0010349798,0.0005121232,0.000108221626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026540877,0.000120688324,0.00018052963,0.0004101335,0.0003074558,0.00004513345,0.0022303334,0.00006894054,0.000046287616],"category_scores_gemma":[0.00062397955,0.000077623656,0.00007573557,0.001179935,0.00036735323,0.00068423676,0.0008463371,0.00028305838,0.00021143472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002603277,0.0042874203,0.014454586,0.00023544914,0.000102532686,0.0007997756,0.09334407,0.000059145117,0.05265759,0.050864216,0.079179615,0.70375526],"study_design_scores_gemma":[0.006771893,0.0022136082,0.5629902,0.0005887818,0.000030424739,0.000129654,0.01010324,0.0055431584,0.014438961,0.011923948,0.38398516,0.0012809427],"about_ca_topic_score_codex":0.001183456,"about_ca_topic_score_gemma":0.0010173363,"teacher_disagreement_score":0.7024743,"about_ca_system_score_codex":0.00021503409,"about_ca_system_score_gemma":0.0002485929,"threshold_uncertainty_score":0.41445518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054170066,0.000025914711,0.9807499,0.004146882,0.0013250198,0.00027334687,0.000014534588,0.00015066232,0.007896708],"genre_scores_gemma":[0.97871655,0.000050486644,0.019976785,0.00026256999,0.00027659963,0.00006153857,0.0000028169766,0.00001416115,0.00063849485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998112,0.000044193246,0.00048606328,0.0006793524,0.0002888039,0.000389555],"domain_scores_gemma":[0.99832207,0.00042161092,0.00021499711,0.00033707038,0.0005582222,0.00014601706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043388116,0.00023730924,0.0002213526,0.00018070788,0.00017990737,0.0004918657,0.0009246992,0.00008748363,0.00012601502],"category_scores_gemma":[0.0008575016,0.00017480168,0.00010283502,0.00010418041,0.00016268456,0.0004810037,0.00029268506,0.0001244908,0.000139383],"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.000031726024,0.000054430475,0.000032678498,0.0000057949974,0.000017744205,0.000005204884,0.0002454041,0.000007662789,0.019099697,0.65866387,0.00005416713,0.3217816],"study_design_scores_gemma":[0.00019171096,0.0005227968,0.00040208275,0.00036579042,0.000012875304,0.000042237803,0.00013081776,0.50451064,0.09490099,0.39584595,0.0024420368,0.00063204573],"about_ca_topic_score_codex":0.000032741806,"about_ca_topic_score_gemma":0.00006786021,"teacher_disagreement_score":0.97329956,"about_ca_system_score_codex":0.00010192782,"about_ca_system_score_gemma":0.00014537819,"threshold_uncertainty_score":0.71282053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.698991,0.00009345984,0.27646407,0.00015154092,0.001252486,0.0001239015,4.861715e-7,0.00021502998,0.02270804],"genre_scores_gemma":[0.9384776,0.0000021355731,0.061167523,0.000107376065,0.00020397613,0.000001073131,0.0000010138789,0.000007204883,0.000032123993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.000115350325,0.0003590297,0.00034652205,0.00015060857,0.0003438015],"domain_scores_gemma":[0.9989646,0.00018932659,0.00015261784,0.0004930517,0.00012875749,0.000071632094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063535746,0.0001355064,0.0002505154,0.00010274931,0.00015554026,0.00008622229,0.0008505255,0.0000638836,0.000039647606],"category_scores_gemma":[0.0001748734,0.00013050532,0.000043803757,0.000385778,0.00033452173,0.00037176372,0.00036446538,0.00013237135,0.000016180644],"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.000021332977,0.00019780075,0.045299936,0.000057483277,0.000024264547,0.00003753709,0.020802997,0.000118207114,0.0024612579,0.81665343,0.0002148799,0.11411085],"study_design_scores_gemma":[0.0025403565,0.0028443157,0.109048046,0.0005458638,0.000013201543,0.00020248126,0.0025086051,0.7345785,0.046098053,0.09862231,0.0017980719,0.0012002144],"about_ca_topic_score_codex":0.000040232797,"about_ca_topic_score_gemma":0.000046293884,"teacher_disagreement_score":0.7344603,"about_ca_system_score_codex":0.000034451612,"about_ca_system_score_gemma":0.000087254935,"threshold_uncertainty_score":0.5321852},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013297716,0.00082992425,0.9399866,0.00041919816,0.00033228143,0.0013306708,0.000040377447,0.00011056464,0.056949038],"genre_scores_gemma":[0.032114454,0.0015327152,0.7969065,0.003310928,0.0020194212,0.0070045795,0.00034022995,0.00020348532,0.15656772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980779,0.000025813279,0.0004934507,0.0008778981,0.00019208412,0.00033282788],"domain_scores_gemma":[0.99875546,0.000055616238,0.00016870811,0.00064301415,0.00017202485,0.00020516243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017353016,0.0003329893,0.00035311253,0.0004485693,0.0002089725,0.00017523557,0.0007836368,0.00022708235,0.00002087582],"category_scores_gemma":[0.000024021834,0.00029469797,0.000086907625,0.00029205857,0.00014307314,0.00015476502,0.00016231912,0.00019844783,0.00022417789],"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.0000068772456,0.00016144305,0.000043680244,0.000026811285,0.000015891012,0.0000020899183,0.00077994645,0.00013221614,0.000008853698,0.6435707,0.0012644444,0.353987],"study_design_scores_gemma":[0.00016477672,0.00014582282,0.00005393659,0.00036656795,0.000052119376,0.000005595702,0.00015155908,0.26635712,0.00093478075,0.19277838,0.5374333,0.0015560004],"about_ca_topic_score_codex":0.000010580842,"about_ca_topic_score_gemma":0.000025153957,"teacher_disagreement_score":0.5361689,"about_ca_system_score_codex":0.00010834386,"about_ca_system_score_gemma":0.000097728196,"threshold_uncertainty_score":0.9999505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011867456,0.000020269948,0.9413316,0.010282439,0.002312581,0.00019568353,0.000031038686,0.00027512794,0.03368377],"genre_scores_gemma":[0.9927718,0.000035556433,0.0035170633,0.00081606826,0.00040684626,0.0000469432,0.0000058502105,0.000017406417,0.0023824424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697226,0.0001103219,0.0006875374,0.000893199,0.00083579763,0.0005008517],"domain_scores_gemma":[0.9980238,0.0002820677,0.0003014041,0.00059904123,0.00058871,0.00020493976],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046094097,0.00033251612,0.00029202946,0.00030810176,0.0001858323,0.0005744196,0.0018721182,0.00013952293,0.001684514],"category_scores_gemma":[0.00038235085,0.00024632298,0.00018186313,0.00017968274,0.00018430968,0.000825423,0.00039743911,0.0002512761,0.0044522113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004059616,0.0001539102,0.00026611955,0.000004242407,0.00004043286,0.000034167133,0.0014260581,0.000046581143,0.010273469,0.8178059,0.00071303913,0.16919547],"study_design_scores_gemma":[0.00023672408,0.000453958,0.002076067,0.0007283276,0.000017898954,0.00007584866,0.0003658098,0.089920916,0.36255074,0.5334772,0.008943805,0.0011527477],"about_ca_topic_score_codex":0.000055522854,"about_ca_topic_score_gemma":0.000023908173,"teacher_disagreement_score":0.98090434,"about_ca_system_score_codex":0.00020366692,"about_ca_system_score_gemma":0.00017868393,"threshold_uncertainty_score":0.9999989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004945487,0.0047319666,0.89100045,0.00092165096,0.0002831277,0.0013584784,0.000008863643,0.00004793419,0.101598084],"genre_scores_gemma":[0.870005,0.018462794,0.07110202,0.0011564236,0.0010568859,0.0012578622,0.00005809268,0.000106329215,0.03679458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846953,0.000040025858,0.0005955129,0.0004977802,0.00016589928,0.0002312248],"domain_scores_gemma":[0.9988912,0.00012514862,0.0002560625,0.0005940128,0.00008560119,0.000048012378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208863,0.00020952254,0.00034695028,0.00020342512,0.000109152796,0.000087679226,0.0008093588,0.00019575235,0.000013827312],"category_scores_gemma":[0.000036776524,0.00014572653,0.00008731681,0.00017446461,0.0002966766,0.00013162149,0.00015122279,0.00027290688,0.000046844238],"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.0000021967574,0.000030294117,0.00004308689,0.000014656611,0.000003848944,0.0000015827584,0.00084550417,0.0000010873521,0.0000069734297,0.49050012,0.00018638503,0.50836426],"study_design_scores_gemma":[0.000032592132,0.00008370991,0.000011949056,0.00037621352,0.000011164209,0.0000070652827,0.0008578166,0.0011512357,0.00040826545,0.87462336,0.12216427,0.00027236668],"about_ca_topic_score_codex":0.000010681343,"about_ca_topic_score_gemma":0.00014576367,"teacher_disagreement_score":0.86995554,"about_ca_system_score_codex":0.000046193396,"about_ca_system_score_gemma":0.000056492292,"threshold_uncertainty_score":0.59425557},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97228223,0.00048179738,0.021781987,0.0038199928,0.00013860415,0.00042087556,0.000061445506,0.0001033437,0.0009097466],"genre_scores_gemma":[0.9934165,0.00044680605,0.0028096985,0.000017624816,0.00007425103,4.966798e-7,0.000023584756,0.000008501392,0.0032025545],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979138,0.00028262657,0.0001515328,0.0006993261,0.0004804187,0.00047229909],"domain_scores_gemma":[0.9978511,0.00031346903,0.000077696124,0.0008820891,0.00065660564,0.00021904804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011379889,0.00015318241,0.00023470483,0.00039220016,0.0004024841,0.000049447466,0.0013618016,0.00007511575,0.00006247688],"category_scores_gemma":[0.0005103437,0.00010963382,0.0000673709,0.0006229452,0.00049425726,0.00086968864,0.0013337046,0.00018594967,0.00010794262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020859066,0.0016264166,0.019019974,0.00024680814,0.00017160583,0.00020991129,0.034229778,0.0000044526687,0.08934518,0.00698476,0.04190686,0.80604565],"study_design_scores_gemma":[0.009177545,0.0029411034,0.5636292,0.0007967531,0.00003674953,0.00017848633,0.004872084,0.0070711896,0.050578162,0.018979233,0.3398539,0.0018855374],"about_ca_topic_score_codex":0.00032585108,"about_ca_topic_score_gemma":0.00018451245,"teacher_disagreement_score":0.8041601,"about_ca_system_score_codex":0.00010712646,"about_ca_system_score_gemma":0.00020148394,"threshold_uncertainty_score":0.44707373},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001878219,0.0012895799,0.9636734,0.00018614792,0.002738445,0.00031755882,0.0000010420546,0.0004273709,0.03134767],"genre_scores_gemma":[0.07604103,0.00018562253,0.8827081,0.0027690302,0.003932557,0.00004890422,0.000021328624,0.00014108136,0.034152403],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995337,0.00017079109,0.0004776486,0.0019235708,0.001003291,0.0010877153],"domain_scores_gemma":[0.9970403,0.0007981232,0.0003103377,0.0013532887,0.00025133396,0.0002466349],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018867118,0.0006405652,0.0006250851,0.00083266967,0.0004984296,0.0008173564,0.00535701,0.0004523342,0.000027744476],"category_scores_gemma":[0.0003430718,0.0005515707,0.00020436147,0.0014040685,0.0009196494,0.0006928856,0.0020169392,0.0017401831,0.0001878772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039234783,0.00005644315,0.000047533507,0.00005754372,0.000014714501,0.00021539997,0.003906855,0.052843925,0.00003120729,0.057895653,0.00007859962,0.8848482],"study_design_scores_gemma":[0.0004905259,0.00030564776,0.00014160443,0.00053110946,0.000011117749,0.00020541789,3.9896148e-7,0.29004163,0.0005913619,0.69280165,0.013785816,0.0010937346],"about_ca_topic_score_codex":0.0000133571975,"about_ca_topic_score_gemma":0.00002437668,"teacher_disagreement_score":0.8837545,"about_ca_system_score_codex":0.0016331441,"about_ca_system_score_gemma":0.004968297,"threshold_uncertainty_score":0.9996936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18241574,0.0003525138,0.8051615,0.00010364714,0.0004990987,0.0019614883,0.0000063637426,0.00064876414,0.008850929],"genre_scores_gemma":[0.97587115,0.00006303889,0.022049582,0.000015169193,0.00008571289,0.000021847578,0.000092987364,0.000027665817,0.0017728343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968784,0.0002687255,0.00044748522,0.0016626525,0.00022254566,0.0005202208],"domain_scores_gemma":[0.9969017,0.000105697065,0.00082830305,0.0014928259,0.0004133468,0.00025814015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027891053,0.0005514112,0.0006489524,0.0003053742,0.00023922209,0.00012656624,0.0015883307,0.0005165643,0.000020017738],"category_scores_gemma":[0.000039283575,0.00046743086,0.0003443551,0.0010544067,0.0004329522,0.0005388257,0.0010132786,0.00066099514,0.000018150356],"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.004288888,0.02312926,0.15949982,0.0038389834,0.003218733,0.032394446,0.056413677,0.099013664,0.00094294205,0.11973776,0.001801167,0.49572065],"study_design_scores_gemma":[0.0070951073,0.009527978,0.01841307,0.0033173948,0.0014392895,0.0007805526,0.0024613717,0.88292545,0.00077677495,0.064625196,0.003671778,0.004966048],"about_ca_topic_score_codex":0.00025790953,"about_ca_topic_score_gemma":0.00009332353,"teacher_disagreement_score":0.7934554,"about_ca_system_score_codex":0.0001993199,"about_ca_system_score_gemma":0.00031629656,"threshold_uncertainty_score":0.99977773},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7066603,0.00037436833,0.2080194,0.0011696836,0.00081980246,0.0011234911,0.00026898395,0.00023644607,0.08132755],"genre_scores_gemma":[0.98515546,0.00017649561,0.012078754,0.0000102082395,0.000078813035,4.263874e-7,0.00001647814,0.000008841651,0.002474494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99759954,0.0001411799,0.00033938925,0.0007885967,0.00066273514,0.000468534],"domain_scores_gemma":[0.9958295,0.0002772107,0.0009940604,0.001475475,0.0011804579,0.00024326102],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000580105,0.00034929672,0.0005160282,0.0001441269,0.004488867,0.00017082323,0.0043076472,0.00028092795,0.00003646764],"category_scores_gemma":[0.00022487207,0.00036856477,0.00038094574,0.00034153304,0.0026804043,0.0018605068,0.0006921557,0.0003739628,0.000013826965],"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.0010917351,0.0018435667,0.009186043,0.0011552889,0.00092961005,0.00080170046,0.007131056,0.0007527915,0.019887554,0.9455512,0.0018162925,0.009853138],"study_design_scores_gemma":[0.011064011,0.0021595673,0.87898296,0.0011244954,0.000897592,0.00058264047,0.02350807,0.008428462,0.017298799,0.0291352,0.024049036,0.0027691855],"about_ca_topic_score_codex":0.0013219061,"about_ca_topic_score_gemma":0.00075580645,"teacher_disagreement_score":0.91641605,"about_ca_system_score_codex":0.00019330504,"about_ca_system_score_gemma":0.0020756412,"threshold_uncertainty_score":0.9998766},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8889212,0.0016255141,0.07968512,0.0019614014,0.00117512,0.0011013758,0.000028778988,0.0004164598,0.025085028],"genre_scores_gemma":[0.9937114,0.00012950414,0.002871525,0.000010263751,0.00021851316,0.0000014353894,0.000039659375,0.000010107073,0.0030075666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99722075,0.0003246805,0.00018567905,0.00055955944,0.0008970361,0.00081230927],"domain_scores_gemma":[0.99756837,0.00022419299,0.0001550473,0.0009381157,0.0008296902,0.0002846141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002711117,0.00017398196,0.0002464265,0.0004450273,0.0007702991,0.00010785155,0.0012842418,0.00012113844,0.000106782536],"category_scores_gemma":[0.000599678,0.0001757262,0.00010826739,0.0010251194,0.0006032971,0.002294781,0.0006800563,0.0004835933,0.0004441618],"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.000472538,0.003127888,0.007041388,0.000557169,0.00037693678,0.00012556207,0.11373799,0.000048717102,0.057730205,0.53708386,0.04182084,0.2378769],"study_design_scores_gemma":[0.003875883,0.001203164,0.5321153,0.00018500685,0.000085267486,0.00018658255,0.015389255,0.0021110103,0.108272724,0.052690927,0.28200448,0.0018804534],"about_ca_topic_score_codex":0.0011111759,"about_ca_topic_score_gemma":0.0002526127,"teacher_disagreement_score":0.5250739,"about_ca_system_score_codex":0.00032957076,"about_ca_system_score_gemma":0.00035125343,"threshold_uncertainty_score":0.7165907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9366569,0.00022526996,0.06029962,0.0008887658,0.0001651701,0.00021556627,4.0018128e-7,0.0000061340797,0.0015421961],"genre_scores_gemma":[0.99645364,0.00016950091,0.00316981,0.00000796349,0.00011076451,0.000007691176,9.310674e-8,0.000008934242,0.000071579256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968009,0.00032686588,0.0007917368,0.00030115843,0.0011370645,0.0006422523],"domain_scores_gemma":[0.9974884,0.0006513882,0.00052675296,0.0006402517,0.00052184926,0.00017139727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003555155,0.00015340687,0.00045267865,0.0007199672,0.00027141024,0.00045967885,0.0023424383,0.00011068051,0.000042203716],"category_scores_gemma":[0.0013407577,0.00010484923,0.000090887785,0.00057006883,0.00030220312,0.00063615787,0.00045468213,0.0011849736,0.000011413333],"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.0017400788,0.004393495,0.26406962,0.00033826238,0.00017030285,0.0017214692,0.036432773,0.022600777,0.006284558,0.13458906,0.000037862024,0.52762175],"study_design_scores_gemma":[0.0006390996,0.0030842212,0.110687256,0.0051000253,0.000019213301,0.00009489145,0.0066622016,0.32161686,0.1399567,0.4112828,0.00016617012,0.00069053954],"about_ca_topic_score_codex":0.00040751495,"about_ca_topic_score_gemma":0.0010975082,"teacher_disagreement_score":0.5269312,"about_ca_system_score_codex":0.00021522929,"about_ca_system_score_gemma":0.00025939284,"threshold_uncertainty_score":0.51481867},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87501466,0.000034414898,0.09679161,0.0028765362,0.00047887562,0.0004521655,0.000002313043,0.00009947967,0.024249928],"genre_scores_gemma":[0.9931929,0.00004466545,0.0064801974,0.000062846215,0.000022499366,0.000017302033,1.5652108e-7,0.00000665343,0.00017274548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.000016418166,0.00040080678,0.0004481845,0.00027899008,0.00033789946],"domain_scores_gemma":[0.9988541,0.00007566392,0.00039596285,0.00036437836,0.00022355115,0.00008635584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066776684,0.00018190096,0.00024196108,0.0000706849,0.00041728865,0.0008410546,0.001858519,0.000075174445,0.000015717585],"category_scores_gemma":[0.0008988735,0.00013282124,0.000054560693,0.00015258284,0.0003134295,0.00085401087,0.00072997354,0.000245555,0.000026468544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041928022,0.00010487665,0.0042963796,0.000042629912,0.0000066696625,0.0000025555405,0.0029055085,0.0002023358,0.015009708,0.9040291,0.000020286987,0.07333808],"study_design_scores_gemma":[0.000058386966,0.00016622651,0.014131184,0.00027062712,0.000005415571,0.000005497918,0.00016381782,0.37681127,0.16507812,0.4430157,0.00005552857,0.00023823386],"about_ca_topic_score_codex":0.00010738146,"about_ca_topic_score_gemma":0.00012493004,"teacher_disagreement_score":0.46101335,"about_ca_system_score_codex":0.000035837656,"about_ca_system_score_gemma":0.000065933855,"threshold_uncertainty_score":0.81103086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03536537,0.00092769664,0.9406569,0.0007482459,0.00090607884,0.00078606687,0.0000020510652,0.00003493458,0.02057263],"genre_scores_gemma":[0.9978369,0.000035837147,0.0017938778,0.00013322335,0.000108265995,0.000010441209,0.0000012333658,0.000005966378,0.000074258656],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801415,0.00014955319,0.000328788,0.00077392283,0.00043886853,0.00029473956],"domain_scores_gemma":[0.9975052,0.0009274241,0.00027368212,0.001130207,0.00012545091,0.00003806269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024197043,0.00025317076,0.0002809275,0.0003617824,0.00025527467,0.00028968952,0.0020185024,0.00021216675,0.0000031118261],"category_scores_gemma":[0.00030434335,0.00015069224,0.000060431164,0.0002814947,0.0006033949,0.00038439815,0.00050521735,0.00062839047,0.000007523644],"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.000014345793,0.000098810735,0.00069140445,0.0000281414,0.0000031026063,0.00000846987,0.01098163,0.0010546009,0.00021964591,0.25712404,0.0000067935744,0.729769],"study_design_scores_gemma":[0.00025856428,0.00018465793,0.019537017,0.00033416977,0.000004202663,0.000018847897,0.000004695855,0.43330106,0.0013214652,0.54451656,0.00025068768,0.00026804753],"about_ca_topic_score_codex":0.0001831982,"about_ca_topic_score_gemma":0.0027190158,"teacher_disagreement_score":0.96247154,"about_ca_system_score_codex":0.00021310635,"about_ca_system_score_gemma":0.00029419502,"threshold_uncertainty_score":0.6145051},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42173213,0.0013206229,0.3670664,0.0007659045,0.0014616142,0.00037744956,0.0000023592513,0.0007610435,0.20651245],"genre_scores_gemma":[0.9943061,0.000010878142,0.0038371824,0.00002120339,0.00015905111,0.00001700279,4.4155024e-7,0.000010305821,0.0016378534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902844,0.000022530134,0.0001254695,0.0002672079,0.00018659014,0.00036975986],"domain_scores_gemma":[0.9986588,0.00005826156,0.00016589698,0.0009636178,0.00006514964,0.00008827859],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027095602,0.00013904438,0.00017003252,0.000046783254,0.0008049513,0.0010637601,0.001450911,0.000050079634,0.0000035933936],"category_scores_gemma":[0.000061850726,0.000092247414,0.00004802379,0.000046744302,0.00009221785,0.0013004865,0.000361981,0.00006111326,0.00013704476],"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.000009220704,0.00008144393,0.010147701,0.000076666656,0.000058366506,0.000116658885,0.0039447765,0.000020746693,0.0005081068,0.95594203,0.0010002268,0.02809408],"study_design_scores_gemma":[0.0058566923,0.0020844901,0.30215096,0.0019044563,0.00015524613,0.002553352,0.0023356108,0.46977666,0.021072978,0.038285278,0.14915118,0.0046730703],"about_ca_topic_score_codex":0.00010254386,"about_ca_topic_score_gemma":0.000072825984,"teacher_disagreement_score":0.9176567,"about_ca_system_score_codex":0.00001833601,"about_ca_system_score_gemma":0.000049012408,"threshold_uncertainty_score":0.99997324},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001349383,0.0018579355,0.93369883,0.0005406979,0.0026574356,0.00038109333,0.0000023224231,0.00016418485,0.06056256],"genre_scores_gemma":[0.8397418,0.00017198858,0.15289707,0.0010210462,0.0009518875,0.000021532132,0.0000054246325,0.000064912136,0.0051243156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955199,0.000057419456,0.0006086551,0.0019922748,0.00083096663,0.0009907922],"domain_scores_gemma":[0.9960862,0.00049043464,0.00052030693,0.0024378016,0.0002329395,0.00023230845],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015564121,0.0006501998,0.0008201763,0.0008863037,0.00043871708,0.0010494259,0.006492929,0.00048707356,0.00002019792],"category_scores_gemma":[0.00042922312,0.00058386015,0.00017627285,0.0002933908,0.00093994185,0.000902278,0.0021227894,0.0012214712,0.00014682692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007535273,0.00003805792,0.0009742989,0.00005477435,0.000009958693,0.00051843846,0.0019501597,0.0017152388,0.00006638908,0.16578937,0.00004839323,0.8288274],"study_design_scores_gemma":[0.0012003601,0.0003081412,0.0030825397,0.0032220439,0.000012173917,0.00040422127,3.4792868e-7,0.35232297,0.0008091181,0.6288601,0.0076796804,0.0020982781],"about_ca_topic_score_codex":0.0000922263,"about_ca_topic_score_gemma":0.0007426376,"teacher_disagreement_score":0.8396069,"about_ca_system_score_codex":0.0005081581,"about_ca_system_score_gemma":0.0008510876,"threshold_uncertainty_score":0.9999876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049168132,0.0004510656,0.92540395,0.008160044,0.0003113428,0.0007834207,0.000010713204,0.00032177303,0.015389562],"genre_scores_gemma":[0.69522136,0.00012949493,0.3036019,0.000037532405,0.000050003517,0.000060900707,0.000098315824,0.000015026361,0.0007854792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601287,0.0019781643,0.0004663916,0.0009299244,0.00034340844,0.00026927306],"domain_scores_gemma":[0.9952334,0.00037631253,0.0004993981,0.001316096,0.002392942,0.00018181364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002505166,0.0002816494,0.00037863106,0.00026914442,0.00017624078,0.00045243787,0.0010928456,0.00019749592,0.000010840725],"category_scores_gemma":[0.00044324697,0.00029407354,0.0001275703,0.00041352547,0.00011674444,0.00037243415,0.0014607351,0.00043407764,0.000010972604],"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.000017074492,0.0012855645,0.00040644288,0.00011835894,0.000057929286,0.0000030420542,0.025503913,0.002221661,0.0006960809,0.22916287,0.0018442015,0.73868287],"study_design_scores_gemma":[0.00084217865,0.000011484398,0.015550599,0.0019654625,0.00009311291,0.00004207244,0.00018297699,0.85031664,0.035727434,0.091424644,0.0028112319,0.0010321416],"about_ca_topic_score_codex":0.00042293651,"about_ca_topic_score_gemma":0.0002785374,"teacher_disagreement_score":0.848095,"about_ca_system_score_codex":0.000107966844,"about_ca_system_score_gemma":0.00016018255,"threshold_uncertainty_score":0.9999511},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020277502,0.000011730628,0.9875008,0.0018541025,0.00015901627,0.00021764499,0.00023352042,0.000056150817,0.007939269],"genre_scores_gemma":[0.9456339,0.0000028856678,0.052536223,0.00040036242,0.00041136798,0.000008161874,0.0009398001,0.0000038126796,0.000063470325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991255,0.0000159623,0.0002960878,0.0001791898,0.00017937341,0.00020392632],"domain_scores_gemma":[0.998755,0.00018470048,0.00027303564,0.0005305072,0.00014940658,0.000107392494],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040456702,0.0001074426,0.00018632354,0.00009900911,0.001072825,0.0011981908,0.0012784259,0.000053749423,0.0000011266044],"category_scores_gemma":[0.00050110917,0.00009878394,0.000028942128,0.00010783675,0.000058146103,0.002730744,0.0008711526,0.00008183596,0.00003200792],"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.00001878556,0.00011805219,0.07115987,0.00023156643,0.00018455536,5.4765303e-7,0.006232519,0.001923486,0.000004120209,0.36936295,0.15334673,0.3974168],"study_design_scores_gemma":[0.00041386436,0.000027211445,0.05347328,0.000007982323,0.000018571911,0.0000011470667,0.00013466245,0.70240366,0.0000060524085,0.00052139146,0.2428528,0.00013939757],"about_ca_topic_score_codex":0.000029616436,"about_ca_topic_score_gemma":0.000029438279,"teacher_disagreement_score":0.94360614,"about_ca_system_score_codex":0.000020455187,"about_ca_system_score_gemma":0.000094507224,"threshold_uncertainty_score":0.99983865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84135693,0.0008564987,0.03758854,0.0004992017,0.00008702203,0.0000972882,1.9833051e-7,0.00012100349,0.119393334],"genre_scores_gemma":[0.9906243,0.00012283359,0.00819956,0.00015890715,0.000029916073,0.00000266311,2.4770873e-7,0.000002723815,0.00085885776],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993859,0.000025722455,0.00009904664,0.00023918481,0.000060924427,0.00018922497],"domain_scores_gemma":[0.99969476,0.00006264752,0.000018679595,0.00013222724,0.00001624141,0.00007542145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001780665,0.00006921399,0.00009110691,0.00005228779,0.000059594502,0.00009763201,0.00013850069,0.000037971018,0.000011113356],"category_scores_gemma":[0.000052001025,0.000055637654,0.000010228527,0.00014155323,0.00002959065,0.00020631071,0.00017968341,0.00006570343,0.000013775758],"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.000006917375,0.00012718033,0.35566247,0.000024909992,0.000007043216,0.00025520232,0.0038072637,0.0000037064972,0.0005536449,0.16668773,0.000586141,0.4722778],"study_design_scores_gemma":[0.0022815154,0.00019536476,0.63255537,0.00008911532,0.0000046314217,0.0005161574,0.00037047127,0.3433338,0.0006479658,0.007156327,0.012288154,0.0005611359],"about_ca_topic_score_codex":0.00012569105,"about_ca_topic_score_gemma":0.0003376056,"teacher_disagreement_score":0.47171664,"about_ca_system_score_codex":0.00000996212,"about_ca_system_score_gemma":0.000009280099,"threshold_uncertainty_score":0.22688377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14999035,0.005793117,0.60165226,0.0031773583,0.00028259383,0.00043210288,0.000024247303,0.00040845375,0.2382395],"genre_scores_gemma":[0.9171522,0.0031160933,0.073008426,0.000086167885,0.000022772689,0.000027933373,0.00004055268,0.00002900599,0.006516814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955031,0.0023124397,0.0005186411,0.0008826139,0.00043189304,0.00035129214],"domain_scores_gemma":[0.99467313,0.0007245965,0.00052981643,0.0024830855,0.0013728891,0.00021646416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027037608,0.0003223279,0.0004637635,0.00026326813,0.00030734643,0.00032480594,0.0023912801,0.00028118456,0.00001767166],"category_scores_gemma":[0.0005410995,0.0003172075,0.00017835898,0.000406415,0.00038787525,0.0002995436,0.0036321129,0.0005023493,0.0000145436725],"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.000016327827,0.0009444094,0.004095538,0.0005468859,0.00016661745,0.00001908827,0.097376,0.00068457244,0.0016248764,0.76662123,0.0044086897,0.12349579],"study_design_scores_gemma":[0.0011696679,0.0000026228488,0.005823546,0.0029396168,0.00006194672,0.000069543756,0.00018845715,0.8045021,0.053223304,0.10593257,0.02478754,0.0012990276],"about_ca_topic_score_codex":0.0012524659,"about_ca_topic_score_gemma":0.0005336401,"teacher_disagreement_score":0.8038176,"about_ca_system_score_codex":0.000056030778,"about_ca_system_score_gemma":0.00025927706,"threshold_uncertainty_score":0.999928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013642097,0.000053870688,0.9819708,0.00074563816,0.00068651396,0.00023851504,0.000005520651,0.00016006932,0.0024969818],"genre_scores_gemma":[0.9421711,0.000011321033,0.05756578,0.00007584962,0.000040974235,0.000033116437,0.0000072681705,0.000008491728,0.00008612623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986501,0.00014264212,0.00025057982,0.00037675476,0.00037222105,0.00020771222],"domain_scores_gemma":[0.9979544,0.000668644,0.0002634559,0.0008411116,0.00019153256,0.000080817576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034415224,0.00018718561,0.00023356115,0.00013347623,0.0009047046,0.00017563245,0.0012429853,0.000100077086,0.00004413132],"category_scores_gemma":[0.00011200404,0.00014539067,0.00015700574,0.00014446523,0.00024969704,0.00054457557,0.00004196361,0.00019123463,0.00007999653],"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.00013819573,0.00047103266,0.0005626418,0.00006197906,0.00007674375,0.000012624973,0.00034436025,0.049002632,0.00042060346,0.1693637,0.00006650738,0.77947897],"study_design_scores_gemma":[0.0021951564,0.0021161917,0.047203317,0.00016166047,0.000056076413,0.00007621966,0.000052410393,0.18631922,0.026648358,0.734042,0.00056830456,0.0005610949],"about_ca_topic_score_codex":0.000015673715,"about_ca_topic_score_gemma":0.000012731984,"teacher_disagreement_score":0.92852896,"about_ca_system_score_codex":0.000056384015,"about_ca_system_score_gemma":0.000085870604,"threshold_uncertainty_score":0.6958348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046964414,0.00012466959,0.9299664,0.00026358006,0.00065171235,0.00014755502,6.2115095e-7,0.00013123985,0.021749828],"genre_scores_gemma":[0.8765677,0.000009075855,0.12302738,0.00032954162,0.000041183044,0.0000063061593,6.0869024e-7,0.0000043662453,0.00001380361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976422,0.0002182156,0.00027630894,0.00076162437,0.0005311987,0.0005704062],"domain_scores_gemma":[0.99844676,0.0002623012,0.000058608333,0.00086008094,0.0001376843,0.00023456052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021328023,0.00016630144,0.00019171179,0.00024113977,0.00026234775,0.00029715223,0.001521583,0.00003667882,0.000040823474],"category_scores_gemma":[0.0004437434,0.00013306251,0.000050595245,0.0015333048,0.001571293,0.000852872,0.0006247224,0.00017682844,0.00013807716],"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.0000016741682,0.000080955695,0.0010577802,0.000004085002,0.0000010401238,0.000019240457,0.00025189447,0.000039554485,0.000098176235,0.97654766,0.000027694521,0.021870228],"study_design_scores_gemma":[0.0007816991,0.00024053172,0.00877771,0.000116279465,0.000005624628,0.000172848,0.000021471637,0.5180898,0.016724514,0.45175743,0.0026855476,0.0006266025],"about_ca_topic_score_codex":0.000006056075,"about_ca_topic_score_gemma":0.0000058489613,"teacher_disagreement_score":0.8296033,"about_ca_system_score_codex":0.00009270749,"about_ca_system_score_gemma":0.00021151686,"threshold_uncertainty_score":0.57894945},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000041310846,0.0003992225,0.058755282,0.00022186192,0.0012539529,0.00010505927,4.883545e-7,0.00007549493,0.9391845],"genre_scores_gemma":[0.011442536,0.00009709743,0.0032469388,0.000063342995,0.00038429798,0.0000024798355,0.0000017593113,0.000010088631,0.98475146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990994,0.000012996762,0.0002032349,0.0003269878,0.0002079647,0.00014943785],"domain_scores_gemma":[0.9981935,0.00006141172,0.00041180238,0.0011436685,0.00015734695,0.000032253254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000360821,0.0001626316,0.00021080255,0.00005211822,0.0002540191,0.00012032615,0.0013614749,0.00015553086,0.0001352265],"category_scores_gemma":[0.00006313173,0.000093350835,0.00014926108,0.000011929023,0.000140215,0.00015911002,0.000443364,0.00020466647,0.00020317447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.240768e-7,0.0000040543664,0.000007248973,0.000010721266,0.000013847879,0.000002742587,0.00017187383,5.199019e-7,0.0000086740265,0.9778785,0.002447159,0.019454043],"study_design_scores_gemma":[0.000089454654,0.00005745982,0.00007692899,0.00007991916,0.000021288659,0.000027651666,0.000007933618,0.0004892565,0.00018162208,0.54974425,0.44900003,0.00022420687],"about_ca_topic_score_codex":0.000023153074,"about_ca_topic_score_gemma":0.000022628215,"teacher_disagreement_score":0.44655287,"about_ca_system_score_codex":0.000020510763,"about_ca_system_score_gemma":0.000056894918,"threshold_uncertainty_score":0.38067365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8503742,0.00000507438,0.10654302,0.010061627,0.00091144897,0.00027154165,0.000016247901,0.00003159247,0.031785216],"genre_scores_gemma":[0.9986248,0.000012518361,0.00040206575,0.0007782521,0.00004423549,0.000010667823,0.0000035476173,0.0000039400697,0.000119998746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984425,0.00020986282,0.00034257604,0.00042567102,0.00042025425,0.00015915053],"domain_scores_gemma":[0.9984779,0.00043523646,0.00021989761,0.00053993025,0.0002538592,0.000073224524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002435,0.00013321513,0.00014258407,0.000077988756,0.00027243473,0.00043520992,0.0015565603,0.000093871364,0.000397616],"category_scores_gemma":[0.0009246528,0.000092934504,0.000048454516,0.000055000597,0.00036140103,0.00024843903,0.00025840363,0.00034453603,0.000052609204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007005379,0.00020791133,0.0016759024,0.0000023970517,0.000009284592,0.0000066389566,0.0008494498,0.00035654788,0.000034110173,0.96012366,0.00004953198,0.036614496],"study_design_scores_gemma":[0.000043200773,0.00014613422,0.028317528,0.00004970866,0.0000014603609,0.0000015369715,0.00011148334,0.24355061,0.0008953378,0.7267163,0.00007003054,0.00009670754],"about_ca_topic_score_codex":0.000059700902,"about_ca_topic_score_gemma":0.00010855477,"teacher_disagreement_score":0.24319406,"about_ca_system_score_codex":0.000032592485,"about_ca_system_score_gemma":0.00006748745,"threshold_uncertainty_score":0.43536162},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61215025,0.008607823,0.1028679,0.018904468,0.00051681144,0.0019281026,0.00004611415,0.0010187019,0.2539598],"genre_scores_gemma":[0.9268223,0.00028112883,0.07038377,0.00013118866,0.000030054169,0.000046793626,0.0000666725,0.00002323971,0.0022148252],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9945,0.0027859386,0.00060455035,0.0012511458,0.00039804823,0.00046030985],"domain_scores_gemma":[0.99465793,0.0012161102,0.00046475246,0.0026373237,0.0008199277,0.00020396146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050109643,0.00039807163,0.00047477966,0.00021245335,0.0002683283,0.0006671813,0.002310662,0.00041307416,0.00007068656],"category_scores_gemma":[0.001697236,0.00037573779,0.0001395024,0.00038298496,0.00029402116,0.00022577304,0.003138926,0.0009973943,0.0000150781825],"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.000027833692,0.0013600882,0.005840373,0.00039995424,0.000072813265,0.000029203273,0.032937746,0.00031983026,0.0008551824,0.459332,0.0013000923,0.4975249],"study_design_scores_gemma":[0.003243979,0.000003477051,0.51244056,0.0024577864,0.000065126376,0.0000644573,0.00035463332,0.13349837,0.022880858,0.24310744,0.07916827,0.0027150647],"about_ca_topic_score_codex":0.0005412517,"about_ca_topic_score_gemma":0.0021656794,"teacher_disagreement_score":0.50660014,"about_ca_system_score_codex":0.00015809147,"about_ca_system_score_gemma":0.0002818609,"threshold_uncertainty_score":0.99986947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019034525,0.000022605755,0.9594753,0.0006241203,0.00009326782,0.00032225042,0.0000039548218,0.00008907857,0.020334894],"genre_scores_gemma":[0.7920296,0.0000045093625,0.2073284,0.00013246585,0.00002106792,0.00004763281,0.000012127188,0.0000047071944,0.00041949513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992234,0.000043742686,0.00023121898,0.00023155248,0.00008089949,0.00018915403],"domain_scores_gemma":[0.9985951,0.0002253767,0.00017936071,0.0008174376,0.0001283477,0.00005435066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024107535,0.00010074599,0.00014857859,0.000051191077,0.0005248923,0.0004263016,0.0013243937,0.00003843215,0.000013298708],"category_scores_gemma":[0.0001514045,0.000089858775,0.00005823685,0.000043293225,0.000059884474,0.000614902,0.00044495484,0.00008805666,0.000020085878],"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.00001788807,0.00048810808,0.011566953,0.00004961095,0.000041218318,0.0000027759777,0.0392654,0.053896982,0.0008796404,0.8497322,0.0057078903,0.038351305],"study_design_scores_gemma":[0.0005711322,0.00002115237,0.0060976376,0.000022159591,0.000002148698,0.000001091103,0.00008841269,0.986233,0.000089935835,0.0061541917,0.0006011968,0.00011795509],"about_ca_topic_score_codex":0.00021827518,"about_ca_topic_score_gemma":0.0014501936,"teacher_disagreement_score":0.93233603,"about_ca_system_score_codex":0.000060569797,"about_ca_system_score_gemma":0.000054430988,"threshold_uncertainty_score":0.4110836},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028878422,0.002356408,0.41815993,0.0044357954,0.0004552802,0.00025761942,0.0000062391377,0.00055688823,0.54489344],"genre_scores_gemma":[0.9768025,0.00023615758,0.011370896,0.00007234363,0.000026518086,0.000025455325,0.000009850291,0.000013934396,0.011442323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968696,0.0014160363,0.000370507,0.0005638298,0.00036847332,0.00041152246],"domain_scores_gemma":[0.99545646,0.001373296,0.00021799005,0.0017037523,0.0010064351,0.00024207673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024128952,0.00020173288,0.00023038618,0.00010359258,0.00034827756,0.0006541034,0.0018963491,0.00012907683,0.00024425794],"category_scores_gemma":[0.0011969442,0.00018919045,0.00010856698,0.00050208607,0.00014475915,0.00042034395,0.0005074185,0.00028832647,0.00051865744],"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.0000012305728,0.00046466078,0.0025637173,0.000041812025,0.000023169365,0.000014841151,0.005677195,0.00003010715,0.0010608073,0.9236058,0.0033927038,0.06312396],"study_design_scores_gemma":[0.0022370366,0.0000032691746,0.061510645,0.001803839,0.000040311235,0.00014914529,0.00021003112,0.6503244,0.023742964,0.0071859853,0.25082907,0.0019633027],"about_ca_topic_score_codex":0.00076975115,"about_ca_topic_score_gemma":0.0005546151,"teacher_disagreement_score":0.9479241,"about_ca_system_score_codex":0.00008124263,"about_ca_system_score_gemma":0.00010907301,"threshold_uncertainty_score":0.77149624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50298876,0.00085645344,0.3023269,0.0036552816,0.00012957827,0.00035795855,0.000007413658,0.00037431606,0.18930334],"genre_scores_gemma":[0.9720822,0.00009163681,0.018616354,0.000051583553,0.000018432364,0.000014400977,0.000022908775,0.000011464089,0.009091037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976889,0.0009330583,0.0002342127,0.0005521852,0.00026030556,0.00033135602],"domain_scores_gemma":[0.9978235,0.00036096963,0.00007221518,0.001022828,0.00054451346,0.0001759896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017686682,0.00015546715,0.00015628916,0.000086582004,0.00055888755,0.00073457044,0.001157453,0.00007306302,0.0003108225],"category_scores_gemma":[0.00030490028,0.00014786066,0.00005460781,0.0004074495,0.0001808804,0.00039313265,0.0004942377,0.00022537653,0.00006754176],"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.0000045870875,0.00010605627,0.0047806245,0.00003557543,0.000017029311,0.0000060631746,0.0073143523,0.00001805497,0.00047843953,0.5281756,0.00016798431,0.45889562],"study_design_scores_gemma":[0.0018763454,0.00000415683,0.074379265,0.0007815773,0.000030733292,0.00017672945,0.00014223247,0.77709246,0.045353238,0.08176714,0.017298205,0.0010979394],"about_ca_topic_score_codex":0.0003208909,"about_ca_topic_score_gemma":0.0003229195,"teacher_disagreement_score":0.7770744,"about_ca_system_score_codex":0.000051769217,"about_ca_system_score_gemma":0.00008631703,"threshold_uncertainty_score":0.708348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030254332,0.0004686871,0.78315884,0.00021085945,0.0004147924,0.0001250957,8.17881e-7,0.00036292936,0.18500362],"genre_scores_gemma":[0.7568263,0.000013367918,0.24182086,0.00028297518,0.000082279425,0.0000039104775,0.0000017134756,0.00000596299,0.0009626278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985484,0.000034063927,0.0001921044,0.00048530565,0.00028790443,0.0004522063],"domain_scores_gemma":[0.9991999,0.00008854624,0.000090955975,0.0003798618,0.00012083791,0.000119899116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002808464,0.00019164773,0.00021784495,0.00006910412,0.00032808052,0.00036434806,0.0008169948,0.000055389228,0.00009270242],"category_scores_gemma":[0.000023794555,0.00012618666,0.000034869627,0.0005962523,0.000094338706,0.0007397677,0.00019292688,0.00014047239,0.00022935488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005043455,0.00010975885,0.011210829,0.000029762046,0.000025918705,0.000014406372,0.001914975,0.0036454657,0.00006971508,0.97406423,0.00074671954,0.008163161],"study_design_scores_gemma":[0.017063638,0.0050157392,0.04756226,0.0024346705,0.0001808204,0.0010743685,0.0049217474,0.2346596,0.017871236,0.442204,0.21853451,0.008477411],"about_ca_topic_score_codex":0.0003147181,"about_ca_topic_score_gemma":0.00023195895,"teacher_disagreement_score":0.726572,"about_ca_system_score_codex":0.00005700626,"about_ca_system_score_gemma":0.00031772986,"threshold_uncertainty_score":0.5145742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022568,0.000040173967,0.8394925,0.0023053363,0.0007462423,0.0004342695,0.000022820586,0.00021831422,0.15448353],"genre_scores_gemma":[0.98402536,0.000008236376,0.01359936,0.00077191007,0.00027859217,0.00010886591,0.000026527277,0.000013787867,0.0011673832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997185,0.000111835856,0.0005018824,0.0006812552,0.0010320018,0.00048802988],"domain_scores_gemma":[0.99690074,0.00041009302,0.00019657896,0.00038851294,0.0017874215,0.00031664496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012278106,0.00026568226,0.00026732186,0.00022338887,0.0002700777,0.0005917724,0.0014094318,0.00016408043,0.00012964249],"category_scores_gemma":[0.002538052,0.00024572996,0.0001146539,0.0005394471,0.00014225394,0.0005812339,0.00017526904,0.0002545435,0.00066275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005496336,0.00018745576,0.000016628044,0.0000063459893,0.000011090756,0.0000026896682,0.0008601703,0.00048061155,0.0001307186,0.9164745,0.0021798909,0.07959494],"study_design_scores_gemma":[0.000097736614,0.00032263773,0.00013987943,0.00003025695,0.0000050336926,0.000004492174,0.00019644927,0.24537443,0.0120464545,0.7183626,0.02309383,0.00032618752],"about_ca_topic_score_codex":0.000047073547,"about_ca_topic_score_gemma":0.000076294236,"teacher_disagreement_score":0.98176855,"about_ca_system_score_codex":0.00024717939,"about_ca_system_score_gemma":0.0013567024,"threshold_uncertainty_score":0.9999995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27476546,0.00077387935,0.61088014,0.0017472809,0.0026542826,0.0007711118,0.000004087874,0.0005899871,0.107813776],"genre_scores_gemma":[0.99151057,0.000019915984,0.00601584,0.0003599251,0.00018853544,0.000018831455,0.0000046933355,0.000010958347,0.0018707127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984027,0.000045572873,0.0003028187,0.00050083816,0.00032421923,0.00042384877],"domain_scores_gemma":[0.99895483,0.00014459972,0.00010287091,0.0004957409,0.00017757642,0.00012436863],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026466948,0.00017713683,0.00017040706,0.00009993565,0.00018321016,0.0002628672,0.00092392927,0.00008758344,0.0005043238],"category_scores_gemma":[0.0001010394,0.00015257082,0.00010818295,0.00042004665,0.00008074506,0.0006337555,0.00026521544,0.00016225321,0.012746709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010459031,0.00009146686,0.0003674202,0.000010074939,0.000010637666,0.000014768589,0.00087607006,0.00010291735,0.0031795823,0.9117585,0.00015532417,0.083422795],"study_design_scores_gemma":[0.000041651096,0.00037183703,0.0003449084,0.00006161131,0.0000075541275,0.00006654445,0.00018204581,0.077667825,0.32786256,0.58641887,0.0065104477,0.0004641623],"about_ca_topic_score_codex":0.000087058535,"about_ca_topic_score_gemma":0.000036196492,"teacher_disagreement_score":0.71674514,"about_ca_system_score_codex":0.00005389372,"about_ca_system_score_gemma":0.00012890087,"threshold_uncertainty_score":0.98802197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014941767,0.002791626,0.77708215,0.004128454,0.0005853182,0.00036694502,0.000013943527,0.00053271867,0.19955708],"genre_scores_gemma":[0.8373489,0.0012585911,0.14076558,0.00018481986,0.00009846214,0.00011469731,0.00012596883,0.00004820578,0.020054791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945402,0.002774726,0.00054932147,0.0010049621,0.00049166975,0.00063911325],"domain_scores_gemma":[0.9930186,0.0011913695,0.00047776985,0.0029989562,0.0019865881,0.00032671605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0058919215,0.0004092675,0.00038925427,0.00014755494,0.0006050633,0.00080085,0.0031064956,0.00038697748,0.00027508946],"category_scores_gemma":[0.0010067555,0.00042465568,0.00030721506,0.00029075093,0.00016156638,0.0003586156,0.003089457,0.0006499709,0.000068631256],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.000009160753,0.0013259031,0.0030965519,0.00021957213,0.00015607552,0.000017493168,0.0325861,0.00008212369,0.0015030161,0.6080935,0.005468786,0.3474417],"study_design_scores_gemma":[0.002879645,0.0000050431413,0.06097062,0.005250639,0.000217242,0.00012180886,0.0012462342,0.16148713,0.08659565,0.028928319,0.64849013,0.003807555],"about_ca_topic_score_codex":0.008353037,"about_ca_topic_score_gemma":0.034129024,"teacher_disagreement_score":0.8224071,"about_ca_system_score_codex":0.00062442204,"about_ca_system_score_gemma":0.00052088645,"threshold_uncertainty_score":0.99982053},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052482318,0.011407199,0.86008334,0.043641414,0.001211915,0.0018484944,0.00013324509,0.0005048242,0.028687242],"genre_scores_gemma":[0.9519828,0.0028469514,0.03627617,0.0016598586,0.00045863487,0.00030711753,0.00057832367,0.00006593219,0.0058242367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98857075,0.0050357347,0.0017178949,0.0023142097,0.0011501687,0.0012112707],"domain_scores_gemma":[0.9938531,0.0010758288,0.001230855,0.0014418405,0.0015113048,0.0008871077],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.008403062,0.0009881065,0.0012863609,0.0010810293,0.00034394953,0.00070942455,0.0015760602,0.0013661461,0.00020216107],"category_scores_gemma":[0.0028618153,0.0009307372,0.00042049505,0.003004208,0.0010677887,0.0021641776,0.00083599094,0.0019676345,0.0002708776],"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.00034776673,0.0031377384,0.088602304,0.00036225957,0.0009149073,0.0003645839,0.031998508,0.010710182,0.0012491755,0.8369658,0.01490334,0.01044344],"study_design_scores_gemma":[0.0038621314,0.002335741,0.14251247,0.0007068138,0.00086202216,0.00032022226,0.0074042217,0.57553375,0.0031321407,0.25566593,0.004890144,0.0027744346],"about_ca_topic_score_codex":0.002756956,"about_ca_topic_score_gemma":0.008475613,"teacher_disagreement_score":0.8995004,"about_ca_system_score_codex":0.00085998286,"about_ca_system_score_gemma":0.0037610575,"threshold_uncertainty_score":0.99993026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30374652,0.00030739364,0.6860078,0.004486554,0.00018775386,0.0002818883,0.0000019114516,0.00012889456,0.004851262],"genre_scores_gemma":[0.9672194,0.000004715689,0.032273173,0.00035309608,0.000071993476,0.00002887953,6.928384e-7,0.0000050015,0.000043051536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987907,0.00009238091,0.00015726,0.00045703104,0.00018650547,0.00031611885],"domain_scores_gemma":[0.99921036,0.00010650501,0.000040039995,0.00045862288,0.000031436102,0.00015302098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040942515,0.00015938147,0.00015848292,0.000022636534,0.00038868553,0.00017794539,0.00056173734,0.000082368904,0.0000025246425],"category_scores_gemma":[0.00017977941,0.000106216496,0.00005362501,0.00035172797,0.0004421561,0.00015497339,0.00021684515,0.00016497096,0.000021195798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047070284,0.000035582878,0.0031623566,0.000018262503,0.000010158944,0.000006989645,0.0044413297,0.0007903178,0.000006696732,0.94887275,0.00007188055,0.042578995],"study_design_scores_gemma":[0.000821392,0.00021225028,0.0859929,0.00003099662,0.00002810424,0.0001602708,0.0007210305,0.014016707,0.00021741197,0.8927609,0.004477838,0.0005601977],"about_ca_topic_score_codex":0.00015386718,"about_ca_topic_score_gemma":0.00016135552,"teacher_disagreement_score":0.6634729,"about_ca_system_score_codex":0.00027316264,"about_ca_system_score_gemma":0.000084533116,"threshold_uncertainty_score":0.43313828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013645934,0.0003321268,0.88557214,0.006016882,0.00011887307,0.000308208,0.0000048930756,0.00029066266,0.09371028],"genre_scores_gemma":[0.7059463,0.000086120795,0.27302623,0.00011679841,0.000026313435,0.00007293923,0.0000506103,0.000018859824,0.0206558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975384,0.0010287358,0.00027382822,0.00053814164,0.0002571913,0.00036369133],"domain_scores_gemma":[0.9958246,0.0010831624,0.0001916708,0.0012762079,0.0014536445,0.0001707628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020522678,0.0001852622,0.00018995999,0.00011276031,0.0005549191,0.0002291239,0.0012038408,0.000109490546,0.00007542255],"category_scores_gemma":[0.00090198166,0.00015754506,0.000111393354,0.0006475486,0.0001209667,0.0003726337,0.00027537806,0.00018314854,0.000117005584],"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.00001013551,0.0003870895,0.005003779,0.000015672636,0.000029090019,0.000008265002,0.003549909,0.000059238442,0.00041220084,0.9523838,0.0011289348,0.03701188],"study_design_scores_gemma":[0.0054224376,0.000015803205,0.03543207,0.00095864106,0.00012752073,0.00033114094,0.00037990295,0.5293019,0.03771459,0.093692824,0.29460403,0.0020191427],"about_ca_topic_score_codex":0.00017660117,"about_ca_topic_score_gemma":0.00171568,"teacher_disagreement_score":0.858691,"about_ca_system_score_codex":0.000062421735,"about_ca_system_score_gemma":0.00018006263,"threshold_uncertainty_score":0.6424501},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2647183,0.00020633166,0.23370565,0.002613447,0.0009463399,0.00045702088,0.0000014570337,0.00045259274,0.49689886],"genre_scores_gemma":[0.9505731,0.000018585157,0.043194875,0.000102770464,0.000081089696,0.000034005712,0.000001184729,0.000009914349,0.005984514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99847144,0.00005376873,0.00024257571,0.00051821966,0.00022114984,0.0004928368],"domain_scores_gemma":[0.99829817,0.00012939106,0.000109240515,0.0012468557,0.00010076314,0.00011557602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004465875,0.00018381569,0.00023887814,0.00007725146,0.0006249825,0.0008357092,0.0016968531,0.000115554976,0.000065675995],"category_scores_gemma":[0.0006740509,0.00014564626,0.000072027244,0.00014004743,0.00023366929,0.00078996137,0.00068755634,0.00019368109,0.000118690965],"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.000006019932,0.00010118175,0.048014645,0.000023103205,0.000008678543,0.000025381843,0.0018410215,0.000024483716,0.0000134079555,0.9460652,0.00036725853,0.0035096116],"study_design_scores_gemma":[0.0022320016,0.00019691102,0.43151918,0.0002334199,0.000009179174,0.000057003734,0.0002571782,0.34239563,0.00018352905,0.20565833,0.01627882,0.0009788212],"about_ca_topic_score_codex":0.00055786886,"about_ca_topic_score_gemma":0.006608798,"teacher_disagreement_score":0.7404069,"about_ca_system_score_codex":0.00013037356,"about_ca_system_score_gemma":0.00013197376,"threshold_uncertainty_score":0.8058763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035253745,0.000029015355,0.54659486,0.00090897223,0.0004931733,0.0001086967,0.000001040285,0.000104245,0.44823462],"genre_scores_gemma":[0.95415854,0.000005886503,0.038207456,0.00026154186,0.00015472103,0.000009052303,0.000008879393,0.0000031159598,0.0071908305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993184,0.000012943101,0.00009340298,0.00022516881,0.0001971401,0.00015293599],"domain_scores_gemma":[0.9992774,0.000008990029,0.00007958437,0.00051619863,0.000084644395,0.000033142132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000986985,0.00007284835,0.000063776366,0.000014580654,0.0005966803,0.00038441707,0.0007142088,0.00003431195,0.000086578904],"category_scores_gemma":[0.000022856753,0.00005625597,0.00003196774,0.000030454034,0.000038790655,0.0011369368,0.00025225192,0.00004279664,0.00037365404],"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.0000017760024,0.00006953562,0.0062062596,0.000004132918,0.0000084101175,0.000005192409,0.00029179244,0.0000058039473,0.0002583183,0.9839329,0.0041028582,0.005112984],"study_design_scores_gemma":[0.0017038166,0.00036530403,0.41487476,0.00005911817,0.000015555303,0.000055600416,0.000031222764,0.069155656,0.004828752,0.40570083,0.10244142,0.0007679419],"about_ca_topic_score_codex":0.000053460702,"about_ca_topic_score_gemma":0.000018167131,"teacher_disagreement_score":0.95063317,"about_ca_system_score_codex":0.00002890474,"about_ca_system_score_gemma":0.000034412842,"threshold_uncertainty_score":0.48026913},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027590222,0.00029522186,0.97345835,0.00045631593,0.0027815225,0.00054172473,0.000010288496,0.00013540161,0.022293594],"genre_scores_gemma":[0.112970226,0.000009880141,0.8812748,0.001099972,0.0017872609,0.000042260894,0.000014830221,0.000046819507,0.002753903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964764,0.0000210624,0.00045288546,0.0015667279,0.00076420046,0.00071868557],"domain_scores_gemma":[0.9965026,0.0008599506,0.0004739602,0.0014175888,0.00055638404,0.00018955542],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010058905,0.0005016562,0.00050669856,0.00043039833,0.0008479555,0.0011373966,0.0045763147,0.00028995195,0.000014763614],"category_scores_gemma":[0.0007729945,0.00043583458,0.00017266857,0.00017969818,0.0006079029,0.0006788208,0.0012551467,0.00044271865,0.00005601125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007828002,0.00004765517,0.00025039064,0.00007422631,0.000018402117,0.00008047661,0.0009036692,0.0031757737,0.0001792674,0.07367839,0.0003817754,0.9212021],"study_design_scores_gemma":[0.0004982617,0.00025647393,0.00073748577,0.00040334952,0.000011687874,0.000080105194,9.217746e-8,0.6587773,0.0004887484,0.3287809,0.009174459,0.00079114706],"about_ca_topic_score_codex":0.000014878991,"about_ca_topic_score_gemma":0.00007130442,"teacher_disagreement_score":0.920411,"about_ca_system_score_codex":0.00022448605,"about_ca_system_score_gemma":0.001012722,"threshold_uncertainty_score":0.9998995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007338689,0.0005009253,0.9822528,0.0006498337,0.0015718915,0.00049214077,0.000011996066,0.0002419456,0.006939827],"genre_scores_gemma":[0.973234,0.000048490358,0.025295224,0.00015056258,0.00067299686,0.000048579488,0.000006648805,0.000023534387,0.00051996706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979299,0.00004947128,0.0004810403,0.00073099305,0.00021864721,0.00058999984],"domain_scores_gemma":[0.996992,0.00033067854,0.0002992768,0.0017284391,0.0004633153,0.00018632354],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007756589,0.0002755726,0.00034616533,0.00010618496,0.0012202128,0.0009454243,0.0025976917,0.0000868085,0.00004968686],"category_scores_gemma":[0.0015162531,0.0002471508,0.00021776637,0.0001762449,0.00025478346,0.0006620951,0.0005898449,0.00016772278,0.00083790836],"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.000020133317,0.00016638136,0.00036831948,0.000044838194,0.0000223569,0.000017124225,0.00039912827,0.0000133218455,0.0005493778,0.7814982,0.0025290556,0.21437176],"study_design_scores_gemma":[0.000084354935,0.00026459194,0.00063685153,0.00013528814,0.000038499024,0.000020971578,0.00004170653,0.503095,0.12694342,0.34436652,0.023742892,0.00062992476],"about_ca_topic_score_codex":0.000060893555,"about_ca_topic_score_gemma":0.00027406213,"teacher_disagreement_score":0.9658953,"about_ca_system_score_codex":0.00004636616,"about_ca_system_score_gemma":0.00013677332,"threshold_uncertainty_score":0.9999981},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03939935,0.000695123,0.44810817,0.011928951,0.0045425445,0.0003987683,0.0000032120756,0.0000991842,0.4948247],"genre_scores_gemma":[0.9928015,0.00020711355,0.00506158,0.00031925028,0.0008616819,0.000004532478,2.3106027e-7,0.000011163102,0.000732974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981837,0.00003696364,0.0004966955,0.00025444207,0.0005560949,0.0004720575],"domain_scores_gemma":[0.99731183,0.0003529111,0.0008578952,0.0009405225,0.00021717859,0.00031966783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010283926,0.00020603774,0.0003705132,0.000053897955,0.0012253174,0.0009094425,0.003511679,0.00010404027,0.00000817469],"category_scores_gemma":[0.000302576,0.000112424044,0.0002463864,0.00009016497,0.00036748743,0.00031030521,0.00059104874,0.0006582974,0.00012549349],"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.00012079305,0.00026943904,0.0002209849,0.000012743753,0.00010481091,0.0004392552,0.00033628245,0.00008215707,0.0018227886,0.73842275,0.040717777,0.21745025],"study_design_scores_gemma":[0.003314964,0.0011019009,0.018879764,0.00007570805,0.00010701199,0.00081211457,0.000111574285,0.06576118,0.013339296,0.29948145,0.5960248,0.0009902266],"about_ca_topic_score_codex":0.0000026314883,"about_ca_topic_score_gemma":0.0000066820703,"teacher_disagreement_score":0.9534021,"about_ca_system_score_codex":0.000083976745,"about_ca_system_score_gemma":0.00022428326,"threshold_uncertainty_score":0.94242746},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24426174,0.0010818864,0.7402972,0.0048301914,0.0014826693,0.00021180298,9.658112e-7,0.000025486634,0.0078080604],"genre_scores_gemma":[0.9946464,0.00050882646,0.0041458425,0.00001933642,0.00043648345,0.0000018812032,5.254711e-8,0.000005399003,0.00023578868],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791557,0.00021442959,0.00042478862,0.00024096922,0.000803192,0.00040107445],"domain_scores_gemma":[0.9971947,0.0005197458,0.00034835364,0.00053168106,0.0011388605,0.00026664516],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004773726,0.00009624077,0.00019542524,0.00024863952,0.0009315313,0.0012746305,0.0016030133,0.00008587791,0.00004144494],"category_scores_gemma":[0.0030617733,0.00007508593,0.00007764743,0.00016074299,0.00038192017,0.0014739374,0.00037829153,0.00070979923,0.000110314075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001079748,0.00020742022,0.0021095027,0.000019752899,0.000026952623,0.00039034494,0.0013272484,0.000036572997,0.0126677165,0.19863941,0.0005361627,0.78393096],"study_design_scores_gemma":[0.00023399349,0.0018009361,0.01786634,0.0003303975,0.00002157155,0.0011029165,0.0020711552,0.1326633,0.29915252,0.53967744,0.0045497944,0.00052961544],"about_ca_topic_score_codex":0.00013800724,"about_ca_topic_score_gemma":0.000115194714,"teacher_disagreement_score":0.7834013,"about_ca_system_score_codex":0.000072159455,"about_ca_system_score_gemma":0.0002783254,"threshold_uncertainty_score":0.9997621},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30927792,0.00045804918,0.6226623,0.01350199,0.005256677,0.005307405,0.00010012886,0.0019771988,0.041458342],"genre_scores_gemma":[0.99049276,0.000046634446,0.00812426,0.0005976542,0.0003086595,0.00019084959,0.000017127297,0.000025554893,0.00019652225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959811,0.00028165363,0.00086007896,0.0012631847,0.00060156867,0.001012438],"domain_scores_gemma":[0.99585766,0.0002737207,0.0009120693,0.0021465367,0.0005344663,0.00027553597],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087216945,0.00049574475,0.0006503666,0.0001873217,0.0009859616,0.0014181607,0.003964738,0.0002417439,0.00007970821],"category_scores_gemma":[0.0018582426,0.00042508365,0.00021020435,0.00034071133,0.00085116003,0.0005407892,0.00092530093,0.00046920413,0.00038363738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016198847,0.0011113774,0.0047063637,0.00014380111,0.000033331948,0.00035929572,0.0038218393,0.004921155,0.0010090484,0.8212298,0.0008766261,0.16162534],"study_design_scores_gemma":[0.00023222985,0.00047331784,0.016255328,0.00073538936,0.00002893466,0.000035397323,0.0016937826,0.44057897,0.004515016,0.5302314,0.0037492067,0.001470997],"about_ca_topic_score_codex":0.0021145649,"about_ca_topic_score_gemma":0.009067516,"teacher_disagreement_score":0.6812148,"about_ca_system_score_codex":0.0002461276,"about_ca_system_score_gemma":0.00015757787,"threshold_uncertainty_score":0.9998201},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9023009,0.000031085085,0.02110091,0.0006339624,0.00050202827,0.0016129023,0.00015786164,0.00004761183,0.07361274],"genre_scores_gemma":[0.9974372,0.00000952139,0.0020112128,0.00024032108,0.000032142718,0.00005020054,0.000012864347,0.0000116737565,0.00019486903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981432,0.00007977558,0.0006550181,0.00022987703,0.00049337273,0.00039878485],"domain_scores_gemma":[0.9962591,0.00062183366,0.0008867505,0.0017930145,0.00034386409,0.00009545841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013110045,0.00028505566,0.0004555047,0.000043341104,0.0006163282,0.00034364898,0.0017065331,0.00009486136,0.000027145179],"category_scores_gemma":[0.0005696696,0.00013422659,0.00017235542,0.00011234838,0.000871819,0.00060497335,0.0007629663,0.00026614894,0.000024806486],"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.0015654162,0.0011514928,0.16263573,0.0014367702,0.0008034792,0.000007799889,0.13768394,0.000049257244,0.000034680914,0.6849796,0.0028063785,0.006845432],"study_design_scores_gemma":[0.06950064,0.007064869,0.49048337,0.0035222443,0.0007435475,0.0004897209,0.018704869,0.25890657,0.019719284,0.10511115,0.021176374,0.004577367],"about_ca_topic_score_codex":0.00005786297,"about_ca_topic_score_gemma":0.00006673043,"teacher_disagreement_score":0.5798685,"about_ca_system_score_codex":0.00003499808,"about_ca_system_score_gemma":0.00009213412,"threshold_uncertainty_score":0.5473601},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17051373,0.0017649146,0.038889863,0.0071142083,0.0026154334,0.0008112223,0.000009975189,0.00050409423,0.77777654],"genre_scores_gemma":[0.9845346,0.00012529136,0.013792898,0.00015649456,0.00022561658,0.000019635456,9.949371e-7,0.000005778017,0.0011386423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983013,0.0000803973,0.00027415593,0.0006228257,0.00028105176,0.0004402246],"domain_scores_gemma":[0.9975863,0.00010752591,0.0003367341,0.0016098566,0.00025799923,0.000101593396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044469006,0.00021340013,0.0004039144,0.000044586388,0.0005942712,0.00017350924,0.0025118866,0.00013866342,0.00004563164],"category_scores_gemma":[0.0013305345,0.00014128382,0.00011165793,0.00015032366,0.00043906327,0.00029378996,0.0014288427,0.0002040481,0.00013606189],"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.00001288399,0.00039056462,0.013708916,0.000028703758,0.000043950102,0.000059028036,0.0008165285,0.000010092965,0.0009819922,0.97149754,0.0029753188,0.009474489],"study_design_scores_gemma":[0.0016557398,0.0018943148,0.5907181,0.000055381613,0.000051237446,0.000055855562,0.00019738621,0.0010039685,0.008149086,0.3458782,0.049171396,0.001169338],"about_ca_topic_score_codex":0.000030171615,"about_ca_topic_score_gemma":0.000010426388,"teacher_disagreement_score":0.81402093,"about_ca_system_score_codex":0.00002657375,"about_ca_system_score_gemma":0.00010263551,"threshold_uncertainty_score":0.5761387},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17208348,0.0018176915,0.7877062,0.0025121463,0.0023104316,0.00032130137,0.0000036478757,0.000028325378,0.033216752],"genre_scores_gemma":[0.9889829,0.00015173109,0.009757167,0.000007901499,0.0006409513,0.0000024887222,9.27685e-8,0.0000101104115,0.00044663067],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970733,0.00024309117,0.0008632033,0.00025543154,0.0009779854,0.00058697426],"domain_scores_gemma":[0.9946392,0.000681184,0.0007277282,0.00087346794,0.0028559759,0.0002224282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075551756,0.00013388792,0.0003611258,0.0004979016,0.0007794438,0.0006548726,0.0039686067,0.00011089823,0.000054716736],"category_scores_gemma":[0.0043374486,0.00010363205,0.0002225141,0.0004157458,0.00046848357,0.0011263926,0.0008984867,0.0007576357,0.00014318225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070072056,0.00044993343,0.0012014393,0.000066284236,0.000050608094,0.000082618484,0.0050222175,0.000041166753,0.013874414,0.2413326,0.0013332211,0.7364754],"study_design_scores_gemma":[0.00017651629,0.0015490232,0.005422757,0.0006663657,0.000019506642,0.00018672177,0.0024359375,0.053691003,0.6115654,0.31497353,0.0088535575,0.00045964404],"about_ca_topic_score_codex":0.000096665455,"about_ca_topic_score_gemma":0.00012127054,"teacher_disagreement_score":0.8168994,"about_ca_system_score_codex":0.00011977398,"about_ca_system_score_gemma":0.0007604454,"threshold_uncertainty_score":0.7374725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019731399,0.000010828206,0.95737326,0.00053117826,0.0005515528,0.00013796543,0.0000010122126,0.00016356583,0.021499226],"genre_scores_gemma":[0.9619335,0.000001460603,0.034050565,0.00031763248,0.00034911517,0.000008062234,0.0000027398771,0.0000038544495,0.0033330666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932384,0.000021826172,0.00011052154,0.000229389,0.00011129204,0.00020311846],"domain_scores_gemma":[0.9993055,0.00008688573,0.000038806265,0.00029928837,0.00020673503,0.00006282141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002676439,0.00007530154,0.000086771055,0.000027207365,0.00014769539,0.00009435102,0.00033300568,0.00005210135,0.000035575893],"category_scores_gemma":[0.00013483284,0.000057245965,0.000043737113,0.0001260359,0.000048491605,0.00022375392,0.00011474007,0.00003178596,0.00020375593],"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.000007385327,0.000089085115,0.0006177827,0.000015355628,0.000016972303,0.0000014402758,0.0035055596,0.0000018755499,0.0009444856,0.9433034,0.02070385,0.030792773],"study_design_scores_gemma":[0.0014155775,0.0009356707,0.013468262,0.000017146147,0.000032865035,0.000022051765,0.0001626061,0.7460829,0.06474334,0.0593365,0.11308338,0.00069971755],"about_ca_topic_score_codex":0.000036264977,"about_ca_topic_score_gemma":0.00021192993,"teacher_disagreement_score":0.9422021,"about_ca_system_score_codex":0.000026624535,"about_ca_system_score_gemma":0.000056332774,"threshold_uncertainty_score":0.2618938},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017996796,0.004145668,0.010101715,0.0024515796,0.0008372094,0.00080427516,0.00022352271,0.0022511454,0.9790049],"genre_scores_gemma":[0.01993477,0.0030094325,0.039861534,0.0015100522,0.0022574884,0.0001342981,0.00020298373,0.0005304553,0.932559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99486554,0.0001873675,0.0010074397,0.0020463215,0.00071682513,0.0011764969],"domain_scores_gemma":[0.9945721,0.0012116277,0.0005899635,0.0028008183,0.00005497024,0.00077051856],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication","insufficient_payload"],"category_scores_codex":[0.00025141667,0.0012164846,0.0011577129,0.0008049899,0.0005510254,0.001721563,0.0035368574,0.0009700549,0.0054143276],"category_scores_gemma":[0.000095225216,0.0010691818,0.0005471356,0.00029251887,0.00074952585,0.021920597,0.004602571,0.00089520635,0.0013314809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051816733,0.00006908214,0.00007730304,0.0001354435,0.00019923908,0.00018076097,0.0015772413,0.000006405207,0.000011306993,0.91976887,0.059037685,0.018884823],"study_design_scores_gemma":[0.00025500488,0.00015008335,0.000050346,0.000583895,0.000073015624,0.00014654822,0.000046195073,0.009850558,0.0011210612,0.63594043,0.35050473,0.0012781622],"about_ca_topic_score_codex":0.000006298778,"about_ca_topic_score_gemma":0.0000019639167,"teacher_disagreement_score":0.29146704,"about_ca_system_score_codex":0.000024514606,"about_ca_system_score_gemma":0.0004525215,"threshold_uncertainty_score":0.9994461},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008846578,0.000031486765,0.39827406,0.00001330812,0.0003573666,0.0003699942,0.00003179863,0.00016442816,0.6007487],"genre_scores_gemma":[0.00035008448,0.000017341032,0.07499048,0.000052196658,0.00055759563,0.000005933937,0.000039685412,0.000031864896,0.9239548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817044,0.000037648053,0.0002526143,0.00069914706,0.00037287315,0.00046730257],"domain_scores_gemma":[0.99757725,0.0008498433,0.00035220187,0.0007166312,0.00030118565,0.00020290387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002576238,0.00037943566,0.0004596423,0.00011648696,0.00042730698,0.00026311516,0.0018308926,0.00061654235,0.000076870485],"category_scores_gemma":[0.000106371575,0.00039868685,0.0003386074,0.000026186519,0.00028104513,0.000294656,0.0006945377,0.0003861583,0.000015251786],"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.000025625495,0.000026566799,0.0000010543594,0.00014002978,0.00010802036,0.00001938984,0.0005194413,0.0000013251336,0.0000018905587,0.97167754,0.024619719,0.0028593887],"study_design_scores_gemma":[0.00036673088,0.00008586161,0.0000037364443,0.0002775505,0.000063616404,0.000009296164,0.000020627616,0.0011023461,0.000039828166,0.2311108,0.76655644,0.0003631454],"about_ca_topic_score_codex":0.000002372918,"about_ca_topic_score_gemma":0.0000032211465,"teacher_disagreement_score":0.74193674,"about_ca_system_score_codex":0.00032985545,"about_ca_system_score_gemma":0.00057266734,"threshold_uncertainty_score":0.9998465},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033869463,0.0011655091,0.6930529,0.007057488,0.0021973262,0.0015228151,0.0022575047,0.00095689984,0.29175568],"genre_scores_gemma":[0.17063451,0.00040371448,0.024034383,0.0060540107,0.0036988007,0.00046457193,0.000469283,0.00021123371,0.7940295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99415886,0.0001548602,0.001068763,0.0019866535,0.0008729701,0.0017578779],"domain_scores_gemma":[0.9927308,0.00069623796,0.0005327257,0.0022122331,0.0027391368,0.0010888574],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013764813,0.0010817075,0.0013788086,0.00081134925,0.0013941388,0.00089573313,0.0026423486,0.0010608619,0.00072908564],"category_scores_gemma":[0.0031806007,0.0009927242,0.00061632565,0.0007238133,0.00030373587,0.0004526596,0.0014622542,0.0010848156,0.011314858],"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.00003479665,0.000060821025,0.000028073493,0.000014797741,0.00012330478,0.00012134803,0.00038232215,0.000024943207,0.00012644326,0.9349323,0.06345542,0.0006954711],"study_design_scores_gemma":[0.000775319,0.0007847021,0.00013818286,0.0003594166,0.000129298,0.00006584064,0.000013386387,0.00021251773,0.00016623073,0.36317942,0.63290405,0.0012716154],"about_ca_topic_score_codex":0.00003851492,"about_ca_topic_score_gemma":0.00014873127,"teacher_disagreement_score":0.6690185,"about_ca_system_score_codex":0.0025673807,"about_ca_system_score_gemma":0.00063919957,"threshold_uncertainty_score":0.9999059},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023263706,0.00901609,0.38402706,0.0014782785,0.00075733656,0.0004463969,8.5731773e-7,0.00049670856,0.5805136],"genre_scores_gemma":[0.93424714,0.000052604686,0.065252945,0.00018610574,0.000077335026,0.000008320333,7.401818e-7,0.000005306927,0.00016950874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878514,0.00034747453,0.00019498577,0.0002510105,0.00017711126,0.00024430582],"domain_scores_gemma":[0.99749655,0.0016644151,0.00022720624,0.00030641168,0.00015492187,0.00015049557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005306801,0.00011934993,0.00016495804,0.000049892038,0.00009175191,0.00013256914,0.0004135053,0.00006908301,0.000008201406],"category_scores_gemma":[0.003490038,0.00009218481,0.000039146562,0.00018397141,0.00012159436,0.0009956666,0.00022856914,0.00016801682,0.0000325163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090719164,0.0001049625,0.0000796286,0.000021650256,0.000017756189,0.000027902195,0.002818306,0.0000030123758,0.000113531125,0.7403656,0.000041160718,0.25631577],"study_design_scores_gemma":[0.0012524432,0.0010126316,0.0010034004,0.00008368936,0.0000840477,0.0007636251,0.004378193,0.00026389962,0.0015642707,0.72281504,0.26618373,0.0005950312],"about_ca_topic_score_codex":0.000015222989,"about_ca_topic_score_gemma":0.0000011465019,"teacher_disagreement_score":0.91098344,"about_ca_system_score_codex":0.000013445042,"about_ca_system_score_gemma":0.000061499,"threshold_uncertainty_score":0.41781536},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006120333,0.0021566292,0.41854894,0.004389253,0.00064272474,0.0008643022,0.000057318233,0.0007582305,0.5719706],"genre_scores_gemma":[0.04680667,0.0012067312,0.05313299,0.00024127231,0.00019167978,0.00008371626,0.00031014622,0.000120222314,0.89790654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996162,0.0007173881,0.00070017396,0.0011939858,0.00061093137,0.0006155207],"domain_scores_gemma":[0.9912243,0.0017910467,0.00074339885,0.0028003464,0.0031379827,0.00030291537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027333393,0.0006159723,0.0006384362,0.00032562326,0.0007165371,0.00087414176,0.0031496636,0.00050270976,0.00032722167],"category_scores_gemma":[0.0011430583,0.000573998,0.00041693298,0.00022131363,0.00059707154,0.0003468698,0.0012287877,0.0004468504,0.0005279367],"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.000008980293,0.00020779304,0.00009828916,0.00022059289,0.0001357873,0.000007496088,0.0073230886,0.0000017848596,0.00011868342,0.9587313,0.017929345,0.015216858],"study_design_scores_gemma":[0.0021560143,0.000016364247,0.00084083545,0.0071807755,0.00037298308,0.00013520471,0.00014668745,0.038604856,0.02002602,0.24087797,0.6868808,0.0027614858],"about_ca_topic_score_codex":0.00009855665,"about_ca_topic_score_gemma":0.0008392704,"teacher_disagreement_score":0.7178533,"about_ca_system_score_codex":0.00012376501,"about_ca_system_score_gemma":0.00042447002,"threshold_uncertainty_score":0.99967116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037790183,0.001120984,0.9556196,0.000358085,0.004034772,0.00040238682,0.0000030978858,0.00042114736,0.0002497751],"genre_scores_gemma":[0.58455884,0.000021525908,0.41454583,0.00035417225,0.0004963139,0.0000058333735,0.0000029545795,0.000013594135,9.448826e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943747,0.00023266088,0.00066929054,0.0027742966,0.0009107633,0.0010382851],"domain_scores_gemma":[0.99578947,0.0006179734,0.00039842227,0.0024113075,0.00044915418,0.00033366578],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029937755,0.0006191452,0.0006659384,0.00074490235,0.0006305279,0.0012277375,0.00439344,0.00031206483,0.000004651742],"category_scores_gemma":[0.00066644733,0.0005569983,0.00013145727,0.0015778736,0.0011548214,0.00072403776,0.014160493,0.0011790846,0.000024339046],"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.000011968408,0.00021109845,0.018251475,0.0004933655,0.000040991206,0.0002746287,0.009256809,0.019003743,0.0009842892,0.0017614507,0.00006505183,0.9496451],"study_design_scores_gemma":[0.00026408298,0.00010092554,0.004767057,0.00062768534,0.000009793009,0.00018626523,8.8072744e-7,0.95600915,0.002960193,0.034299493,0.000047042566,0.0007274461],"about_ca_topic_score_codex":0.0001944751,"about_ca_topic_score_gemma":0.00018372043,"teacher_disagreement_score":0.9489177,"about_ca_system_score_codex":0.0002831922,"about_ca_system_score_gemma":0.0007703607,"threshold_uncertainty_score":0.9998091},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48824877,0.00028048587,0.12268744,0.0033326703,0.0012250883,0.0003525611,0.00002009719,0.00038552075,0.38346738],"genre_scores_gemma":[0.9968219,0.0000062149256,0.00080471573,0.0004672916,0.00010859667,0.000005726176,0.0000014013505,0.0000048185807,0.0017793819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990735,0.000065180415,0.00016352037,0.00026834325,0.00022058646,0.00020885817],"domain_scores_gemma":[0.99820095,0.0006579743,0.00010320075,0.00084542664,0.00013561896,0.000056835397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038655396,0.00010576077,0.00019068577,0.0001497984,0.0001533728,0.0000721904,0.000986013,0.000047464113,0.00031917397],"category_scores_gemma":[0.00040553618,0.00006300468,0.00014926793,0.0014340961,0.0001465042,0.000092030175,0.00018342593,0.000085753105,0.0003935889],"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.000014551279,0.00048840634,0.031029414,0.000009902618,0.0008865281,0.000012345602,0.007020791,0.00004545575,0.0014248904,0.8811423,0.058867097,0.019058287],"study_design_scores_gemma":[0.0011284623,0.002485887,0.48779067,0.000095211355,0.0010872451,0.000012483352,0.0002587967,0.33232352,0.035142098,0.04617088,0.092266336,0.0012384006],"about_ca_topic_score_codex":0.000047625505,"about_ca_topic_score_gemma":0.00011219795,"teacher_disagreement_score":0.8349714,"about_ca_system_score_codex":0.000019095976,"about_ca_system_score_gemma":0.00003685748,"threshold_uncertainty_score":0.50589204},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92086786,0.00070946384,0.07295006,0.002920173,0.0014706713,0.00056389946,6.520893e-7,0.00006365757,0.00045357711],"genre_scores_gemma":[0.9715556,0.00000805162,0.028093737,0.000219606,0.000096840675,0.000004419808,2.978562e-7,0.0000069596417,0.000014487121],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99753743,0.00028866713,0.00054587977,0.0004036473,0.0006758232,0.00054852536],"domain_scores_gemma":[0.9984949,0.000121316945,0.00043636002,0.00068905036,0.0001844996,0.00007382933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026334699,0.00020320214,0.0002722317,0.00012672457,0.00045252714,0.00017160487,0.0023484048,0.000045570425,0.0000012686231],"category_scores_gemma":[0.000104070605,0.000113252114,0.00008516282,0.00070093333,0.0008368909,0.00035319483,0.0023766314,0.00018897191,0.0000029262687],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113887596,0.0030378348,0.28999853,0.0011971722,0.00006889895,0.000009082934,0.21340334,0.0017037395,0.046155307,0.2116079,0.0015823811,0.2311219],"study_design_scores_gemma":[0.0025275743,0.00077209715,0.57681406,0.0033203047,0.00003200581,0.00074644276,0.0012113426,0.29868793,0.10702274,0.0011182145,0.0066093965,0.0011379049],"about_ca_topic_score_codex":0.000037978072,"about_ca_topic_score_gemma":0.000004172371,"teacher_disagreement_score":0.2969842,"about_ca_system_score_codex":0.00004470607,"about_ca_system_score_gemma":0.00006316359,"threshold_uncertainty_score":0.4618287},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94419867,0.00003843286,0.039890602,0.00022364764,0.00010864788,0.00007156108,5.0962996e-7,0.000021879381,0.01544602],"genre_scores_gemma":[0.9984978,0.0000066062703,0.0011782601,0.00010137465,0.00006164128,0.0000015595797,9.809421e-7,0.0000012227373,0.00015059896],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99957794,0.00004229206,0.000114885195,0.00011264715,0.00006806477,0.000084182015],"domain_scores_gemma":[0.9996296,0.00011033997,0.000046075038,0.0001483994,0.00005357588,0.000012018536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003360178,0.00004664244,0.000057356436,0.000032521326,0.00005337591,0.000032555636,0.00017248633,0.000024256839,0.000010722515],"category_scores_gemma":[0.000060505277,0.000025653042,0.000014910376,0.00011166087,0.000055737935,0.00017769515,0.00005228621,0.000041423405,0.000004374791],"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.000023430495,0.0007997399,0.031096887,0.00009332514,0.000029463783,0.0000041307385,0.2433504,0.00005054375,0.00906653,0.24850973,0.0017142586,0.46526155],"study_design_scores_gemma":[0.0005860662,0.00034905213,0.6597891,0.00004990025,0.0000053420176,0.00002539175,0.012567752,0.28848842,0.014816815,0.020990707,0.0021077772,0.0002236863],"about_ca_topic_score_codex":0.00020696514,"about_ca_topic_score_gemma":0.00055907416,"teacher_disagreement_score":0.6286922,"about_ca_system_score_codex":0.000011206527,"about_ca_system_score_gemma":0.000014121911,"threshold_uncertainty_score":0.10461007},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.833826,0.0006043672,0.16249047,0.00009616509,0.00070754596,0.00024748594,0.0000016041056,0.00011033619,0.0019160382],"genre_scores_gemma":[0.9979677,0.000048279548,0.0016039871,0.000031916963,0.00021407616,0.000012791302,8.5095223e-7,0.000010753804,0.000109614426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983354,0.00016091087,0.00034670517,0.0005704914,0.00016773443,0.00041873055],"domain_scores_gemma":[0.9990314,0.00031661894,0.00008996179,0.0003160185,0.000089507485,0.00015644106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801459,0.00019242428,0.00027979715,0.00011670555,0.00018131951,0.00035768075,0.00034171704,0.000107178785,0.000004642852],"category_scores_gemma":[0.00035891333,0.00016381087,0.00003250006,0.0003523293,0.00038657506,0.00028580174,0.00025275262,0.00017839938,0.000049491908],"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.00006253479,0.00009002926,0.029720878,0.000075330376,0.00002620621,0.00011554793,0.009771441,0.0001178018,0.0032418545,0.8127937,0.000074900345,0.14390983],"study_design_scores_gemma":[0.00009428745,0.0004886146,0.012541951,0.00030459365,0.000013208123,0.000104434934,0.0007408318,0.96455795,0.009301676,0.010777405,0.00049387047,0.0005811964],"about_ca_topic_score_codex":0.00053394417,"about_ca_topic_score_gemma":0.0004980672,"teacher_disagreement_score":0.9644401,"about_ca_system_score_codex":0.000037864007,"about_ca_system_score_gemma":0.000024027175,"threshold_uncertainty_score":0.66800135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26629615,0.006979971,0.6115974,0.09151979,0.006626802,0.0022664738,0.00013258986,0.00017351162,0.014407296],"genre_scores_gemma":[0.98817354,0.00028277127,0.007349751,0.00077355065,0.0007126719,0.0000066420516,0.0000014902369,0.000023077431,0.0026764788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726117,0.00031370166,0.00079907,0.00032085562,0.0006706629,0.00063455506],"domain_scores_gemma":[0.9965801,0.00043643583,0.001180381,0.0010997452,0.00055666984,0.00014664241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017687391,0.00031866797,0.00052022445,0.000056796198,0.0005198011,0.00021009837,0.0040224823,0.00013097413,0.000042238677],"category_scores_gemma":[0.00032986575,0.00014918527,0.0003683848,0.00050223386,0.0007453039,0.00037695342,0.00034210196,0.00065423123,0.00003854642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031618075,0.0016722648,0.0067643872,0.00015877912,0.0008650737,0.000030602503,0.0077094357,0.00026045882,0.04640058,0.65333,0.26838845,0.01410377],"study_design_scores_gemma":[0.008196483,0.007504382,0.015663749,0.0010768735,0.0013080463,0.0015043869,0.0022090378,0.005784666,0.16459882,0.44921216,0.3409169,0.0020244778],"about_ca_topic_score_codex":0.000028540293,"about_ca_topic_score_gemma":0.000033587763,"teacher_disagreement_score":0.72187746,"about_ca_system_score_codex":0.0001516041,"about_ca_system_score_gemma":0.00015897934,"threshold_uncertainty_score":0.74748397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007337053,0.00056206837,0.89029735,0.00035302655,0.0010814174,0.0005706605,0.000010267565,0.000672998,0.099115126],"genre_scores_gemma":[0.90509933,0.00002520735,0.088094495,0.00052092446,0.0011772441,0.000040640647,0.000016337106,0.000032804455,0.004992987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802554,0.000033732238,0.00039370928,0.0007111426,0.00022027183,0.00061562494],"domain_scores_gemma":[0.9977291,0.0002916854,0.00014664927,0.00096991943,0.0006488389,0.00021377407],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061640213,0.00029391592,0.00035501135,0.00014092894,0.00035923708,0.00028650527,0.0012082204,0.00009014269,0.00025325303],"category_scores_gemma":[0.00035260656,0.00023048495,0.0002050068,0.00038791314,0.0001526451,0.00044055935,0.00035204698,0.00012598169,0.001018604],"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.00004827428,0.00061784097,0.0006033021,0.00019028272,0.000104202074,0.000025544057,0.00081665796,0.0000010789275,0.0012300921,0.6688186,0.22679652,0.1007476],"study_design_scores_gemma":[0.0033797347,0.0015363556,0.016076643,0.00027836693,0.00012230703,0.00013783609,0.00006849092,0.44952437,0.06296175,0.09537311,0.36864534,0.0018956696],"about_ca_topic_score_codex":0.000022196551,"about_ca_topic_score_gemma":0.0001428246,"teacher_disagreement_score":0.8977623,"about_ca_system_score_codex":0.00005192624,"about_ca_system_score_gemma":0.00016125344,"threshold_uncertainty_score":0.9997592},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18850318,0.0006443866,0.4573189,0.000010531108,0.0037577946,0.0017951193,0.00030012827,0.0013566101,0.34631336],"genre_scores_gemma":[0.08391305,0.0001317353,0.0059632114,0.000017945484,0.00031754634,8.451833e-7,0.00027642705,0.000049110375,0.9093301],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972865,0.00015111513,0.00027355837,0.001293815,0.00040870332,0.00058631774],"domain_scores_gemma":[0.99714583,0.0005034147,0.00057052507,0.00057358947,0.00084843684,0.0003582269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000010108984,0.000570812,0.0005720625,0.0005251075,0.0010211669,0.00043290728,0.0015024627,0.0005828123,0.0000015990178],"category_scores_gemma":[0.00029765847,0.0006954881,0.00034172225,0.00057155057,0.00018784449,0.0023080355,0.0005493599,0.00038578504,0.000023759096],"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.015884992,0.00350652,0.013477585,0.005268964,0.004806696,0.0030589108,0.043606587,0.00030804638,0.023967931,0.19383161,0.5870021,0.10528005],"study_design_scores_gemma":[0.0053838217,0.002674967,0.0036169316,0.0011144336,0.00066684437,0.00019638453,0.123924136,0.0010995156,0.0025987506,0.005587815,0.848828,0.004308411],"about_ca_topic_score_codex":0.00011108919,"about_ca_topic_score_gemma":0.0009287464,"teacher_disagreement_score":0.5630168,"about_ca_system_score_codex":0.00050837744,"about_ca_system_score_gemma":0.0004471523,"threshold_uncertainty_score":0.9995496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85451216,0.0026015618,0.074514136,0.02677074,0.010572339,0.00013951055,5.1650005e-7,0.00005369839,0.030835345],"genre_scores_gemma":[0.92909825,0.000078650555,0.06387637,0.0011805735,0.0028129166,1.5425817e-7,2.6375734e-8,0.000005490389,0.0029475763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934345,0.00006638168,0.00018054932,0.000074088595,0.00021512085,0.00012042857],"domain_scores_gemma":[0.99858904,0.000040672854,0.00022646485,0.00088944664,0.00019797553,0.0000564034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050244114,0.000054727087,0.000101646045,0.000034370787,0.0001265078,0.000077276636,0.0034710395,0.000028746485,0.000026319285],"category_scores_gemma":[0.0007213285,0.000027343802,0.00011931751,0.00016081898,0.00004087528,0.00022153414,0.0009857694,0.00012975659,0.00007903373],"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.000034699402,0.00018562714,0.006448724,0.000015416494,0.00007627418,0.00004543101,0.0037443414,0.00002412161,0.012556184,0.05363305,0.74191666,0.18131945],"study_design_scores_gemma":[0.0011216778,0.0011063769,0.051934272,0.00027201246,0.00004188706,0.0012513666,0.000026977254,0.0049989065,0.029257579,0.16067807,0.74899596,0.00031492137],"about_ca_topic_score_codex":0.00000194138,"about_ca_topic_score_gemma":0.0000014811084,"teacher_disagreement_score":0.18100452,"about_ca_system_score_codex":0.000027137505,"about_ca_system_score_gemma":0.000057031557,"threshold_uncertainty_score":0.64501125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.276581,0.046336904,0.34222272,0.006538459,0.021276698,0.0005363056,0.00007010181,0.00009708205,0.30634072],"genre_scores_gemma":[0.9544749,0.0005808792,0.032773387,0.0011966573,0.0023497671,0.0000015737531,0.0000022548886,0.000021891705,0.008598638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99627215,0.00027349003,0.0014153309,0.00035462668,0.0006846855,0.0009997254],"domain_scores_gemma":[0.99503124,0.0002531614,0.0017714734,0.00057556934,0.0019682131,0.00040032814],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016449488,0.00042715235,0.00090084766,0.00027478635,0.00027850238,0.000188957,0.0018001419,0.0003973149,0.0031717073],"category_scores_gemma":[0.00041557095,0.00032029953,0.0005264838,0.00084620784,0.000796056,0.0022517645,0.0004803445,0.00080191134,0.00054306356],"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.0005550796,0.0021129572,0.0055483454,0.00058761274,0.0005581252,0.0010235951,0.011665782,0.0002974674,0.002333894,0.7304137,0.05003804,0.1948654],"study_design_scores_gemma":[0.007999984,0.027239075,0.045031536,0.0015883492,0.00061885815,0.01252408,0.0009441817,0.026292786,0.015292809,0.2096418,0.6505161,0.0023104625],"about_ca_topic_score_codex":0.000024953637,"about_ca_topic_score_gemma":0.00007075148,"teacher_disagreement_score":0.67789394,"about_ca_system_score_codex":0.00012101177,"about_ca_system_score_gemma":0.0005958104,"threshold_uncertainty_score":0.9999249},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5710834,0.27828705,0.038176823,0.014384015,0.0008388015,0.0027029908,0.000022689946,0.00016284133,0.094341375],"genre_scores_gemma":[0.98789716,0.00732458,0.003509941,0.0010895927,0.00007098736,0.0000117600675,0.0000016632014,0.0000035340606,0.00009077069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988766,0.00019577645,0.00037552087,0.00020664246,0.00016459514,0.00018089115],"domain_scores_gemma":[0.9990752,0.00014537443,0.00018155893,0.0003638234,0.00019791396,0.000036144225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007736663,0.000115622075,0.0004394136,0.000040203853,0.000059946356,0.000011931644,0.0006258109,0.00004833571,0.00016495911],"category_scores_gemma":[0.00011997271,0.0000616914,0.000059088976,0.00038414332,0.0004922644,0.000075554206,0.0003015518,0.00009702515,0.000019846646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009533384,0.00022015699,0.0029891822,0.0037478686,0.00002801676,0.0000068250274,0.00090236537,9.001876e-7,0.0008091387,0.9798916,0.00044971448,0.010944715],"study_design_scores_gemma":[0.0020858392,0.0019533362,0.3455562,0.01337345,0.00016415681,0.00086968456,0.00016934391,0.0063445307,0.0051319324,0.6060305,0.017111527,0.0012094409],"about_ca_topic_score_codex":0.0000077757595,"about_ca_topic_score_gemma":0.000011134164,"teacher_disagreement_score":0.41681376,"about_ca_system_score_codex":0.000013981853,"about_ca_system_score_gemma":0.00007902194,"threshold_uncertainty_score":0.2515702},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07462881,0.0012944764,0.9214539,0.0004246056,0.00038016142,0.00016596672,2.385526e-7,0.000051004874,0.0016008461],"genre_scores_gemma":[0.39324504,0.00002414659,0.6062609,0.00019460652,0.0002472969,0.0000046362206,7.1299e-7,0.000005194497,0.000017501958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713343,0.00074539793,0.0008645142,0.0004307782,0.0004000336,0.0004258363],"domain_scores_gemma":[0.99769384,0.0010664752,0.00049855234,0.00020618076,0.00028934033,0.00024558912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031856534,0.00024092148,0.00054422615,0.00026392858,0.00023949305,0.00025733322,0.0007234708,0.00023297236,0.00006184648],"category_scores_gemma":[0.0012783529,0.00015445439,0.00016466151,0.00075004797,0.00048104004,0.00041647427,0.0002965563,0.00064126996,0.0000044291683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034485645,0.00021063151,0.004319536,0.000026959591,0.00003154152,0.000047636724,0.0012512741,0.000078714205,0.00010103354,0.6769594,0.00005076862,0.31688806],"study_design_scores_gemma":[0.0009636687,0.0010705553,0.042548306,0.00005376089,0.00002226106,0.0011021441,0.00020188028,0.015472012,0.00010992657,0.93523055,0.0029156418,0.00030929263],"about_ca_topic_score_codex":0.000002840227,"about_ca_topic_score_gemma":9.859745e-7,"teacher_disagreement_score":0.3186162,"about_ca_system_score_codex":0.0000470253,"about_ca_system_score_gemma":0.00009177882,"threshold_uncertainty_score":0.6298467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010478345,0.0003272994,0.9772497,0.0008806077,0.0012322523,0.0005172084,0.0000019232002,0.000107003354,0.018636161],"genre_scores_gemma":[0.75702316,0.000010870226,0.23730385,0.0025821072,0.0017184269,0.00003205301,0.000014126376,0.000038584298,0.0012768492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960673,0.00013374831,0.00057507906,0.0013950994,0.0011832578,0.0006455594],"domain_scores_gemma":[0.9971707,0.00095534255,0.00027268563,0.0013147738,0.00019937784,0.00008712921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026931104,0.00046531134,0.00038601478,0.00065311085,0.0005070423,0.000714928,0.0038752914,0.0003574689,0.000045707315],"category_scores_gemma":[0.0004421686,0.00032930105,0.00014191297,0.00066322106,0.00064526236,0.00075990614,0.00092251215,0.0013394703,0.0001328378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000712172,0.00011402642,0.0013576592,0.000037628924,0.000014712792,0.00010863767,0.013472101,0.009689508,0.00003254774,0.64312345,0.00030823913,0.3317344],"study_design_scores_gemma":[0.0003807496,0.00015646404,0.0069216765,0.00031657156,0.000007417881,0.00012841112,6.0959275e-7,0.47579843,0.00006162639,0.5087837,0.0067282957,0.00071608153],"about_ca_topic_score_codex":0.000024807987,"about_ca_topic_score_gemma":0.00016453491,"teacher_disagreement_score":0.7559753,"about_ca_system_score_codex":0.0003385587,"about_ca_system_score_gemma":0.0006432112,"threshold_uncertainty_score":0.9999159},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4087488,0.0014340153,0.3176508,0.0008437323,0.0009141611,0.00041088313,0.000027751865,0.00046279706,0.26950705],"genre_scores_gemma":[0.9782375,0.0000483303,0.019295339,0.00033676391,0.00013268518,0.0000014795531,0.0000025459426,0.000007540412,0.001937796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898165,0.00006303569,0.00015203956,0.0003579697,0.00017164786,0.0002736582],"domain_scores_gemma":[0.99905807,0.000074331336,0.00010709978,0.00041750201,0.00024772232,0.00009527427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018244106,0.00015636586,0.00023600871,0.00009687833,0.00016553208,0.000075850454,0.00057605206,0.000119460514,0.0002551182],"category_scores_gemma":[0.00006869078,0.00012512959,0.00006069627,0.00030552072,0.00045555388,0.000443035,0.00042388614,0.00010114273,0.000027126764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012377563,0.000048258018,0.0012961702,0.000023168026,0.000035249293,0.000039093506,0.0017253532,0.0000019183565,0.00059417734,0.99284774,0.0015217637,0.0018547329],"study_design_scores_gemma":[0.0048517706,0.0037178616,0.06464217,0.00013669087,0.00014707855,0.00024371078,0.0020109273,0.03487867,0.01277475,0.7141636,0.16028246,0.0021503072],"about_ca_topic_score_codex":0.00006558934,"about_ca_topic_score_gemma":0.00016966647,"teacher_disagreement_score":0.5694887,"about_ca_system_score_codex":0.000024918405,"about_ca_system_score_gemma":0.0000578313,"threshold_uncertainty_score":0.5102637},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9296464,0.0007820331,0.05808264,0.0045940494,0.00019899123,0.0002484493,0.0000030011518,0.00033858957,0.0061058975],"genre_scores_gemma":[0.97108185,0.00016461093,0.02839669,0.000026516303,0.0000087,3.6863435e-7,0.0000016037931,0.0000048465604,0.00031480507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989164,0.000059335645,0.00017927556,0.00045220592,0.00011826446,0.0002745588],"domain_scores_gemma":[0.9989617,0.00008753971,0.00020353412,0.00059020444,0.00011728614,0.00003973452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030326965,0.00012371373,0.00028403522,0.000688809,0.00011251555,0.000011527386,0.0013865056,0.00023800826,0.0000108241165],"category_scores_gemma":[0.00021485204,0.00013831424,0.000038037477,0.001250332,0.00057079946,0.00042113574,0.0008734972,0.00027668735,0.00004911054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007016792,0.00037991125,0.23538128,0.00017208487,0.000029283698,0.00043598667,0.007638262,0.000095232936,0.0067150835,0.52644265,0.0015780263,0.22106203],"study_design_scores_gemma":[0.0064761816,0.0017103906,0.082439564,0.0031891393,0.000035234712,0.00013369348,0.005997471,0.15302014,0.023177149,0.68089396,0.041006364,0.0019207182],"about_ca_topic_score_codex":0.00036890656,"about_ca_topic_score_gemma":0.0010421422,"teacher_disagreement_score":0.21914132,"about_ca_system_score_codex":0.00009102509,"about_ca_system_score_gemma":0.00005326302,"threshold_uncertainty_score":0.5640291},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72369576,0.0018195194,0.24657257,0.0005768719,0.0007192331,0.0016089494,0.0000090774265,0.00013035677,0.02486764],"genre_scores_gemma":[0.99141955,0.000042337062,0.007839959,0.00005321992,0.0003322702,0.00009627815,0.00001033145,0.00000875512,0.00019732061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99843985,0.00022042594,0.0003992664,0.00047823106,0.00019126931,0.0002709652],"domain_scores_gemma":[0.9983965,0.0005023072,0.00021425416,0.0004290466,0.0003938397,0.00006405071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013500752,0.00015454993,0.00022926492,0.00015445189,0.00027534633,0.00013031584,0.00045734714,0.00008518737,0.000010254732],"category_scores_gemma":[0.0007763391,0.000113242415,0.00007328328,0.00059723016,0.00014056916,0.00051980367,0.00022574596,0.000109302026,0.000009775244],"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.000109519126,0.000571645,0.14209847,0.00031879262,0.000061026854,0.000007713016,0.19588572,0.000029857545,0.0034024613,0.44475263,0.00016018306,0.21260197],"study_design_scores_gemma":[0.0015601396,0.00024187462,0.65200263,0.0002732978,0.000023049928,0.00003074004,0.0010143394,0.32982326,0.0086249625,0.0020743564,0.004003993,0.00032736294],"about_ca_topic_score_codex":0.00009980395,"about_ca_topic_score_gemma":0.00057695684,"teacher_disagreement_score":0.50990415,"about_ca_system_score_codex":0.00005109013,"about_ca_system_score_gemma":0.00006966648,"threshold_uncertainty_score":0.46178916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005591363,0.000029884653,0.8525193,0.000055975805,0.00009190212,0.000028269771,3.794738e-8,0.00007591312,0.14663959],"genre_scores_gemma":[0.9848908,0.0000027649967,0.013581057,0.00026429034,0.0000369738,0.0000015727006,4.7170985e-7,0.0000019089632,0.0012201701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994701,0.00009316396,0.000100538484,0.00014361118,0.00009180458,0.00010074204],"domain_scores_gemma":[0.99953324,0.00010522652,0.000036032143,0.00023120004,0.000055680466,0.00003864776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003513666,0.000050342653,0.00008699936,0.00002678971,0.000032221007,0.000022769926,0.00034001662,0.0000386272,0.000090074194],"category_scores_gemma":[0.000117185715,0.000032818745,0.00003342548,0.00013935172,0.000039892537,0.00009478706,0.000108448556,0.00002947917,0.00008106764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013996877,0.000031319214,0.0006262532,0.0000036288452,0.0000019344002,2.7893918e-7,0.0001640077,0.00014135323,0.000104680905,0.97427166,0.00035579308,0.024297692],"study_design_scores_gemma":[0.00040800002,0.0002754735,0.007741582,0.000014891691,0.000005985356,0.000009344096,0.000029234565,0.48575863,0.007469151,0.4869502,0.01112922,0.00020826962],"about_ca_topic_score_codex":0.0000037634204,"about_ca_topic_score_gemma":0.000003228769,"teacher_disagreement_score":0.98433167,"about_ca_system_score_codex":0.000005702955,"about_ca_system_score_gemma":0.000012569265,"threshold_uncertainty_score":0.13383096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44344634,0.000022721493,0.44154993,0.00007644803,0.00059211656,0.000084789266,9.883081e-7,0.0001898329,0.114036836],"genre_scores_gemma":[0.9907948,0.000008413649,0.00028764602,0.0001177242,0.00008695032,2.3366827e-7,8.4811563e-7,0.000004354271,0.008699037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991477,0.000053683154,0.00007963198,0.00042134014,0.00003663918,0.00026097186],"domain_scores_gemma":[0.99925804,0.000053562424,0.000042699634,0.0004523308,0.000093079434,0.00010026377],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013052426,0.0001002759,0.000111204456,0.00015187345,0.00014572071,0.00004162007,0.00064708147,0.000068046524,0.0001261695],"category_scores_gemma":[0.000030469922,0.00010453613,0.000054363685,0.00091686554,0.00013387401,0.00044667372,0.00023956435,0.00011094154,0.0013478935],"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.000018469187,0.0001416681,0.052027013,0.0000059172207,0.000019149653,0.00016458449,0.0008124318,0.0003976774,0.00016278308,0.9417821,0.0031183942,0.0013497949],"study_design_scores_gemma":[0.0036544732,0.0007878025,0.11266882,0.000067516674,0.00004929043,0.00004223025,0.00068621227,0.70155257,0.0018143425,0.09811366,0.07926368,0.0012994226],"about_ca_topic_score_codex":0.00007208157,"about_ca_topic_score_gemma":0.0002906519,"teacher_disagreement_score":0.84366846,"about_ca_system_score_codex":0.00007599234,"about_ca_system_score_gemma":0.00006800631,"threshold_uncertainty_score":0.99942964},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6901786,0.00041048994,0.3072988,0.00091375824,0.00035287425,0.00025009355,6.7839625e-7,0.000004231261,0.0005905101],"genre_scores_gemma":[0.99029493,0.00037987644,0.009098165,0.000020484433,0.000109760054,0.0000011638956,2.334839e-7,0.000004232096,0.00009117628],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798113,0.00021931849,0.00063116156,0.00018101204,0.0007609433,0.0002264352],"domain_scores_gemma":[0.9971669,0.00041031957,0.00032778233,0.0002351733,0.0017381218,0.00012172822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030595488,0.000077342964,0.00025557016,0.00041708615,0.00008413898,0.000076310855,0.0004788475,0.00007276034,0.000083770894],"category_scores_gemma":[0.00095158734,0.000059036356,0.000066175766,0.00072626903,0.00008180454,0.00041033755,0.00016077398,0.0002627237,0.000041449788],"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.0006665458,0.0009372233,0.013297455,0.00035347074,0.000094843126,0.000029699891,0.010884862,0.004939908,0.22406143,0.15441105,0.0011099442,0.58921355],"study_design_scores_gemma":[0.0004155023,0.00781613,0.0099618025,0.0013672065,0.000029887407,0.00010988037,0.003219246,0.1974059,0.6516856,0.12159899,0.005900092,0.00048975303],"about_ca_topic_score_codex":0.000085990716,"about_ca_topic_score_gemma":0.000031024763,"teacher_disagreement_score":0.5887238,"about_ca_system_score_codex":0.000064368534,"about_ca_system_score_gemma":0.0001171232,"threshold_uncertainty_score":0.24074328},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23663911,0.00025773814,0.0032665615,0.0048766453,0.0030141266,0.0014208192,0.000008105744,0.0004260922,0.7500908],"genre_scores_gemma":[0.9887558,0.00009212964,0.005804811,0.00060394773,0.00020072644,0.00006412587,0.0000030161964,0.000037066606,0.0044383593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967781,0.0001603046,0.0007210731,0.00089928287,0.0007316907,0.00070959073],"domain_scores_gemma":[0.99789554,0.0002546419,0.00048106638,0.0006170526,0.0006604543,0.00009125603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010719094,0.0004763319,0.0005035434,0.00028329116,0.00021931584,0.0001871374,0.00295353,0.00030779414,0.00028982587],"category_scores_gemma":[0.0003999943,0.0003159902,0.00011773713,0.0014653375,0.00064749,0.0005800914,0.0010664904,0.0008029687,0.000037796275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052574323,0.00038547898,0.029613484,0.00004980676,0.000018720386,0.00001940359,0.0030397153,0.00015978164,0.00068102067,0.9637279,0.0001526086,0.0020994996],"study_design_scores_gemma":[0.00518127,0.0010738107,0.18822886,0.0012609563,0.00004475445,0.00014650852,0.0011876996,0.029886883,0.0061374935,0.75410455,0.010122819,0.0026243974],"about_ca_topic_score_codex":0.0000642888,"about_ca_topic_score_gemma":0.00004690637,"teacher_disagreement_score":0.7521167,"about_ca_system_score_codex":0.00024976433,"about_ca_system_score_gemma":0.00030480977,"threshold_uncertainty_score":0.9999292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10925887,0.00095776416,0.7522833,0.001370784,0.0014945357,0.00010195278,6.629375e-7,0.000030754672,0.13450143],"genre_scores_gemma":[0.9858781,0.000115402065,0.013317208,0.0003377656,0.00025251904,2.9033612e-7,4.5763315e-8,0.0000029359278,0.00009575169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903417,0.00006283007,0.0003128005,0.0001480241,0.00026339636,0.00017880739],"domain_scores_gemma":[0.99879724,0.0001516933,0.00040064074,0.00022626894,0.0003226267,0.00010153211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345782,0.00010209101,0.00023030104,0.000097311204,0.000087047614,0.000052972882,0.0006566451,0.00006105865,0.000020291322],"category_scores_gemma":[0.00028083212,0.00006562486,0.00007203599,0.00018318793,0.00013142053,0.00021440555,0.00016616647,0.00016547077,0.000023062405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054109838,0.00017099227,0.0020275575,0.00001556494,0.0000243786,0.0001235887,0.0024342418,0.000023763267,0.002594379,0.96264964,0.0012257772,0.028656013],"study_design_scores_gemma":[0.0022911066,0.009849578,0.11677969,0.00047791222,0.000056084013,0.0019626552,0.00022927376,0.005208816,0.028538479,0.8248718,0.009131557,0.00060306926],"about_ca_topic_score_codex":0.0000044521016,"about_ca_topic_score_gemma":0.0000073253354,"teacher_disagreement_score":0.8766192,"about_ca_system_score_codex":0.00002469661,"about_ca_system_score_gemma":0.00007052596,"threshold_uncertainty_score":0.2676104},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064693796,0.56398654,0.015631929,0.00790266,0.0011183958,0.0015399297,0.0000018953372,0.0002728735,0.4030764],"genre_scores_gemma":[0.8682072,0.12098592,0.0018379265,0.0062291604,0.00014952476,0.00003503981,0.0000021719416,0.000013622554,0.0025394247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987046,0.00017734547,0.00032617274,0.0002723724,0.0002499743,0.00026950307],"domain_scores_gemma":[0.9983503,0.00016465649,0.00020553646,0.0011391218,0.00008236542,0.000057971803],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090893876,0.00015338497,0.00045580603,0.00003112818,0.000058659265,0.000028305585,0.0016892311,0.0000439351,0.0002499292],"category_scores_gemma":[0.000093624745,0.00007919376,0.00019125857,0.0004116829,0.00007070492,0.00013330647,0.00031917804,0.00013329253,0.0017936241],"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.0000011512875,0.00006300748,0.0004030899,0.0022826733,0.000025449392,0.000002540204,0.00032571665,0.000002202442,0.000093923154,0.9558403,0.004033731,0.03692622],"study_design_scores_gemma":[0.0014723256,0.00087807165,0.018399708,0.015602483,0.0002289618,0.00047162457,0.0001177705,0.0035256832,0.0014439852,0.42098448,0.5352708,0.0016040833],"about_ca_topic_score_codex":0.000010827884,"about_ca_topic_score_gemma":7.563671e-7,"teacher_disagreement_score":0.86173785,"about_ca_system_score_codex":0.000021344797,"about_ca_system_score_gemma":0.000069873335,"threshold_uncertainty_score":0.9989836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074391966,0.000072437404,0.79750425,0.023938702,0.0035125585,0.00034931017,0.00001187283,0.00045315042,0.16671853],"genre_scores_gemma":[0.98827785,0.00007629304,0.0076656532,0.0016922428,0.0011917969,0.00006178173,0.0000070154606,0.00001143551,0.0010159477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997871,0.000061430655,0.00048613845,0.0006157952,0.00057441846,0.0003912286],"domain_scores_gemma":[0.99867314,0.00008622643,0.00016663231,0.00047834366,0.00042555633,0.00017012286],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003316235,0.00024430893,0.00020203672,0.00024207999,0.00013572288,0.00045269917,0.0015866949,0.00009960107,0.0010175781],"category_scores_gemma":[0.00019150713,0.00022173143,0.00013405835,0.00024095816,0.00011658073,0.0007941241,0.00030906528,0.00028361139,0.005882373],"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.000009627407,0.00013077767,0.00002880206,0.0000013307202,0.000010232376,0.00001099546,0.0006935626,0.000041539533,0.0007935556,0.6383772,0.00023968499,0.3596627],"study_design_scores_gemma":[0.00010931321,0.00036797347,0.0015987187,0.00015490153,0.000008520612,0.0000632806,0.00024480428,0.59504575,0.10169911,0.2515027,0.04831318,0.00089178164],"about_ca_topic_score_codex":0.00006245802,"about_ca_topic_score_gemma":0.00016108625,"teacher_disagreement_score":0.98083866,"about_ca_system_score_codex":0.00014714191,"about_ca_system_score_gemma":0.00010047374,"threshold_uncertainty_score":0.99989563},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9462647,0.002165111,0.030258069,0.0030929921,0.00058863824,0.00043283726,0.000014155213,0.00006306296,0.017120445],"genre_scores_gemma":[0.9986723,0.000055772845,0.0004582415,0.00008721171,0.00010415321,0.0000020847647,0.00001451955,0.0000051861844,0.0006005091],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9987742,0.00025187255,0.00021004191,0.00028225782,0.00026664673,0.00021498837],"domain_scores_gemma":[0.9989284,0.0003554109,0.00015509254,0.00034041624,0.00018080261,0.000039827424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000477198,0.00014190351,0.00016900375,0.00011562399,0.0003955042,0.00009778726,0.0009333777,0.000045381334,0.000005479583],"category_scores_gemma":[0.000086804386,0.00009481925,0.00008262451,0.00044205537,0.00034917434,0.00035759533,0.0004207163,0.00016253842,0.000011719105],"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.00013102827,0.0001365439,0.13456742,0.00009024425,0.00043257466,0.0000548875,0.37594643,0.0000046998816,0.00080887193,0.13292797,0.002167723,0.35273162],"study_design_scores_gemma":[0.0013713196,0.0004532179,0.9338683,0.00017751913,0.00008625524,0.000027986533,0.017696347,0.03730615,0.00023394224,0.00407379,0.0043111956,0.00039398376],"about_ca_topic_score_codex":0.00009696974,"about_ca_topic_score_gemma":0.00060730055,"teacher_disagreement_score":0.79930085,"about_ca_system_score_codex":0.00006781669,"about_ca_system_score_gemma":0.00003921336,"threshold_uncertainty_score":0.38666168},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.701086,0.0017254485,0.18252799,0.0037317283,0.00086576113,0.0004248355,5.51539e-7,0.000048395286,0.10958928],"genre_scores_gemma":[0.95080954,0.00015193466,0.046828896,0.000047075322,0.00017787893,0.0000012668626,5.3884687e-8,0.000009545713,0.0019737908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982094,0.00016851953,0.0003225325,0.00014181975,0.0008262345,0.00033150156],"domain_scores_gemma":[0.9979404,0.0009871228,0.00012881284,0.00031182665,0.00043894863,0.0001928487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034709894,0.000082992716,0.0002481264,0.00024654207,0.000090780544,0.0002646788,0.00081232033,0.00006803195,0.00009863289],"category_scores_gemma":[0.00082108274,0.000055104927,0.00007189236,0.0002997414,0.00009472955,0.00028502647,0.00038251982,0.0005590017,0.0003278388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001309683,0.00046054195,0.0016471673,0.00024055678,0.000051983872,0.00013728956,0.0037658408,0.0000049509026,0.0021507386,0.97786677,0.005836915,0.0078241555],"study_design_scores_gemma":[0.0013641634,0.0019333792,0.0029768504,0.00029876313,0.000015270238,0.0012131557,0.00086986675,0.035827138,0.0025955627,0.94407797,0.008520529,0.000307372],"about_ca_topic_score_codex":0.0000016392646,"about_ca_topic_score_gemma":0.0000010364778,"teacher_disagreement_score":0.24972355,"about_ca_system_score_codex":0.000050185954,"about_ca_system_score_gemma":0.00015524395,"threshold_uncertainty_score":0.42138135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9402193,0.0013676796,0.0010245147,0.022853278,0.0015117305,0.00044087684,5.6927615e-7,0.00011765104,0.03246439],"genre_scores_gemma":[0.99906707,0.00010476446,0.00051489123,0.000049415758,0.00014831033,0.0000112028565,3.7025947e-7,0.0000025818983,0.000101376296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992757,0.000037673173,0.00017319902,0.00024576366,0.00014759408,0.00012006395],"domain_scores_gemma":[0.9995817,0.000058793135,0.000062778076,0.00021673935,0.000061106264,0.000018873126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021017132,0.0000743771,0.00018437926,0.00006238216,0.000029882738,0.000008428123,0.00019316551,0.00003347783,0.0000035292085],"category_scores_gemma":[0.00020865795,0.000055067052,0.00003251519,0.000253176,0.000054994376,0.0001787981,0.00016493819,0.00008249212,0.000059026617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015700558,0.00023304808,0.111739695,0.00013131983,0.00004916263,0.00000439816,0.0042619337,0.00007788997,0.0019581544,0.8707605,0.00017305906,0.010595154],"study_design_scores_gemma":[0.00030115215,0.00015827591,0.09498484,0.00006755985,0.000004958185,0.00000419195,0.00003499351,0.00089071994,0.0024196587,0.90066725,0.0003221629,0.0001442677],"about_ca_topic_score_codex":0.000005218086,"about_ca_topic_score_gemma":0.000010233039,"teacher_disagreement_score":0.058847778,"about_ca_system_score_codex":0.00003692592,"about_ca_system_score_gemma":0.0000072313005,"threshold_uncertainty_score":0.22455691},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013393399,0.56367654,0.06132075,0.0065013063,0.002432382,0.002985413,0.000011731363,0.0005297772,0.34914872],"genre_scores_gemma":[0.9247501,0.066554524,0.0021727926,0.003667964,0.00013833556,0.000044853077,0.000007720226,0.000017195522,0.0026465338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980617,0.0002922801,0.00047054823,0.00041939583,0.00037801845,0.0003780277],"domain_scores_gemma":[0.99779004,0.00038296837,0.00036345635,0.0012297593,0.00015584326,0.000077959274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014367491,0.00023320744,0.0006790199,0.000088815206,0.00013018363,0.000102347,0.0016789421,0.00007402162,0.00068255555],"category_scores_gemma":[0.00036513654,0.00012735196,0.0002422741,0.0009971041,0.00013326334,0.00022075749,0.00040250443,0.00019198412,0.0016145022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024661642,0.000079919846,0.00025258094,0.002342472,0.000034814926,0.0000034410227,0.00015787198,0.0000068805484,0.00026691065,0.98858696,0.002829048,0.005436608],"study_design_scores_gemma":[0.0021423916,0.0014216466,0.0129045965,0.016505409,0.0005154486,0.00030241892,0.0001786945,0.00978043,0.002624213,0.73217374,0.21924892,0.0022020661],"about_ca_topic_score_codex":0.00003981483,"about_ca_topic_score_gemma":0.000002134177,"teacher_disagreement_score":0.9113567,"about_ca_system_score_codex":0.00004139241,"about_ca_system_score_gemma":0.00009747753,"threshold_uncertainty_score":0.99916285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008767502,0.0011718367,0.97935957,0.00009332842,0.0008956593,0.00059335824,0.0000024630565,0.000050094863,0.009066172],"genre_scores_gemma":[0.95063627,0.000029700579,0.048882954,0.00013643719,0.00014081749,0.000006102916,0.0000021225273,0.00001534633,0.00015026558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969835,0.00006679827,0.00056051096,0.0009086239,0.00092571194,0.00055485254],"domain_scores_gemma":[0.9973822,0.0005081767,0.0004465388,0.0014397951,0.00016491346,0.000058352867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014126982,0.00036279042,0.00056618516,0.0004944702,0.00007178363,0.00016749153,0.0049382686,0.00021974242,0.0000068314007],"category_scores_gemma":[0.00010899061,0.00025700906,0.00014460347,0.00077325886,0.00068152125,0.00038451253,0.0013121605,0.0006962772,0.000010707078],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010281404,0.00014183293,0.0034857853,0.00042075638,0.000015772943,0.00008186429,0.026322162,0.0068292827,0.0007361596,0.12432152,0.0000054476764,0.83762914],"study_design_scores_gemma":[0.0035333198,0.003886373,0.013897765,0.01151981,0.00007969376,0.00039695937,0.00008032386,0.7991286,0.019014174,0.14207776,0.0019498402,0.004435363],"about_ca_topic_score_codex":0.00008982747,"about_ca_topic_score_gemma":0.00017776154,"teacher_disagreement_score":0.9418687,"about_ca_system_score_codex":0.00010937848,"about_ca_system_score_gemma":0.00046891544,"threshold_uncertainty_score":0.9999882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004346802,0.0016704833,0.95133173,0.00053148123,0.0034207474,0.0003106468,0.0000019813594,0.00008106678,0.0426084],"genre_scores_gemma":[0.6854851,0.000682478,0.28913847,0.0024215383,0.0019068895,0.000016479795,0.000006300628,0.00011754191,0.02022517],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681795,0.00004250739,0.00050072826,0.0011039247,0.0009113776,0.0006235095],"domain_scores_gemma":[0.9959906,0.0010942162,0.00041285646,0.0020481849,0.00034021103,0.00011395903],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012370505,0.0004146294,0.00049709645,0.00032661672,0.0002960057,0.00040713322,0.005733589,0.00028893029,0.00001361852],"category_scores_gemma":[0.00018467307,0.0002685564,0.00018861347,0.0005046859,0.0009999645,0.0003357354,0.0018070702,0.000732129,0.00009090323],"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.000006812961,0.000022901862,0.00017903734,0.00004779078,0.000016139249,0.000027678307,0.001263209,0.0015629934,0.00014519952,0.29230526,0.00018691528,0.70423603],"study_design_scores_gemma":[0.0004731246,0.00048201857,0.0004439077,0.0006071989,0.00001592343,0.00011411521,5.218099e-7,0.43576357,0.004037652,0.5202555,0.036682997,0.0011234885],"about_ca_topic_score_codex":0.00001357458,"about_ca_topic_score_gemma":0.000083410596,"teacher_disagreement_score":0.70311254,"about_ca_system_score_codex":0.00015241095,"about_ca_system_score_gemma":0.00085765944,"threshold_uncertainty_score":0.99997663},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1727046,0.00028056584,0.8215486,0.0011110739,0.000368522,0.0004677044,5.666407e-7,0.000018000123,0.0035003738],"genre_scores_gemma":[0.9247321,0.00007978065,0.07392897,0.000030240328,0.00022151403,0.00001130007,4.136505e-7,0.000010336569,0.0009853262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986767,0.00011023416,0.00028286898,0.00013820146,0.0005418642,0.00025013808],"domain_scores_gemma":[0.99818325,0.0006184593,0.00014562378,0.00018830763,0.00075339025,0.00011096268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028623918,0.000069980975,0.00018325022,0.00020431652,0.00011304785,0.00018068858,0.00035946557,0.00007292832,0.00002918963],"category_scores_gemma":[0.0005457096,0.00004709165,0.00005759542,0.00024398003,0.000064155385,0.00029915545,0.0001377575,0.00030491911,0.000070883725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021450924,0.0011693181,0.0014996963,0.0013139455,0.00015962706,0.000023178423,0.0036705644,0.000031848293,0.014651329,0.9510485,0.008853712,0.017363781],"study_design_scores_gemma":[0.0018516018,0.0034011798,0.0017794443,0.00024321105,0.000033505563,0.0003532757,0.0002959952,0.18580998,0.0023562196,0.80059457,0.0030873585,0.00019363908],"about_ca_topic_score_codex":8.505159e-7,"about_ca_topic_score_gemma":6.6112875e-7,"teacher_disagreement_score":0.7520275,"about_ca_system_score_codex":0.00006411254,"about_ca_system_score_gemma":0.00017557769,"threshold_uncertainty_score":0.19203417},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021654852,0.0012502763,0.9811714,0.000352648,0.003950603,0.00060182286,0.000009035269,0.00031509093,0.012132576],"genre_scores_gemma":[0.464257,0.00018406971,0.5255155,0.0022565706,0.0010605047,0.000029457613,0.000031004372,0.00012742268,0.0065385057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949139,0.000050436553,0.000576073,0.002158277,0.001202081,0.0010992786],"domain_scores_gemma":[0.9968208,0.00052270916,0.00037134715,0.0017697902,0.0002754811,0.00023988559],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009973312,0.0007886579,0.0007605716,0.0008061943,0.00028862178,0.0011601794,0.004634196,0.0005294922,0.00006247604],"category_scores_gemma":[0.00013794802,0.00065829296,0.00026919678,0.0007927547,0.000692363,0.0009420543,0.0017179934,0.0010997684,0.00021288937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005935572,0.00004235372,0.00016466893,0.00008562445,0.00002114337,0.00011378358,0.0022121735,0.00617827,0.000035278343,0.021796867,0.000043741366,0.96930015],"study_design_scores_gemma":[0.00058169453,0.00046819533,0.00082665595,0.00063464267,0.00002230495,0.00011151618,6.457702e-7,0.87905365,0.00028600008,0.08444336,0.031897947,0.0016733976],"about_ca_topic_score_codex":0.000032758282,"about_ca_topic_score_gemma":0.00019825595,"teacher_disagreement_score":0.96762675,"about_ca_system_score_codex":0.00037476886,"about_ca_system_score_gemma":0.0011351206,"threshold_uncertainty_score":0.99987674},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16273478,0.00007883637,0.8038979,0.00007201635,0.0016946688,0.00021269747,0.0000043057903,0.00042040463,0.03088435],"genre_scores_gemma":[0.993764,0.00008560382,0.00062010356,0.00004289596,0.0001879306,0.0000010784491,0.000023460196,0.000011995657,0.005262971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983522,0.0001943811,0.00014924616,0.0008780791,0.00011833616,0.0003077201],"domain_scores_gemma":[0.9981552,0.00007210905,0.00024043497,0.00097608566,0.000375459,0.00018070648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004095871,0.0002750437,0.00026976588,0.00019105076,0.00021892105,0.0002505705,0.0012721415,0.0003310918,0.000024502006],"category_scores_gemma":[0.00009824267,0.0002879129,0.00016325727,0.00045088783,0.00012233188,0.0006026333,0.0013678494,0.0004321009,0.00028080092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023138182,0.000074345895,0.00048177413,0.000036011224,0.00005517756,0.000078822224,0.0014699291,0.009939813,0.000023556311,0.98542964,0.00082757266,0.0015602319],"study_design_scores_gemma":[0.00047821336,0.00006529232,0.0007968902,0.000038797487,0.000064236265,0.000007265934,0.0002337138,0.33634973,0.0002658617,0.65895,0.0022667826,0.00048323453],"about_ca_topic_score_codex":0.00019224123,"about_ca_topic_score_gemma":0.00021023543,"teacher_disagreement_score":0.8310292,"about_ca_system_score_codex":0.0004582413,"about_ca_system_score_gemma":0.00044204874,"threshold_uncertainty_score":0.9999573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03740449,0.00054236315,0.8791309,0.0001527593,0.003357943,0.0005809916,0.0000051907546,0.0010876139,0.07773772],"genre_scores_gemma":[0.97305006,0.00010117372,0.015593941,0.00017020787,0.00019704532,0.000002274325,0.000013730295,0.00002207459,0.010849475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974447,0.0001435151,0.0002085725,0.0015000477,0.00012216928,0.0005810337],"domain_scores_gemma":[0.99762934,0.00008288657,0.0002699273,0.0013630092,0.00039326996,0.00026155822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026034671,0.00042770692,0.0004074493,0.00022643898,0.0002564562,0.00015402651,0.0024102835,0.00043999846,0.0001927567],"category_scores_gemma":[0.000043084245,0.0004220382,0.00028244912,0.0006378776,0.0001942123,0.00034335643,0.003436094,0.00070700655,0.0005279969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017213055,0.0002298576,0.0015082206,0.0000545361,0.000080632424,0.00068771583,0.0002782358,0.002080297,0.000010394561,0.99116695,0.0008029367,0.0030829986],"study_design_scores_gemma":[0.0013852234,0.0003026802,0.0110722715,0.00027168836,0.00021431492,0.000049948478,0.000077937184,0.10543108,0.00013787272,0.8426587,0.036052894,0.0023453867],"about_ca_topic_score_codex":0.00013855302,"about_ca_topic_score_gemma":0.00003170319,"teacher_disagreement_score":0.9356456,"about_ca_system_score_codex":0.00015068478,"about_ca_system_score_gemma":0.0002900825,"threshold_uncertainty_score":0.99982315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37222615,0.00026999132,0.5449552,0.0004130717,0.0011632284,0.00057501096,0.0000122882,0.00039411738,0.079990976],"genre_scores_gemma":[0.99005795,0.00014114336,0.007007942,0.000054049324,0.00017345458,3.5398898e-7,0.000013147991,0.000011137894,0.0025408003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978157,0.00013403136,0.0002911915,0.0012363845,0.000104072744,0.00041858977],"domain_scores_gemma":[0.99821526,0.00016228852,0.00025630748,0.0009937031,0.00014509301,0.00022736395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047923852,0.00029783323,0.00034459407,0.0003708919,0.00019376041,0.00019651382,0.0014385777,0.00040391888,0.000016691656],"category_scores_gemma":[0.00015664649,0.0003281427,0.00009867061,0.0007372551,0.0001497953,0.0005189109,0.0025822918,0.0005908919,0.000063319276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015067062,0.0001431413,0.036815148,0.000100323276,0.000053321495,0.00030032676,0.004184996,0.013150333,0.000019532607,0.93570405,0.0044832816,0.004894868],"study_design_scores_gemma":[0.0012902503,0.0000924277,0.046317477,0.00026590194,0.000022943685,0.0000072245202,0.00003809508,0.36782083,0.00005669775,0.5821339,0.0013842756,0.00056997413],"about_ca_topic_score_codex":0.00046813863,"about_ca_topic_score_gemma":0.0011563973,"teacher_disagreement_score":0.6178318,"about_ca_system_score_codex":0.00020823,"about_ca_system_score_gemma":0.0003050275,"threshold_uncertainty_score":0.9999171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16591793,0.00034404287,0.82602906,0.0003097606,0.0007625249,0.0000966873,0.0000010071278,0.000047061938,0.0064919423],"genre_scores_gemma":[0.98899513,0.0001349747,0.010493751,0.000054251883,0.0002067695,8.0155496e-7,5.496353e-7,0.0000060898997,0.000107699096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876875,0.000051992483,0.00040455305,0.0001735776,0.00029498973,0.00030615364],"domain_scores_gemma":[0.9987039,0.000054364384,0.00033471698,0.0003014518,0.00045052503,0.00015503945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073904346,0.00015039487,0.00031865502,0.000113386384,0.00006879318,0.0001961478,0.00096445583,0.00006660897,0.000018589244],"category_scores_gemma":[0.00004052562,0.000119405944,0.000083958505,0.00037263255,0.00010337295,0.0019160324,0.000090157555,0.00029833106,0.000017027902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006856821,0.0003086283,0.003686227,0.000022438742,0.000011131379,0.0002492816,0.0050767665,0.00005780519,0.006964886,0.7482047,0.00009935607,0.23525023],"study_design_scores_gemma":[0.0013578106,0.001449234,0.063243136,0.00047793143,0.000026818207,0.00031364398,0.0017286425,0.0017785965,0.194566,0.7330275,0.0013195223,0.00071113685],"about_ca_topic_score_codex":0.000011378895,"about_ca_topic_score_gemma":0.00004682865,"teacher_disagreement_score":0.8230772,"about_ca_system_score_codex":0.000039705596,"about_ca_system_score_gemma":0.00023453412,"threshold_uncertainty_score":0.4869233},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056123402,0.000038449838,0.9387354,0.00018961118,0.00036872464,0.00027523882,5.663707e-7,0.00010785582,0.004160718],"genre_scores_gemma":[0.9979547,0.000025518964,0.001483527,0.00010561861,0.00006144159,0.0000022586946,0.000025195,0.0000063383195,0.00033537069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986114,0.0002940001,0.0001615508,0.00062179915,0.00010114607,0.00021008796],"domain_scores_gemma":[0.9985612,0.00014230167,0.00020731418,0.00088212185,0.00015757357,0.000049479895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061443355,0.00018697989,0.00017457784,0.00019083581,0.00013093613,0.00015281705,0.0014193924,0.00020754323,0.000005873852],"category_scores_gemma":[0.00011568825,0.000166119,0.00008170806,0.00064433273,0.000052666506,0.00033250023,0.00050125486,0.00036002276,0.00016148949],"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.000004253734,0.00005763709,0.00060608744,0.000034844415,0.00000854607,0.000019193265,0.0012352119,0.672573,0.0000061032397,0.32252827,0.00014379673,0.0027831048],"study_design_scores_gemma":[0.00021764271,0.000025275347,0.011008774,0.00004819488,0.000020685882,0.000002732078,0.000047576377,0.9379689,0.000029227953,0.050334863,0.00010710727,0.0001890276],"about_ca_topic_score_codex":0.00023000677,"about_ca_topic_score_gemma":0.00023281363,"teacher_disagreement_score":0.94183135,"about_ca_system_score_codex":0.00020689757,"about_ca_system_score_gemma":0.00014458617,"threshold_uncertainty_score":0.67741364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9206224,0.0009999967,0.044051424,0.0006786981,0.0017385382,0.00049334613,0.000004992466,0.00014149585,0.031269103],"genre_scores_gemma":[0.99645317,0.00008905271,0.0022259706,0.00019835321,0.00018784906,0.000035188445,0.0000074014065,0.0000138576725,0.0007891593],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9975353,0.0003874731,0.00047948607,0.0007377454,0.00043122147,0.0004287718],"domain_scores_gemma":[0.99745303,0.00060378114,0.00026778784,0.0014593351,0.00015641135,0.000059639668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010349413,0.00030301948,0.00044612214,0.00013647017,0.00007783694,0.00011665154,0.0030411605,0.0002556682,0.000011129214],"category_scores_gemma":[0.00038614724,0.0002128963,0.00020593115,0.00037715535,0.00022383597,0.00017403738,0.0012950393,0.00070626667,0.00007217181],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014206427,0.00040830558,0.96803266,0.00023528792,0.00004227008,0.00012098043,0.006421315,0.00083895365,0.00023091413,0.010756235,0.009349122,0.0035497241],"study_design_scores_gemma":[0.00035382825,0.00013965109,0.96030325,0.0005063853,0.00003792549,0.000026328245,0.00015215961,0.018584413,0.0017100846,0.015915064,0.001648192,0.0006227177],"about_ca_topic_score_codex":0.0008401347,"about_ca_topic_score_gemma":0.0002339572,"teacher_disagreement_score":0.075830765,"about_ca_system_score_codex":0.000048390044,"about_ca_system_score_gemma":0.00025734786,"threshold_uncertainty_score":0.8681659},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97062194,0.0055515114,0.0030297423,0.010203016,0.0015740618,0.0010493606,0.0000016678756,0.00009754862,0.007871161],"genre_scores_gemma":[0.994916,0.00063094345,0.00011723788,0.00019871,0.0001349774,0.00007081398,2.1245341e-7,0.000011692777,0.0039193914],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99848664,0.00030295007,0.0002790243,0.00040178414,0.00025376416,0.00027583895],"domain_scores_gemma":[0.99784243,0.00020596369,0.0003004713,0.0014731621,0.00014315233,0.000034819364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000719757,0.00022914824,0.0002905523,0.000017860046,0.0004753714,0.00016975218,0.0025044703,0.00015489272,0.0000047056337],"category_scores_gemma":[0.00027342967,0.000082966944,0.00013874484,0.00015514522,0.0011856881,0.00007612687,0.0037923367,0.0005505458,0.000025599253],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011197953,0.00029293797,0.7546141,0.00071911915,0.00047977222,0.0000143062925,0.039138097,0.0003728352,0.00029342683,0.1861913,0.005311067,0.012461041],"study_design_scores_gemma":[0.0033726557,0.00028120005,0.63086087,0.0011468863,0.00041756718,0.0001845396,0.0006538255,0.19332196,0.010364749,0.11161462,0.04595631,0.0018248274],"about_ca_topic_score_codex":0.000061675855,"about_ca_topic_score_gemma":0.00007192647,"teacher_disagreement_score":0.19294912,"about_ca_system_score_codex":0.00001792541,"about_ca_system_score_gemma":0.000088362176,"threshold_uncertainty_score":0.47268763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49459,0.0010812827,0.45058206,0.0006269918,0.0072846604,0.0018794294,0.00005120784,0.0019709447,0.041933417],"genre_scores_gemma":[0.99528253,0.00055075315,0.00042580455,0.00004487431,0.0001695164,0.0000054194857,0.00004735619,0.000017800754,0.0034559607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969816,0.00046668464,0.00029926046,0.0014865285,0.00014532224,0.00062056596],"domain_scores_gemma":[0.99530774,0.00029811452,0.0004536205,0.0035237002,0.00022029596,0.00019652257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013101967,0.000403164,0.00041641024,0.00017272774,0.0008230533,0.00048269253,0.0033365872,0.00028350297,0.00000994256],"category_scores_gemma":[0.0002958589,0.00035585876,0.00030775316,0.00040853536,0.00036455135,0.0006538019,0.004036948,0.00090958964,0.0001228803],"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.000043998465,0.0002693262,0.06420324,0.000120419994,0.00015268121,0.0007240531,0.00057509926,0.0028844161,0.0000048960123,0.92606884,0.0010734315,0.0038796193],"study_design_scores_gemma":[0.002369937,0.00026020245,0.045620322,0.0006663215,0.00024018674,0.0000467291,0.0008542019,0.6500791,0.000120758355,0.20725231,0.09004769,0.0024422875],"about_ca_topic_score_codex":0.003928467,"about_ca_topic_score_gemma":0.008536995,"teacher_disagreement_score":0.7188165,"about_ca_system_score_codex":0.0003773987,"about_ca_system_score_gemma":0.00039158514,"threshold_uncertainty_score":0.9998893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84873474,0.000118518954,0.14027321,0.00015405935,0.00059344905,0.0008883857,0.000020274316,0.00020837547,0.0090089645],"genre_scores_gemma":[0.9953034,0.000045230503,0.0032383637,0.000042102027,0.00005723268,0.00000556873,0.0000050640024,0.000011060833,0.0012919721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974519,0.00031442812,0.0003307422,0.0012644371,0.00014414157,0.00049435254],"domain_scores_gemma":[0.9960667,0.0004885466,0.0003326379,0.002293808,0.0005704909,0.00024782127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008459718,0.00033642832,0.00042733116,0.0001269543,0.00033168963,0.00020709512,0.003353921,0.00025948306,0.000022223037],"category_scores_gemma":[0.00044887443,0.00026148398,0.00031513983,0.0005578365,0.0002794288,0.00025110977,0.003987888,0.0004910019,0.00014824023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058712154,0.0002303764,0.009393547,0.00020268204,0.00014149534,0.000029938288,0.001924399,0.04717335,0.000047236736,0.93181074,0.0008274737,0.008160063],"study_design_scores_gemma":[0.0004318223,0.00016421577,0.013739807,0.00020934569,0.000072909184,0.0000037806683,0.00023630567,0.32009044,0.00020975426,0.66135615,0.0027421857,0.0007432693],"about_ca_topic_score_codex":0.0010142092,"about_ca_topic_score_gemma":0.00048769583,"teacher_disagreement_score":0.2729171,"about_ca_system_score_codex":0.00034773568,"about_ca_system_score_gemma":0.00040710394,"threshold_uncertainty_score":0.9999837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48959497,0.002547445,0.49705777,0.00053117616,0.0021814657,0.0014998715,0.000005709747,0.0005522797,0.0060293474],"genre_scores_gemma":[0.894143,0.00015008068,0.10433014,0.00016868091,0.00035582593,0.00042761245,0.000017985232,0.000020433516,0.0003862407],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997363,0.00011537784,0.00047684292,0.0011399703,0.00024062941,0.00066417846],"domain_scores_gemma":[0.99804884,0.0003417611,0.00029784205,0.0010290273,0.00015050152,0.00013204574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046785883,0.0004076595,0.00056854245,0.00015506224,0.00013686303,0.00030638606,0.002231481,0.0005767489,0.000029907354],"category_scores_gemma":[0.00031311432,0.00034450024,0.00023149823,0.0003629338,0.000099269826,0.00016937328,0.0014064263,0.0009859337,0.0001462554],"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.000017165146,0.00078488624,0.77945423,0.00060766126,0.00008185217,0.00004141901,0.0057355375,0.0003540757,0.000013066106,0.13591048,0.00028562883,0.07671401],"study_design_scores_gemma":[0.0008919839,0.0005531938,0.13133168,0.0019249053,0.00004278582,0.000013455559,0.00016828816,0.06669113,0.00026993864,0.78889704,0.007550356,0.0016652431],"about_ca_topic_score_codex":0.000054551998,"about_ca_topic_score_gemma":0.00008944657,"teacher_disagreement_score":0.6529866,"about_ca_system_score_codex":0.00009572762,"about_ca_system_score_gemma":0.00012516718,"threshold_uncertainty_score":0.9999007},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7730428,0.00015904884,0.22423743,0.00003456021,0.0001898647,0.00021505254,0.00004788834,0.00013288169,0.0019404948],"genre_scores_gemma":[0.9933836,0.00004430215,0.0063654906,0.000047109104,0.000024249553,5.6242436e-7,0.0000498409,0.000009704834,0.00007516264],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981895,0.0002313895,0.0002928384,0.00088455377,0.00011199888,0.00028969956],"domain_scores_gemma":[0.99845964,0.00014380077,0.00025462068,0.0009238741,0.000118155906,0.00009992955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043009658,0.00027727557,0.0004889884,0.00026152888,0.00009527849,0.000043653738,0.0006163694,0.00013146742,0.000005199098],"category_scores_gemma":[0.0000284142,0.0003172084,0.00019968764,0.0003487991,0.00043787988,0.00020298912,0.0018152884,0.00034031624,0.0000024937165],"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.000050298513,0.0004061379,0.46558848,0.00074610533,0.00013340065,0.0004692399,0.00019067139,0.06776352,0.000108613174,0.46429354,0.00018350483,0.0000664697],"study_design_scores_gemma":[0.0017522122,0.00010358089,0.21144803,0.00063189754,0.00017244268,0.000014425218,0.00027560408,0.76162195,0.0009205402,0.021835579,0.00026265514,0.00096107967],"about_ca_topic_score_codex":0.0040505705,"about_ca_topic_score_gemma":0.0021927918,"teacher_disagreement_score":0.69385844,"about_ca_system_score_codex":0.0002258843,"about_ca_system_score_gemma":0.00023783937,"threshold_uncertainty_score":0.999928},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50326294,0.0059510125,0.17121659,0.0017538507,0.010782364,0.0016965568,0.00000504526,0.0022124771,0.30311915],"genre_scores_gemma":[0.9741566,0.00017480181,0.014622766,0.0007128149,0.0004799545,0.00015247852,0.000028390748,0.000036400095,0.009635775],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973216,0.00016453308,0.00036893235,0.0011764958,0.0003135616,0.00065489515],"domain_scores_gemma":[0.9975881,0.000051935247,0.00025788692,0.0016961588,0.00018430188,0.00022159546],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041453494,0.00045140416,0.00046379433,0.000103126935,0.0001703159,0.00030456472,0.002288064,0.00045422013,0.00008691093],"category_scores_gemma":[0.000102109,0.00036628736,0.00028093296,0.0003352983,0.00011533497,0.00018252741,0.0018068496,0.0008095488,0.0018364781],"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.00000949662,0.001110717,0.72462326,0.00039339735,0.00025016014,0.0004241163,0.0027709738,0.00005748787,0.00019418844,0.19915481,0.0149491755,0.056062184],"study_design_scores_gemma":[0.0017834919,0.0007756236,0.33708203,0.00074399466,0.00017685286,0.00021160925,0.00007554114,0.0054415823,0.0032640405,0.16087231,0.48490497,0.0046679317],"about_ca_topic_score_codex":0.000034113607,"about_ca_topic_score_gemma":0.000019816907,"teacher_disagreement_score":0.47089365,"about_ca_system_score_codex":0.000106011044,"about_ca_system_score_gemma":0.000255574,"threshold_uncertainty_score":0.9998789},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19216879,0.0005553048,0.7936029,0.00007991726,0.0007384472,0.00036233873,0.00003753227,0.00036964013,0.0120851295],"genre_scores_gemma":[0.98953605,0.00059392885,0.008422021,0.00018691627,0.00013368159,0.0000010240574,0.00011991476,0.000026727877,0.0009797197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967413,0.00027509543,0.00027280918,0.0021017427,0.0001086478,0.0005004364],"domain_scores_gemma":[0.9954461,0.00019124273,0.00035899118,0.0036550148,0.00012391369,0.00022476423],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00047793568,0.00049721973,0.00054003554,0.00017333147,0.00029699935,0.00027269986,0.0056904363,0.0003531752,0.000074309275],"category_scores_gemma":[0.00012365138,0.0005004316,0.00014846218,0.00042445437,0.00022781284,0.0011985998,0.011081429,0.000706664,0.00016153346],"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.000088936526,0.00052089,0.015385444,0.00033331776,0.0002982118,0.00058578077,0.005531722,0.004337877,0.00009128716,0.96361995,0.0032445297,0.00596204],"study_design_scores_gemma":[0.002813501,0.00045108143,0.0067106714,0.00074232457,0.00050339015,0.00003579032,0.00033290347,0.7765741,0.0006314282,0.14823768,0.059655923,0.0033112655],"about_ca_topic_score_codex":0.00026496587,"about_ca_topic_score_gemma":0.000054083284,"teacher_disagreement_score":0.8153823,"about_ca_system_score_codex":0.00009741417,"about_ca_system_score_gemma":0.00034126066,"threshold_uncertainty_score":0.9997447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004257747,0.00011372193,0.94258726,0.00096915575,0.0033036636,0.00025649514,0.0000045446677,0.0013915849,0.047115836],"genre_scores_gemma":[0.940695,0.000038021684,0.024050081,0.00021449666,0.0005167628,0.000060429986,0.000087740715,0.000025199033,0.034312263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832517,0.00006817179,0.00026290084,0.00073396304,0.00031085228,0.0002989535],"domain_scores_gemma":[0.99861234,0.000067782945,0.00013573817,0.000935222,0.00013494473,0.00011395423],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041188108,0.00022884284,0.00025475063,0.00013851062,0.00009630343,0.00034507515,0.0013309023,0.00014748274,0.000052350162],"category_scores_gemma":[0.000099937475,0.00019114342,0.00016233267,0.00015026382,0.000029289786,0.00015619125,0.0025433232,0.00035050997,0.0019565448],"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.000007918188,0.00026346245,0.0036423614,0.00030153687,0.00016963333,0.00040078227,0.0034767825,0.0015217217,0.00009785502,0.6482861,0.25066492,0.09116694],"study_design_scores_gemma":[0.00042997947,0.00008814281,0.0077655045,0.000121635654,0.000027971771,0.000031331318,0.00003330861,0.7322474,0.0020379815,0.23663332,0.019457195,0.0011262001],"about_ca_topic_score_codex":0.0004890679,"about_ca_topic_score_gemma":0.00013873952,"teacher_disagreement_score":0.93643725,"about_ca_system_score_codex":0.00008924917,"about_ca_system_score_gemma":0.00024941072,"threshold_uncertainty_score":0.99882054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01250425,0.00021958761,0.9672605,0.00015569058,0.0028245877,0.00049156754,0.0000018135054,0.0008724318,0.01566957],"genre_scores_gemma":[0.98514295,0.00006206299,0.0130300885,0.00001740736,0.0001349139,0.00007384019,0.0000150627575,0.000017945607,0.0015057122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983565,0.00021521536,0.00028409224,0.00057698396,0.0003239075,0.00024329858],"domain_scores_gemma":[0.9983703,0.00033991275,0.0002500848,0.0008309962,0.00013510016,0.000073596246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229876,0.00024856385,0.00038939985,0.00014880893,0.000083503845,0.00012722283,0.0010781373,0.00027463344,0.00002465629],"category_scores_gemma":[0.00010646536,0.00016797848,0.00019099971,0.00024943912,0.00010848944,0.00013789744,0.0019462433,0.00033470287,0.00013895301],"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.0000694088,0.00020312572,0.0035595587,0.0011420429,0.00013232515,0.000028995553,0.0016098865,0.0006300427,0.0012253132,0.30350825,0.0033114697,0.6845796],"study_design_scores_gemma":[0.0012950855,0.0014165817,0.01706744,0.001597371,0.00009242669,0.00002451417,0.00015560235,0.22678822,0.31942144,0.42770982,0.0029951832,0.0014363026],"about_ca_topic_score_codex":0.00006242284,"about_ca_topic_score_gemma":0.000041333155,"teacher_disagreement_score":0.9726387,"about_ca_system_score_codex":0.000059579143,"about_ca_system_score_gemma":0.00013619462,"threshold_uncertainty_score":0.6849963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023524903,0.0002573391,0.96035296,0.00067327,0.0005713097,0.00017934754,0.00001070017,0.00023204912,0.0141981505],"genre_scores_gemma":[0.9215004,0.0000032065504,0.07750773,0.00024815078,0.00009432688,0.000039111386,0.000023364853,0.000012126476,0.00057158776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982893,0.00013321282,0.00035602174,0.00053927646,0.00031451674,0.00036770574],"domain_scores_gemma":[0.9987973,0.00052002654,0.00007765718,0.00041160133,0.000113881455,0.00007953664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028940383,0.00022796533,0.00021456993,0.000358556,0.0002780291,0.00012937798,0.00082993304,0.000112978385,0.00007205085],"category_scores_gemma":[0.000010289859,0.00021266604,0.000112534115,0.0006366376,0.00006024407,0.00031912109,0.000029502477,0.00030596124,0.00035191906],"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.000030433028,0.00095456967,0.0012648606,0.000021002596,0.00003001557,0.0001154604,0.0015160078,0.7116567,0.00006976528,0.27157336,0.00085586216,0.011911961],"study_design_scores_gemma":[0.0022142571,0.0003152309,0.051748686,0.00007856883,0.000014488066,0.00015230321,0.0002100333,0.082063824,0.00026640622,0.8547652,0.0074225063,0.00074852904],"about_ca_topic_score_codex":0.000050608414,"about_ca_topic_score_gemma":0.00010287314,"teacher_disagreement_score":0.8979755,"about_ca_system_score_codex":0.00016319624,"about_ca_system_score_gemma":0.00013071555,"threshold_uncertainty_score":0.8672269},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16296372,0.000036886973,0.8260715,0.0000369235,0.0001729008,0.00021144176,0.000002155215,0.00011248783,0.010391979],"genre_scores_gemma":[0.95230097,0.0000031316029,0.04740038,0.00006557021,0.000027092667,0.000015049286,0.0000020391562,0.0000036163513,0.0001821415],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995089,0.0000074253876,0.00009913015,0.00020848989,0.000033312743,0.00014271039],"domain_scores_gemma":[0.9996556,0.000019930754,0.00003921554,0.00017832796,0.000043811764,0.00006312079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014963362,0.00006484292,0.000059907452,0.000025053056,0.00005808544,0.000077917844,0.000238127,0.0000143862535,0.00008013604],"category_scores_gemma":[0.0000058543196,0.000050644674,0.000019088713,0.000027868886,0.000013630101,0.00047126808,0.000054758497,0.000025061265,0.000010528294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035232104,0.00021772757,0.0036885808,0.000039083476,0.00003407482,0.0000030340393,0.009022791,4.964533e-7,0.029206766,0.14021055,0.00311459,0.8144271],"study_design_scores_gemma":[0.0027750742,0.0023923472,0.09692142,0.000011138311,0.000024299849,0.000045763638,0.0017324167,0.091240875,0.7506402,0.046591926,0.006838964,0.0007855451],"about_ca_topic_score_codex":0.00011536349,"about_ca_topic_score_gemma":0.00010926488,"teacher_disagreement_score":0.81364155,"about_ca_system_score_codex":0.00000901327,"about_ca_system_score_gemma":0.000017525113,"threshold_uncertainty_score":0.20652299},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7525009,0.00002917551,0.23996747,0.000107014755,0.00026452466,0.00013012743,0.0000010235891,0.00014891595,0.0068508526],"genre_scores_gemma":[0.996195,0.000023657298,0.0018710286,0.0004014679,0.000051147807,2.893336e-7,0.0000020102211,0.0000074441245,0.001447961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986871,0.00009472731,0.00012362612,0.00065153284,0.00006945502,0.00037357106],"domain_scores_gemma":[0.998925,0.00017411809,0.00006712153,0.0006377425,0.000057211488,0.0001388167],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018282923,0.0001621498,0.00021332175,0.00016946996,0.00006340073,0.000047788704,0.0010384462,0.00012385158,0.0001286557],"category_scores_gemma":[0.00007732759,0.00015804725,0.000105057115,0.0009531237,0.000061478044,0.00040139552,0.0004191788,0.00032562795,0.0010009492],"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.000053047275,0.0003323503,0.12465589,0.000023208642,0.000027141465,0.0014789827,0.00043705228,0.011931914,0.00014794871,0.8595699,0.0005664865,0.0007760652],"study_design_scores_gemma":[0.0012469387,0.00025337902,0.02648371,0.000077760764,0.000012070725,0.000024351995,0.0000863249,0.8668029,0.00040474764,0.097893275,0.006127561,0.0005870335],"about_ca_topic_score_codex":0.00003924806,"about_ca_topic_score_gemma":0.00001799274,"teacher_disagreement_score":0.8548709,"about_ca_system_score_codex":0.00009048296,"about_ca_system_score_gemma":0.00003907196,"threshold_uncertainty_score":0.9997769},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033633433,0.005867482,0.6709941,0.0012943891,0.0016800667,0.0013686296,0.0000074098634,0.00036153334,0.28479296],"genre_scores_gemma":[0.9418387,0.000114486,0.056706753,0.00016486719,0.00019172337,0.00005771548,0.0000028914278,0.000012140888,0.0009107224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824995,0.00051483535,0.0002744175,0.00042500978,0.00012948381,0.00040629943],"domain_scores_gemma":[0.9950375,0.0033723577,0.00045328867,0.0007376563,0.0002638125,0.00013536308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051047397,0.0002088943,0.00029241183,0.00006356534,0.0010367851,0.0006233546,0.0010602335,0.00008232352,0.000019591544],"category_scores_gemma":[0.0059431395,0.00016601903,0.00010244701,0.00007424824,0.00033284977,0.0019863073,0.0005072877,0.00018592805,0.000026438498],"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.00024152845,0.00022146881,0.00014243145,0.00008081319,0.000046545818,0.000017797573,0.0009958458,0.0000013263113,0.00012270086,0.71524656,0.00010669264,0.28277627],"study_design_scores_gemma":[0.0034903397,0.0032011247,0.00057697255,0.0002257375,0.00035194284,0.0008065033,0.0024423928,0.0032660118,0.011836339,0.2819418,0.69057983,0.0012809978],"about_ca_topic_score_codex":0.000017442053,"about_ca_topic_score_gemma":0.000006880715,"teacher_disagreement_score":0.9082053,"about_ca_system_score_codex":0.000017413427,"about_ca_system_score_gemma":0.00010238865,"threshold_uncertainty_score":0.79742175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9474542,0.00013357,0.051355228,0.00005082896,0.0001767895,0.00025320944,0.000026445647,0.00020312346,0.00034656335],"genre_scores_gemma":[0.9911827,0.00014119863,0.008417619,0.00005525688,0.000059530237,8.324765e-7,0.000031152937,0.000008872779,0.00010284373],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986482,0.000057042394,0.00013545043,0.00081123644,0.0000417933,0.00030625003],"domain_scores_gemma":[0.99855083,0.0002063748,0.00017540262,0.0008828733,0.00004975261,0.0001347739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033170797,0.00016613805,0.00021914099,0.00009581479,0.0004996631,0.00020956549,0.0005342674,0.00004905239,0.0000014434097],"category_scores_gemma":[0.00017884602,0.00017424862,0.0000532793,0.00011701762,0.0001922493,0.001458566,0.0008409211,0.00011241334,0.0000023856408],"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.00007849442,0.0001630289,0.8953156,0.00012359564,0.000067505316,0.0005629988,0.0014409625,0.000028320177,0.00061897625,0.09365702,0.00012631295,0.00781719],"study_design_scores_gemma":[0.0028906446,0.00022373228,0.36546734,0.0005416282,0.00008650007,0.000024729563,0.0009786673,0.6199054,0.0007002264,0.002681095,0.005565384,0.00093465886],"about_ca_topic_score_codex":0.0011505883,"about_ca_topic_score_gemma":0.0010477453,"teacher_disagreement_score":0.6198771,"about_ca_system_score_codex":0.00003597812,"about_ca_system_score_gemma":0.000045360222,"threshold_uncertainty_score":0.71056527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31100443,0.018448588,0.51338303,0.0012801719,0.00048895733,0.0017620141,0.0000015514933,0.00063457567,0.15299669],"genre_scores_gemma":[0.8467534,0.00043786576,0.1526505,0.000054890195,0.000025340505,0.000011466677,0.0000010778699,0.0000057474776,0.00005972158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849313,0.00055956765,0.00025183163,0.0003482669,0.000116635165,0.00023058178],"domain_scores_gemma":[0.99790436,0.0013034645,0.0003651165,0.00022279017,0.00010627013,0.0000980101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002831851,0.0001401747,0.00019300455,0.000055322325,0.00019909897,0.00014246715,0.0001544428,0.00008436918,0.000004296836],"category_scores_gemma":[0.0015573598,0.0001115691,0.000025786301,0.00016881939,0.00042766135,0.00093075813,0.00024007536,0.00017810163,0.0000015387113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061001614,0.000063957355,0.0017051494,0.000049124978,0.000028001756,0.00002765547,0.008124858,6.926162e-8,0.00014723273,0.56330407,9.940403e-7,0.4264879],"study_design_scores_gemma":[0.001736807,0.001864424,0.002441478,0.0004408512,0.00035190393,0.0031335808,0.01571382,0.0024215064,0.0039938996,0.9609499,0.0061447294,0.00080712704],"about_ca_topic_score_codex":0.000023536795,"about_ca_topic_score_gemma":0.0000023056912,"teacher_disagreement_score":0.53574896,"about_ca_system_score_codex":0.0000055179416,"about_ca_system_score_gemma":0.000022183533,"threshold_uncertainty_score":0.45496556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45623133,0.010010955,0.39811113,0.005065354,0.002545781,0.0015214134,0.00004690664,0.0008264153,0.12564072],"genre_scores_gemma":[0.9766443,0.00027281928,0.021586722,0.00065600715,0.00009912319,0.00010059653,0.000009133152,0.000007675031,0.00062363874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886566,0.00012038743,0.00017130122,0.00044368542,0.00015064022,0.00024831347],"domain_scores_gemma":[0.9990806,0.00015257808,0.000041882253,0.0004550861,0.00009698772,0.00017287972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057985354,0.00013316907,0.00019231671,0.00007135462,0.00004374885,0.000100224715,0.00037395942,0.000037800382,0.000033345008],"category_scores_gemma":[0.00024709606,0.0000998314,0.000022720786,0.00029529002,0.000072573705,0.0008379776,0.0004466549,0.000099583136,0.000094514544],"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.00001117107,0.00041748464,0.42090622,0.000030063937,0.000026435522,0.00006364944,0.0047900765,0.000007015215,0.000028356722,0.5020732,0.045650035,0.025996264],"study_design_scores_gemma":[0.004608341,0.0006747788,0.21208966,0.00023147181,0.000056484878,0.00013318178,0.0029411695,0.02324555,0.011179017,0.14059262,0.6017423,0.0025053772],"about_ca_topic_score_codex":0.001579327,"about_ca_topic_score_gemma":0.0014718608,"teacher_disagreement_score":0.5560923,"about_ca_system_score_codex":0.00004928632,"about_ca_system_score_gemma":0.00009616881,"threshold_uncertainty_score":0.40710062},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94154346,0.0002152727,0.020407235,0.0060614296,0.00089676067,0.00017820623,0.000009169589,0.0004897835,0.030198688],"genre_scores_gemma":[0.9728603,0.000014028982,0.026522055,0.00020756056,0.0000584653,0.000008666727,0.0000024585531,0.0000051048974,0.00032137224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910897,0.000006043439,0.00019754354,0.00028287547,0.00024362096,0.00016092231],"domain_scores_gemma":[0.9989704,0.00010614626,0.00016094792,0.00007730024,0.00063729513,0.000047940044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026059104,0.0001134903,0.00015102346,0.000056147775,0.0001406281,0.0003037082,0.00066415087,0.000072838986,0.000006962081],"category_scores_gemma":[0.00052454416,0.000081184815,0.00006533925,0.00013458349,0.000043719418,0.00016516002,0.00026156075,0.00014529125,0.0000024542808],"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.00002505907,0.00006577167,0.005922456,0.000057914178,0.000059329675,0.0000037626596,0.0010085492,0.00020162137,0.027911542,0.9632674,0.0005076636,0.0009689214],"study_design_scores_gemma":[0.0003603811,0.000061044855,0.0023220107,0.0004133051,0.0000107777905,0.000056621844,0.0003443549,0.9454399,0.031767584,0.018716175,0.00036695585,0.00014089145],"about_ca_topic_score_codex":0.0000015544099,"about_ca_topic_score_gemma":2.8538634e-7,"teacher_disagreement_score":0.9452383,"about_ca_system_score_codex":0.000018606599,"about_ca_system_score_gemma":0.000074672316,"threshold_uncertainty_score":0.33106208},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38714543,0.000023430308,0.606727,0.00020616529,0.0013768203,0.0019310463,0.000101074875,0.000109026216,0.0023800274],"genre_scores_gemma":[0.88996214,0.0000031299705,0.108694054,0.0008602663,0.00014981302,0.000073875664,0.00007592918,0.000036322457,0.0001445025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658966,0.000074071875,0.0013499574,0.00043769443,0.0005868601,0.0009617485],"domain_scores_gemma":[0.99653345,0.0006929886,0.0005837816,0.0013434961,0.00062291604,0.0002233743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017614226,0.0004650877,0.00075699744,0.00018801799,0.00064460497,0.00064587616,0.0026717081,0.0002070014,0.000016963259],"category_scores_gemma":[0.00021735435,0.0003252461,0.00037535393,0.00047204466,0.00021480008,0.0010439672,0.001491656,0.00037525682,0.0001248696],"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.0011283229,0.0024193102,0.019359242,0.004675205,0.0008172314,0.000005363471,0.107159525,0.014132645,0.0013524782,0.6550393,0.016398808,0.17751259],"study_design_scores_gemma":[0.0032477411,0.0009823688,0.003362127,0.00041639069,0.000033099852,0.000027241975,0.0016820794,0.962709,0.004134433,0.0025003667,0.020245533,0.00065962865],"about_ca_topic_score_codex":0.000060597595,"about_ca_topic_score_gemma":0.000015457854,"teacher_disagreement_score":0.94857633,"about_ca_system_score_codex":0.00016159924,"about_ca_system_score_gemma":0.00014219678,"threshold_uncertainty_score":0.99991995},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3750376,0.0017061401,0.3046305,0.0012020696,0.00073062116,0.0009119446,0.000010098623,0.0003981008,0.3153729],"genre_scores_gemma":[0.97264826,0.000060564846,0.022329042,0.0003268094,0.000024152612,0.000007967304,0.0000027657316,0.0000074090394,0.0045930017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989103,0.000042732594,0.00022290864,0.0003700804,0.00018765363,0.00026634615],"domain_scores_gemma":[0.9989599,0.00021527971,0.00011875122,0.0004526399,0.00016249466,0.000090939066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015186521,0.00014655758,0.00025634136,0.00008017429,0.000073403164,0.00006693408,0.00055696024,0.00007324544,0.00025944176],"category_scores_gemma":[0.00006359061,0.000109154156,0.00005203605,0.00029413862,0.00005066971,0.0003285946,0.00032448577,0.00009444145,0.00012240895],"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.00007875222,0.001260686,0.047477417,0.00040197012,0.0001803371,0.000038599086,0.009021408,0.00034164783,0.025774889,0.88285214,0.01397434,0.018597808],"study_design_scores_gemma":[0.01117377,0.004076978,0.2663,0.0005719887,0.00009229738,0.0002472446,0.0008279406,0.47729683,0.012346976,0.051807623,0.17226844,0.0029899213],"about_ca_topic_score_codex":0.00004908575,"about_ca_topic_score_gemma":0.000036439404,"teacher_disagreement_score":0.8310445,"about_ca_system_score_codex":0.000010802773,"about_ca_system_score_gemma":0.000040438434,"threshold_uncertainty_score":0.44511774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010480941,0.0016816789,0.9864231,0.00018883181,0.00211171,0.002098099,0.000018560604,0.0002098083,0.0071634105],"genre_scores_gemma":[0.07343715,0.000045035977,0.9238606,0.0005038008,0.00084944774,0.00011708807,0.000012646832,0.00005196819,0.0011222654],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953428,0.000042686544,0.00058745587,0.0021466769,0.0007973671,0.0010830123],"domain_scores_gemma":[0.99518764,0.0022577357,0.00057244586,0.0012391836,0.00054543535,0.00019757116],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013856246,0.0007028971,0.00081601384,0.00052740634,0.00049525965,0.0010840994,0.0038260552,0.0006375488,0.0000148700765],"category_scores_gemma":[0.00055396586,0.0005840028,0.0003025099,0.0003982205,0.00035720025,0.00069161586,0.001117436,0.00087983464,0.000028744656],"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.000030273906,0.000050372044,0.00015190161,0.00028776162,0.00005138168,0.000016319867,0.013059336,0.0049538887,0.0000835318,0.43933797,0.00006790732,0.54190934],"study_design_scores_gemma":[0.0006042127,0.0006715546,0.00015173413,0.0020385378,0.000028319055,0.000036742586,0.000005471719,0.29710746,0.0015716611,0.6947598,0.0018744457,0.0011501141],"about_ca_topic_score_codex":0.000017965423,"about_ca_topic_score_gemma":0.00018870411,"teacher_disagreement_score":0.54075927,"about_ca_system_score_codex":0.0003431705,"about_ca_system_score_gemma":0.0012777403,"threshold_uncertainty_score":0.99995285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8672587,0.0057744137,0.01429317,0.009502723,0.0019031682,0.003992984,0.000023443055,0.0011327139,0.09611868],"genre_scores_gemma":[0.9927203,0.00020907202,0.0019443262,0.00035099557,0.0002890554,0.00018710124,0.0000053931876,0.000052220388,0.0042415163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958503,0.0005648033,0.00038430383,0.0017852521,0.00063415733,0.0007811404],"domain_scores_gemma":[0.99482685,0.0007424747,0.00051720603,0.0033974755,0.00025237162,0.0002636074],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013201912,0.00080598204,0.0009323976,0.00018812146,0.00062211725,0.0017644443,0.0015798829,0.0004504722,0.000015598816],"category_scores_gemma":[0.00029441123,0.00051984,0.0002545304,0.000326758,0.00015052308,0.0003222959,0.0044094026,0.0015258611,0.00009160414],"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.0001917551,0.0072291354,0.10567076,0.0017412398,0.0024868837,0.04412273,0.10659233,0.0003449978,0.000038400278,0.6130737,0.055795442,0.062712654],"study_design_scores_gemma":[0.013852015,0.008955911,0.05465229,0.009856227,0.0013088349,0.033375468,0.21749999,0.50774163,0.0011546008,0.04177646,0.09274259,0.01708396],"about_ca_topic_score_codex":0.0008203851,"about_ca_topic_score_gemma":0.0007632423,"teacher_disagreement_score":0.5712972,"about_ca_system_score_codex":0.00011775607,"about_ca_system_score_gemma":0.0001563426,"threshold_uncertainty_score":0.99972534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12418393,0.007257208,0.84060997,0.0032978544,0.00480483,0.00062557484,0.000005887868,0.00004541854,0.0191693],"genre_scores_gemma":[0.9877929,0.00010388249,0.010621709,0.0013207161,0.000025651494,0.000009729892,0.0000024313904,0.000004264759,0.00011868074],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99910456,0.0001516764,0.00019939514,0.00029457494,0.00008469683,0.00016511841],"domain_scores_gemma":[0.9993726,0.00012671437,0.00011762699,0.00028779628,0.0000616706,0.00003361646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766111,0.00008980288,0.00024985347,0.00008992742,0.000029586223,0.000016908976,0.00043749978,0.000103132144,0.0000065285167],"category_scores_gemma":[0.00003441714,0.00005965874,0.000044697106,0.00018127348,0.00022777684,0.00009391051,0.00009594812,0.000165993,0.000013122839],"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.00033473212,0.00012226323,0.19979598,0.000015909818,0.000051989628,0.000006245415,0.002126137,0.0000040899513,0.00038621906,0.3498328,0.049109083,0.39821455],"study_design_scores_gemma":[0.026293512,0.0006837866,0.6268668,0.00011741973,0.000021476035,0.00030239858,0.0011074874,0.051760074,0.00020206222,0.26177943,0.030234162,0.00063138735],"about_ca_topic_score_codex":0.000012856079,"about_ca_topic_score_gemma":0.000008117033,"teacher_disagreement_score":0.863609,"about_ca_system_score_codex":0.000019128773,"about_ca_system_score_gemma":0.00001892178,"threshold_uncertainty_score":0.24328129},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6621545,0.00020423198,0.29973453,0.0011233832,0.0005313048,0.00047136607,6.150693e-7,0.00020560759,0.035574447],"genre_scores_gemma":[0.988535,0.000018925084,0.011098745,0.00022446159,0.00007671465,0.000013672499,2.6403822e-7,0.000008608684,0.000023620207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613625,0.00004056007,0.0005052948,0.0011207729,0.0009050373,0.001292108],"domain_scores_gemma":[0.99860775,0.00014084452,0.0001760711,0.0004950738,0.0003845122,0.00019574423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00341751,0.00026885906,0.0004588346,0.00028260174,0.0001231831,0.00027074543,0.0037847636,0.00012983439,0.000053125947],"category_scores_gemma":[0.00023995338,0.00020834323,0.00010754909,0.0021820362,0.0015668009,0.0009098587,0.0014271335,0.0005581761,0.00007188133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015467314,0.000111031426,0.0026251501,0.000035191893,0.0000039555694,0.000002439936,0.00057395606,0.000009631027,0.0021233098,0.988043,0.000013418049,0.006443465],"study_design_scores_gemma":[0.00052793813,0.00081016513,0.007433158,0.000082852435,0.000004148183,0.00009225127,0.000018429446,0.19533154,0.012052038,0.78312063,0.0001534189,0.00037342787],"about_ca_topic_score_codex":0.000009427885,"about_ca_topic_score_gemma":0.0000015557736,"teacher_disagreement_score":0.3263805,"about_ca_system_score_codex":0.00044636283,"about_ca_system_score_gemma":0.00066511275,"threshold_uncertainty_score":0.84959906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23430158,0.000033783384,0.7406967,0.0002984068,0.00086045184,0.0007388886,0.0000018112058,0.00030393436,0.022764433],"genre_scores_gemma":[0.96424544,0.0000027453077,0.03478015,0.00037629437,0.00012752907,0.00004889063,0.0000028981249,0.000013613564,0.00040242277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743235,0.00015016829,0.00042812884,0.0010556899,0.00037973808,0.0005539406],"domain_scores_gemma":[0.99785954,0.00016983382,0.000082251136,0.0013471668,0.00022937452,0.00031182263],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073551777,0.00023747067,0.00026678384,0.00010919781,0.00014902865,0.00032906423,0.0016163095,0.00009183155,0.00006960675],"category_scores_gemma":[0.00036381907,0.00020821848,0.00008477347,0.0008171548,0.00012924406,0.0006337401,0.00039330634,0.0001947942,0.0030851958],"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.000012927406,0.0003703331,0.0016040755,0.000031007145,0.000006348374,0.0000031805023,0.0033624459,0.0023127643,0.0015887576,0.8603149,0.00006747056,0.13032581],"study_design_scores_gemma":[0.000045059798,0.00060184643,0.0051782494,0.00004620907,0.000012531451,0.000037558566,0.00096350856,0.5741423,0.017469333,0.39867723,0.0018693971,0.000956838],"about_ca_topic_score_codex":0.00015010059,"about_ca_topic_score_gemma":0.000096763055,"teacher_disagreement_score":0.7299439,"about_ca_system_score_codex":0.000085221254,"about_ca_system_score_gemma":0.00011986029,"threshold_uncertainty_score":0.99769104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046585794,0.0007777684,0.9918297,0.00017397826,0.0031066784,0.0011278533,0.0000081320695,0.00022325739,0.002286806],"genre_scores_gemma":[0.3961818,0.00007773613,0.599969,0.0012917457,0.00079463265,0.000022006265,0.000018806017,0.00006977667,0.0015744896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949329,0.00005621587,0.00060456456,0.0024178068,0.0010274628,0.0009610376],"domain_scores_gemma":[0.9952579,0.0011885768,0.00040202562,0.0023878026,0.00047246044,0.00029119797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013965026,0.0006972224,0.0008617033,0.0008443473,0.00034335928,0.0008874845,0.005109317,0.00047004697,0.00002119901],"category_scores_gemma":[0.00028419035,0.00055401924,0.00027572605,0.00067800446,0.00049915037,0.00037422107,0.00113725,0.00068156846,0.00010420921],"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.000027256498,0.00013092368,0.000083986786,0.00012387322,0.000013525423,0.0000222653,0.0010031342,0.026705613,0.00038541487,0.107135475,0.000046722347,0.8643218],"study_design_scores_gemma":[0.0006456386,0.0006117875,0.00020238615,0.000431692,0.0000130875,0.000024050967,1.5076708e-7,0.93680453,0.0009036065,0.05677376,0.0027262939,0.0008630007],"about_ca_topic_score_codex":0.000009600438,"about_ca_topic_score_gemma":0.000016010466,"teacher_disagreement_score":0.9100989,"about_ca_system_score_codex":0.00031410868,"about_ca_system_score_gemma":0.00078057783,"threshold_uncertainty_score":0.9996911},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99587446,0.00015600768,0.0000752195,0.0003833738,0.000055117664,0.0007645597,8.218213e-7,0.00016666013,0.0025237491],"genre_scores_gemma":[0.9615775,0.0000037210061,0.0378426,0.000029939314,0.00002694571,0.00004255387,0.0000024946996,0.000018494291,0.0004557606],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863553,0.000017050983,0.00029615156,0.0003959512,0.00035173778,0.00030356398],"domain_scores_gemma":[0.9985164,0.00008089764,0.0003820599,0.0006877033,0.0002863183,0.00004663923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043406337,0.00018742723,0.00028880336,0.00013223091,0.000038753416,0.00010072254,0.0023869497,0.00008725877,0.0000075826415],"category_scores_gemma":[0.00056457764,0.00011867462,0.0000817223,0.0008728267,0.000116820935,0.0003083275,0.00049048464,0.00019668767,0.000023849881],"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.00042158048,0.0016455941,0.40911826,0.0009632114,0.0002001247,0.0000064966466,0.027912693,0.000025693309,0.14076352,0.045096222,0.0002773795,0.37356922],"study_design_scores_gemma":[0.0075504263,0.012510387,0.21170156,0.006897179,0.00019485183,0.00011832827,0.0070441966,0.018725932,0.7196263,0.0077757253,0.005408423,0.0024466694],"about_ca_topic_score_codex":0.00006505398,"about_ca_topic_score_gemma":0.0000054147977,"teacher_disagreement_score":0.5788628,"about_ca_system_score_codex":0.00004059765,"about_ca_system_score_gemma":0.00004483242,"threshold_uncertainty_score":0.48394108},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86866343,0.00044307843,0.0799493,0.011460756,0.0014708957,0.0019549706,0.000011102863,0.00040077246,0.035645675],"genre_scores_gemma":[0.99538404,0.0000091802885,0.0038537234,0.00029566174,0.000079315476,0.000025272442,2.8945843e-7,0.00001095508,0.00034155053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983583,0.000030037536,0.0003938265,0.00044571617,0.00047637214,0.0002957154],"domain_scores_gemma":[0.998505,0.00006137673,0.00051871873,0.00031325957,0.00051275495,0.00008892304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003310337,0.00020997529,0.00027513952,0.000054210188,0.00013124358,0.000069476395,0.0022365293,0.00008517436,0.000038531878],"category_scores_gemma":[0.00044319613,0.00012037461,0.0001196882,0.0005591026,0.00048512494,0.00026900994,0.00046248568,0.00031630375,0.00002557866],"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.00011697583,0.00018691225,0.00040188924,0.00012943544,0.00002925428,0.0000013748702,0.021615898,0.00003117231,0.07262078,0.8183868,0.0004486805,0.08603083],"study_design_scores_gemma":[0.000101329475,0.00070994865,0.0011564497,0.00038687894,0.000046436126,0.000010983188,0.0033832446,0.01947359,0.96074337,0.012953456,0.0006446692,0.0003896332],"about_ca_topic_score_codex":0.0001147659,"about_ca_topic_score_gemma":0.000029505238,"teacher_disagreement_score":0.8881226,"about_ca_system_score_codex":0.000086255364,"about_ca_system_score_gemma":0.00023181406,"threshold_uncertainty_score":0.4908734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04476538,0.0065205097,0.88770044,0.0018990481,0.00073948444,0.00035231173,0.000002191422,0.00016651658,0.057854127],"genre_scores_gemma":[0.9616517,0.00023603466,0.037810266,0.00012976854,0.00004635366,0.000012865697,0.0000020648517,0.0000046487007,0.000106342115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982585,0.0008720512,0.0002633564,0.00023510853,0.00017238672,0.00019864015],"domain_scores_gemma":[0.995612,0.003432293,0.00028629374,0.00038020354,0.00023997317,0.000049193066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032627003,0.000110509194,0.00019413674,0.000033325017,0.00021445983,0.00011146016,0.0003732821,0.00003904953,0.00001090969],"category_scores_gemma":[0.004014732,0.00007439628,0.000061364706,0.000354696,0.0002425537,0.0007652422,0.0003368063,0.0001807314,0.0000042853158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036852467,0.0001652067,0.000077618526,0.00005631386,0.000029736833,0.000032066826,0.0027590578,0.000008247606,0.00030897337,0.8499059,0.0000059121135,0.1466141],"study_design_scores_gemma":[0.00080807443,0.0010288203,0.00089038356,0.00021491108,0.00021150948,0.00086186,0.016468288,0.0006007338,0.013447721,0.91825694,0.046687935,0.0005228055],"about_ca_topic_score_codex":0.000010047498,"about_ca_topic_score_gemma":0.0000028546842,"teacher_disagreement_score":0.91688627,"about_ca_system_score_codex":0.00001010495,"about_ca_system_score_gemma":0.00008003926,"threshold_uncertainty_score":0.4806299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3325708,0.00094363064,0.64246815,0.000069815425,0.0002002521,0.0005377617,0.000006690148,0.00013566804,0.023067214],"genre_scores_gemma":[0.98125523,0.0003553909,0.0006295473,0.00015607299,0.00010631015,0.0000014729658,0.000005564433,0.000022514996,0.017467868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969587,0.0004237815,0.00028654252,0.0015479908,0.00011010182,0.00067291467],"domain_scores_gemma":[0.9973775,0.00046534528,0.00028576417,0.0013275178,0.00018350176,0.00036036878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065972446,0.00042458955,0.00042722205,0.00021658227,0.0005064809,0.00021363219,0.0015378628,0.00028673565,0.0001518247],"category_scores_gemma":[0.000022653472,0.00043661546,0.00020475122,0.0010481974,0.0004881893,0.0006502296,0.00081610697,0.00046143282,0.00064426236],"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.000095745396,0.000059832317,0.0038792992,0.0000723422,0.000055985856,0.000040752202,0.001148515,0.040721487,0.00006342391,0.95182896,0.000039711555,0.0019939188],"study_design_scores_gemma":[0.0008752142,0.00013413798,0.00063332805,0.000053202966,0.00009344986,0.00004950688,0.0005248251,0.6838478,0.00005848513,0.30931783,0.0038275889,0.0005846775],"about_ca_topic_score_codex":0.000034730143,"about_ca_topic_score_gemma":0.0000097971815,"teacher_disagreement_score":0.64868444,"about_ca_system_score_codex":0.00016293445,"about_ca_system_score_gemma":0.00013570875,"threshold_uncertainty_score":0.99980855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7907916,0.013092547,0.15296496,0.019294744,0.00030615708,0.0003421955,0.0000025350419,0.0002616672,0.022943636],"genre_scores_gemma":[0.9978815,0.00011671432,0.0016426921,0.00023303708,0.000026547657,0.0000035052212,8.345743e-8,0.0000019249414,0.00009403602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959445,0.000033905457,0.000089508045,0.00012280719,0.00006595385,0.00009339936],"domain_scores_gemma":[0.999583,0.00016692291,0.00004206376,0.00012864864,0.000035647037,0.00004373861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009511449,0.000055127945,0.000086724496,0.0000073490555,0.00009593542,0.000061000093,0.00031228262,0.000016025027,0.0000021550372],"category_scores_gemma":[0.000113880094,0.000028676022,0.00002825286,0.000076294986,0.00009722451,0.000090849186,0.00014424828,0.00002746032,0.00001288902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038369362,0.000014461077,0.0008075391,0.0000088754505,0.000015213389,0.000003500426,0.008053335,6.100403e-7,0.0059596435,0.96845186,0.0002709307,0.016410204],"study_design_scores_gemma":[0.003423341,0.0040386193,0.18674117,0.00014293924,0.00006742707,0.00017460623,0.01040426,0.19351703,0.2247935,0.3113145,0.063808985,0.0015736282],"about_ca_topic_score_codex":0.0000055224154,"about_ca_topic_score_gemma":0.0000034142824,"teacher_disagreement_score":0.65713733,"about_ca_system_score_codex":0.000002325773,"about_ca_system_score_gemma":0.000014128049,"threshold_uncertainty_score":0.11693742},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017932486,0.002612885,0.96499294,0.0033161864,0.00011697166,0.0005947176,0.0000018477132,0.00043704748,0.009994945],"genre_scores_gemma":[0.7087453,0.000039089446,0.29033324,0.00071533106,0.00010009878,0.000022975039,0.0000031517757,0.000012922866,0.000027910459],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770236,0.0007037559,0.00030663115,0.00055399636,0.00027313235,0.0004601521],"domain_scores_gemma":[0.99729663,0.0016333058,0.00035309402,0.00031657238,0.000164029,0.000236355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003161098,0.0002495941,0.00033004768,0.000056290508,0.00024038219,0.00028783118,0.0005654435,0.00007086529,0.000013069329],"category_scores_gemma":[0.0021826914,0.00018573865,0.000068417925,0.00044380268,0.0002477286,0.0012474214,0.00023741007,0.00035582858,0.0000118705975],"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.0004937462,0.00014763883,0.0001510765,0.00014171576,0.00009199034,0.00016692308,0.009287698,0.000036467747,0.00035408334,0.44215748,0.000013543716,0.5469576],"study_design_scores_gemma":[0.009780251,0.018422453,0.00036381846,0.0010445216,0.0013307991,0.006867608,0.054401673,0.024638461,0.016716463,0.19571717,0.6655933,0.00512343],"about_ca_topic_score_codex":0.0000066571765,"about_ca_topic_score_gemma":0.000001129051,"teacher_disagreement_score":0.6908128,"about_ca_system_score_codex":0.000012690155,"about_ca_system_score_gemma":0.000087145556,"threshold_uncertainty_score":0.75742024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038885097,0.000074301104,0.9355573,0.0009735654,0.0027358783,0.050185513,0.0009280204,0.00093150215,0.0047253766],"genre_scores_gemma":[0.5381449,0.00004523351,0.35051832,0.0030877315,0.002717877,0.096272185,0.006813789,0.0003626368,0.002037353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496377,0.00008916665,0.0020481125,0.00093129155,0.0007809144,0.0011867424],"domain_scores_gemma":[0.99519145,0.00032145536,0.0014446593,0.0018734107,0.00072176394,0.00044726764],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010201861,0.000961978,0.0012541256,0.00038776037,0.00048741943,0.0016433729,0.0032217174,0.0008332137,0.000024594661],"category_scores_gemma":[0.0005513688,0.0008500388,0.00093213125,0.0003620118,0.0000877135,0.0014572515,0.002621062,0.0010498802,0.00013572778],"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.001719299,0.0039626984,0.044102956,0.055108264,0.003094548,0.00005615735,0.0701377,0.004317855,0.00014326368,0.45580387,0.18348393,0.17806944],"study_design_scores_gemma":[0.0056701447,0.00090178655,0.0048253536,0.0013153647,0.00019088943,0.00005159946,0.00018111487,0.65474063,0.00077007053,0.05543941,0.27350238,0.0024112542],"about_ca_topic_score_codex":0.00004116959,"about_ca_topic_score_gemma":0.000020503989,"teacher_disagreement_score":0.6504228,"about_ca_system_score_codex":0.00032272964,"about_ca_system_score_gemma":0.00034494392,"threshold_uncertainty_score":0.999395},"labels":[],"label_agreement":null},{"id":"W3015221827","doi":"10.1093/logcom/exaa026","title":"Special Issue on Logical Foundations of Computer Science","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computational logic; Programming language; Computer science; Paraconsistent logic; Philosophy of logic; Logic programming; Proof theory; Type theory; Automated theorem proving; Non-classical logic; Intuitionistic logic; Classical logic; Mathematical logic; T-norm fuzzy logics; Theoretical computer science; Mathematics; Fuzzy logic; Artificial intelligence; Description logic; Propositional calculus; Higher-order logic; Logical consequence; Type (biology); Mathematical proof; Fuzzy set","score_opus":0.044426264096525066,"score_gpt":0.2985361169041228,"score_spread":0.25410985280759774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015221827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027499627,0.00004454777,0.96082884,0.0023732558,0.00082610257,0.00006236394,4.2982037e-7,0.00001660042,0.008348241],"genre_scores_gemma":[0.9437085,0.000018506435,0.05155349,0.0007758355,0.003929653,2.6085166e-7,4.4104362e-7,0.0000021472401,0.00001119825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896693,0.000054186985,0.0003318939,0.00017450406,0.00035085066,0.000121637386],"domain_scores_gemma":[0.99899155,0.0001259423,0.00033455805,0.00006736373,0.00034558977,0.00013497271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000356801,0.00008447515,0.00020144113,0.00011227519,0.00013009341,0.000119761964,0.00038661348,0.000034834244,0.00002283057],"category_scores_gemma":[0.00010166694,0.000060319566,0.00006129666,0.00041618466,0.00017378233,0.00037514797,0.00011565498,0.0001332451,0.000018101979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009529547,0.00037040006,0.0012662577,0.000041161093,0.000034837583,0.00006685105,0.0058102217,0.014443246,0.0006597475,0.32790732,0.012977751,0.6363269],"study_design_scores_gemma":[0.0028674102,0.009477151,0.06623376,0.00013499326,0.00005157335,0.00037183892,0.00029024814,0.7816833,0.0012610024,0.11355217,0.023527702,0.0005488539],"about_ca_topic_score_codex":7.389831e-7,"about_ca_topic_score_gemma":2.0493547e-7,"teacher_disagreement_score":0.91620886,"about_ca_system_score_codex":0.000024866355,"about_ca_system_score_gemma":0.00011488776,"threshold_uncertainty_score":0.24597605},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19771564,0.04347295,0.12849687,0.42004484,0.013047956,0.001472316,0.000029884543,0.0023380755,0.19338146],"genre_scores_gemma":[0.93583596,0.0033911197,0.016046248,0.007336869,0.0034403163,0.000014145108,0.000018361405,0.00006770706,0.033849254],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986848,0.000072274,0.00014066367,0.00047994117,0.00021567395,0.00040659576],"domain_scores_gemma":[0.9991514,0.00006105155,0.00008309905,0.00037349242,0.00004583401,0.00028514283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012616333,0.00018092552,0.00024034556,0.00008785648,0.00020274559,0.00004020167,0.0010109514,0.000108484346,0.000078738776],"category_scores_gemma":[0.000046912748,0.00018901651,0.000106060535,0.00075284304,0.000033576245,0.00046139094,0.0007166254,0.00021141995,0.0005361932],"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.00010747078,0.00012694891,0.0018494758,0.000046941972,0.00005691691,0.0077998736,0.009363594,0.00031877615,0.00064690167,0.22191696,0.7432822,0.014483963],"study_design_scores_gemma":[0.001038085,0.00011777395,0.0008166498,0.000011198494,0.000012508286,0.00010236803,0.00012533356,0.018185262,0.00033498864,0.002036782,0.97695017,0.00026889957],"about_ca_topic_score_codex":0.0007432071,"about_ca_topic_score_gemma":0.0066286526,"teacher_disagreement_score":0.7381203,"about_ca_system_score_codex":0.0015050552,"about_ca_system_score_gemma":0.000059949703,"threshold_uncertainty_score":0.770787},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4300418,0.0008761049,0.5648608,0.000051498253,0.0005786489,0.0012052688,0.0000090253825,0.00010462977,0.0022722534],"genre_scores_gemma":[0.9942533,0.000094490424,0.004965886,0.000039381994,0.00005767642,0.000055960078,0.000014094731,0.000015070862,0.0005041866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982525,0.00021500232,0.00033081076,0.0005484571,0.00038121542,0.00027197687],"domain_scores_gemma":[0.9988298,0.000049486647,0.00035319917,0.000379319,0.00021865837,0.00016955359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045337563,0.00022634139,0.00029933284,0.00010041852,0.00025055438,0.0001504921,0.00026961963,0.00010118529,0.000003756439],"category_scores_gemma":[0.00004767858,0.00016420803,0.000035006036,0.00018993713,0.00011024568,0.00039841977,0.00015775493,0.00008361433,0.000013904148],"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.00061789225,0.0046031713,0.20809653,0.0020374248,0.0014582693,0.0001003271,0.08109641,0.0007092004,0.01494788,0.2482328,0.004609274,0.4334908],"study_design_scores_gemma":[0.0031144326,0.0007811298,0.28330937,0.00042981456,0.000056611494,0.000028779574,0.00038062088,0.7053881,0.00088853977,0.00010968083,0.00507032,0.00044255482],"about_ca_topic_score_codex":0.00022659825,"about_ca_topic_score_gemma":0.000032903277,"teacher_disagreement_score":0.70467895,"about_ca_system_score_codex":0.00004460428,"about_ca_system_score_gemma":0.000034427976,"threshold_uncertainty_score":0.6696209},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047687306,0.000110109584,0.9172636,0.0039900676,0.00016586832,0.00029530915,0.0000030804028,0.00026933034,0.073133886],"genre_scores_gemma":[0.9729585,0.0000036361632,0.02249091,0.0026607914,0.0000973633,0.00003508372,0.0000025068662,0.0000058937694,0.0017453142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991204,0.000032358774,0.00015921528,0.00031488668,0.00011736726,0.00025574633],"domain_scores_gemma":[0.99945384,0.0000784971,0.000037408736,0.0002307943,0.000068621805,0.0001308307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010451353,0.00011998414,0.00016012472,0.000019731657,0.00009866792,0.00014792658,0.00046132866,0.000047533988,0.00009442162],"category_scores_gemma":[0.000039533126,0.00008696924,0.0000919508,0.00010892438,0.000042071493,0.00021388999,0.00018454499,0.00006382902,0.0001128429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050909016,0.0000596162,0.0001203833,0.000024962435,0.00001603923,0.0000018980784,0.0008070567,0.00017047029,0.00014836532,0.99046546,0.005137735,0.0030428935],"study_design_scores_gemma":[0.0014756169,0.0013297294,0.0021571685,0.000009926448,0.000013081446,0.000008333871,0.001427825,0.40129408,0.0028363776,0.58204836,0.0068997727,0.00049975334],"about_ca_topic_score_codex":0.0000174998,"about_ca_topic_score_gemma":0.00001453047,"teacher_disagreement_score":0.9681898,"about_ca_system_score_codex":0.000030350042,"about_ca_system_score_gemma":0.00006904367,"threshold_uncertainty_score":0.35465026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6179232,0.0003275976,0.23659134,0.123301625,0.002329052,0.0021818941,0.000110039815,0.0013948086,0.015840422],"genre_scores_gemma":[0.96304893,0.000055036377,0.019013043,0.008491462,0.0059797494,0.00017139966,0.000024411665,0.000054049255,0.0031619181],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946295,0.0009463602,0.0002869904,0.0010397042,0.0019450847,0.0011523636],"domain_scores_gemma":[0.9961752,0.0007866516,0.00010550052,0.0010005534,0.0009609041,0.0009711781],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003965424,0.00026631216,0.0003227124,0.00005679264,0.001025603,0.0009815581,0.0031446123,0.00016416187,0.000071069335],"category_scores_gemma":[0.0029804055,0.00020304833,0.00021447653,0.0017594841,0.00009628821,0.0007038251,0.0018164765,0.0011943098,0.0013566702],"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.00006788164,0.00009477488,0.0037469016,0.000011242845,0.00019026622,0.00002496705,0.221725,0.0003709173,0.0019301003,0.02173515,0.74614114,0.003961654],"study_design_scores_gemma":[0.0025683877,0.003331347,0.0465893,0.00025906382,0.00006715854,0.000009561461,0.0131394835,0.54357153,0.0136533985,0.012999442,0.36181656,0.0019947835],"about_ca_topic_score_codex":0.0022394727,"about_ca_topic_score_gemma":0.00011075418,"teacher_disagreement_score":0.5432006,"about_ca_system_score_codex":0.0007218393,"about_ca_system_score_gemma":0.0003825115,"threshold_uncertainty_score":0.9994209},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07135646,0.006963329,0.90163285,0.01057891,0.00034066435,0.0017604766,0.0000024256985,0.00013663099,0.007228283],"genre_scores_gemma":[0.9944177,0.00010354873,0.0048023756,0.00024991046,0.00019161367,0.000039724513,0.0000010860078,0.000012531108,0.00018151071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742013,0.00017326472,0.00037161369,0.00030537482,0.00022511289,0.0015044822],"domain_scores_gemma":[0.9990644,0.00015396332,0.00030118605,0.00020211347,0.00017612401,0.000102232894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016554315,0.0001766375,0.00029680395,0.00004544466,0.00021043967,0.00017081382,0.0010497371,0.00007534735,0.0000025280488],"category_scores_gemma":[0.0003477645,0.00011568303,0.0001647659,0.00037049336,0.00012829097,0.0004017411,0.000117741685,0.0010656584,0.000004462878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007792171,0.000070866285,0.00041195593,0.000010277279,0.000051698804,0.000006802865,0.0022997668,0.000029795772,0.00034312514,0.98238015,0.000056390636,0.014261265],"study_design_scores_gemma":[0.0118667,0.009012044,0.0015028267,0.00032198167,0.0001606932,0.0013350656,0.00637717,0.058683123,0.012090254,0.82370484,0.073479965,0.0014653421],"about_ca_topic_score_codex":0.00004332597,"about_ca_topic_score_gemma":0.0007573929,"teacher_disagreement_score":0.92306125,"about_ca_system_score_codex":0.00022023896,"about_ca_system_score_gemma":0.0013031716,"threshold_uncertainty_score":0.4717417},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004984804,0.000029429206,0.8364214,0.0025650419,0.000034081426,0.000087413064,7.654111e-7,0.0002625424,0.15561455],"genre_scores_gemma":[0.7285227,0.0000011393498,0.26695058,0.0023299227,0.000058253987,0.000005014535,0.000006098217,0.000007704182,0.0021185514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922574,0.000038036007,0.0001049364,0.00028774646,0.00019253064,0.00015099726],"domain_scores_gemma":[0.9994759,0.00011740168,0.000046556903,0.00012327103,0.000119330034,0.00011754067],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000070073576,0.00010047526,0.00012600195,0.00002483502,0.00008469677,0.00013856862,0.00043193958,0.000024143272,0.00013688818],"category_scores_gemma":[0.00003329093,0.00006965678,0.000031923482,0.0003267187,0.0000458289,0.00033203777,0.00010175126,0.00006500909,0.001330096],"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.00001748057,0.000039976807,0.00027245015,0.000006191417,0.000027914311,0.000019652027,0.0030155808,0.0002441284,0.00013991687,0.98997295,0.004494354,0.0017494257],"study_design_scores_gemma":[0.0010218653,0.0009771361,0.010335421,0.000011117274,0.000009489672,0.000022948627,0.00017687611,0.9673408,0.00038991548,0.012895115,0.0064396067,0.00037965394],"about_ca_topic_score_codex":0.000009734088,"about_ca_topic_score_gemma":0.0000072828307,"teacher_disagreement_score":0.97707784,"about_ca_system_score_codex":0.000015118604,"about_ca_system_score_gemma":0.000089599496,"threshold_uncertainty_score":0.99944746},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011927662,0.000092745264,0.5815126,0.006139693,0.00028522007,0.000091351685,0.0000012423299,0.0005709352,0.39937857],"genre_scores_gemma":[0.98484176,0.0000091694255,0.012060861,0.0021798734,0.00014994355,0.0000037802613,0.000003990471,0.0000031821307,0.00074741244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999519,0.00002201475,0.00007920292,0.0001918135,0.000072379895,0.00011562269],"domain_scores_gemma":[0.9997055,0.00003072105,0.000022856564,0.00011951294,0.00002723269,0.000094193696],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000057763453,0.000054171232,0.000064449254,0.000014225042,0.00004192189,0.0000616324,0.00031375108,0.00002827212,0.00012215355],"category_scores_gemma":[0.000041443527,0.000042829888,0.00002966951,0.00014086101,0.000009928535,0.00017038028,0.00008985538,0.000054549346,0.0019837187],"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.000018355122,0.00010507383,0.0034061326,0.00007345868,0.00003190728,0.00008583973,0.007905514,0.00000644795,0.00419136,0.39099327,0.09426994,0.4989127],"study_design_scores_gemma":[0.0040483004,0.0017979186,0.012445999,0.00013346547,0.000042975968,0.00030103786,0.00072037126,0.36164093,0.07505257,0.25850376,0.2826656,0.0026470658],"about_ca_topic_score_codex":0.0000068598015,"about_ca_topic_score_gemma":0.000004245029,"teacher_disagreement_score":0.9729141,"about_ca_system_score_codex":0.000008637146,"about_ca_system_score_gemma":0.000020298266,"threshold_uncertainty_score":0.99879336},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00468548,0.00018941947,0.8636086,0.0068273456,0.00022444317,0.00023887321,0.0000024979684,0.00030292233,0.12392041],"genre_scores_gemma":[0.9727163,0.000005795835,0.023607753,0.0015552423,0.00033751092,0.000019080642,0.0000047745675,0.000005584536,0.0017479853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931157,0.0000164118,0.00011911139,0.0002657949,0.000107142725,0.00017999319],"domain_scores_gemma":[0.9995161,0.000047857586,0.000041066323,0.00020720618,0.000067379726,0.00012035338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109766435,0.00008177638,0.00011213428,0.00001869412,0.000054896573,0.00015968941,0.0004547223,0.00003858804,0.00004495311],"category_scores_gemma":[0.00013558495,0.000064412845,0.0000625239,0.00013744924,0.000013812466,0.00028573332,0.0000673318,0.000054291533,0.00016864004],"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.000014557734,0.00005594469,0.00006802748,0.000018942397,0.000013221775,0.000012746573,0.0042587942,0.000003836826,0.00588556,0.8845108,0.020251455,0.08490612],"study_design_scores_gemma":[0.0027788316,0.0006953751,0.010788693,0.000021658725,0.000027654605,0.000031826534,0.00095766305,0.19703543,0.102307975,0.0043130927,0.6801799,0.00086192484],"about_ca_topic_score_codex":0.000023175044,"about_ca_topic_score_gemma":0.000012449231,"teacher_disagreement_score":0.9680308,"about_ca_system_score_codex":0.000016282918,"about_ca_system_score_gemma":0.000061009334,"threshold_uncertainty_score":0.26266795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018437278,0.00044087574,0.94395715,0.0008634406,0.00072144705,0.0005533235,0.0000024116143,0.0003836627,0.053059276],"genre_scores_gemma":[0.17314796,0.00003212413,0.8153302,0.005621408,0.00079819263,0.00003754033,0.000007340481,0.00009079832,0.0049344325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950663,0.000056408997,0.000503577,0.002442839,0.0010537812,0.0008771314],"domain_scores_gemma":[0.99766064,0.00022511509,0.0002466537,0.0012824988,0.00021094528,0.00037414595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006836404,0.00072432996,0.0006878126,0.00066279125,0.00039045722,0.0006716063,0.0046849656,0.00038502892,0.000013236944],"category_scores_gemma":[0.00017392065,0.0006461131,0.00021000727,0.0008493513,0.00036921425,0.00051040435,0.0031577896,0.0012714934,0.00022245258],"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.000019511786,0.000073741205,0.00002560294,0.00008627568,0.000021517373,0.00010959803,0.014319007,0.56710744,0.000145048,0.038940977,0.00025317742,0.37889808],"study_design_scores_gemma":[0.00020589004,0.0005416857,0.000026652186,0.00019453917,0.000008988862,0.000051730116,7.2916237e-7,0.95740324,0.00022423829,0.03743654,0.003104914,0.0008008739],"about_ca_topic_score_codex":0.0000109741395,"about_ca_topic_score_gemma":0.000008863439,"teacher_disagreement_score":0.39029574,"about_ca_system_score_codex":0.00028446835,"about_ca_system_score_gemma":0.0006200223,"threshold_uncertainty_score":0.99959904},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002989725,0.00037312077,0.98433924,0.0018379589,0.000055420627,0.00043651435,0.0000014721472,0.00024654093,0.012410759],"genre_scores_gemma":[0.53669995,0.000117832315,0.45420825,0.0052544735,0.0007292451,0.00029105708,0.000011783071,0.0000185766,0.0026688345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992358,0.00001383173,0.00014929703,0.0003306815,0.000097591466,0.00017279814],"domain_scores_gemma":[0.99939615,0.00008308079,0.00004346759,0.0002888235,0.00009293178,0.00009557505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012143284,0.00008305154,0.000104515464,0.000022204662,0.00016236685,0.00012790259,0.0005982897,0.00003709652,0.000033394885],"category_scores_gemma":[0.00008528793,0.00006641313,0.00006772451,0.0002763202,0.000013708593,0.00022933885,0.00023295735,0.00005268623,0.00022990382],"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.0000023271052,0.000043385582,0.0002650788,0.000060785766,0.000007458512,7.3178023e-7,0.0014568303,0.0000119561855,0.0018155687,0.77922535,0.017942604,0.19916792],"study_design_scores_gemma":[0.0005008119,0.00022318425,0.00050601223,0.000025391042,0.000012050216,0.0000049901378,0.00010113343,0.24098139,0.0031371776,0.010660987,0.74344933,0.00039751775],"about_ca_topic_score_codex":0.000003110218,"about_ca_topic_score_gemma":0.000002695683,"teacher_disagreement_score":0.76856434,"about_ca_system_score_codex":0.000015672322,"about_ca_system_score_gemma":0.000043208925,"threshold_uncertainty_score":0.2955025},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.940657,0.0061551854,0.027639953,0.008018336,0.004091668,0.009950764,0.000026467536,0.001707173,0.0017534315],"genre_scores_gemma":[0.65592897,0.000036264097,0.34191075,0.000098141776,0.00061430817,0.00084119535,0.000029383264,0.00005653393,0.0004844305],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99708015,0.00002864551,0.0005760391,0.0010952053,0.0005933607,0.0006265884],"domain_scores_gemma":[0.99640435,0.00017479621,0.00086385047,0.0013816779,0.0010679258,0.000107373206],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009558128,0.0004929123,0.0005971485,0.00013975425,0.00030414714,0.0013031975,0.0049994984,0.00036908864,0.0000026747284],"category_scores_gemma":[0.0054721227,0.00035975716,0.00048039993,0.00041406738,0.00014552283,0.00025824446,0.004900789,0.00060633355,0.0000024471037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004969803,0.0015399685,0.0040763738,0.009591979,0.00055065966,0.000013041793,0.023239011,0.0002643609,0.00845762,0.14673232,0.003516231,0.80196875],"study_design_scores_gemma":[0.0070353784,0.0054652267,0.004999548,0.018862685,0.002943536,0.0004591379,0.015090994,0.14195584,0.5399565,0.15432037,0.097621545,0.011289234],"about_ca_topic_score_codex":0.000026020725,"about_ca_topic_score_gemma":0.000018305778,"teacher_disagreement_score":0.7906795,"about_ca_system_score_codex":0.00013428491,"about_ca_system_score_gemma":0.00020195215,"threshold_uncertainty_score":0.99988544},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001554012,0.0006017803,0.12854074,0.00019580455,0.0005538816,0.00034766106,0.000006286539,0.00028521495,0.8694531],"genre_scores_gemma":[0.092034385,0.0005155258,0.036110625,0.0015118725,0.0007319321,0.000025558387,0.000018361206,0.00010229075,0.8689495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978735,0.000029614594,0.0004171768,0.0010202598,0.0003045716,0.0003548834],"domain_scores_gemma":[0.99863946,0.000096897136,0.00021152868,0.0007014435,0.0000979082,0.0002527394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000205073,0.00050075754,0.0005300682,0.000118231284,0.00022282125,0.00035195792,0.0007734046,0.0003344066,0.0004895345],"category_scores_gemma":[0.000028487733,0.00042390145,0.00016897486,0.00006281536,0.000057235742,0.0002996951,0.0012570169,0.0004119539,0.0005202237],"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.000013611717,0.000015228253,0.000013311026,0.000060074693,0.000075701406,0.0015007374,0.00073836034,5.988207e-7,0.00000252696,0.9342535,0.0032285412,0.060097806],"study_design_scores_gemma":[0.001016496,0.00035397892,0.00003787464,0.00027544727,0.00009545101,0.0022122117,0.00004897804,0.0058118883,0.000086313965,0.13994978,0.8487201,0.0013914949],"about_ca_topic_score_codex":0.000028796649,"about_ca_topic_score_gemma":0.00011176832,"teacher_disagreement_score":0.8454915,"about_ca_system_score_codex":0.000115742754,"about_ca_system_score_gemma":0.00012018511,"threshold_uncertainty_score":0.9998213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015126269,0.00008343684,0.91016924,0.0068182126,0.00012467796,0.000134689,4.4672674e-7,0.00010903236,0.067434005],"genre_scores_gemma":[0.99110633,0.000006752781,0.005592734,0.002912033,0.00012361858,0.000009927673,0.0000033935642,0.0000037031398,0.00024151434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992131,0.00006920805,0.00011632969,0.00021112661,0.00016327763,0.00022693297],"domain_scores_gemma":[0.99962944,0.00006449817,0.000032397787,0.00020300937,0.000024183202,0.00004644804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036203652,0.00007860891,0.00008199726,0.00004994919,0.00010130731,0.000123145,0.00063316914,0.00003724737,0.000012763195],"category_scores_gemma":[0.000050158218,0.00005066774,0.00003660833,0.0006288723,0.000016876375,0.0001852316,0.00016289823,0.000102510494,0.00011076176],"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.0000011689463,0.000023660838,0.0005589333,0.0000065141417,0.000002626152,0.000015897127,0.028272824,0.00005357673,0.000037754493,0.95438904,0.0003331032,0.016304923],"study_design_scores_gemma":[0.00032383227,0.00006503116,0.0033371295,0.000010935115,0.000002183514,0.000008758599,0.0021935096,0.9833937,0.00013029393,0.00804003,0.002327937,0.00016665286],"about_ca_topic_score_codex":0.000028682542,"about_ca_topic_score_gemma":0.00028464696,"teacher_disagreement_score":0.98334014,"about_ca_system_score_codex":0.000059293878,"about_ca_system_score_gemma":0.00002794465,"threshold_uncertainty_score":0.20661704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023939628,0.00011446657,0.74709135,0.010963355,0.00019684847,0.00019408161,0.0000016097727,0.0003826337,0.23866169],"genre_scores_gemma":[0.9473349,0.0000060644475,0.04470752,0.0062920228,0.00006583194,0.000007838145,0.0000019961824,0.000007841755,0.001575978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894166,0.000040879157,0.00018930105,0.00036463357,0.00022319218,0.00024034003],"domain_scores_gemma":[0.9991093,0.00014542237,0.00007047618,0.0004020844,0.00012450767,0.00014819222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115875744,0.0001387204,0.00019486643,0.000081569786,0.0000825866,0.000061522376,0.000716972,0.00006263133,0.00030576508],"category_scores_gemma":[0.00017071883,0.00010134489,0.00008361032,0.0009880366,0.00003822534,0.00012296859,0.00016704941,0.000109971865,0.0002532343],"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.00016306744,0.0016759214,0.015918337,0.00027577364,0.00007855024,0.00010669946,0.0052927933,0.0109105,0.001116251,0.8818995,0.056519873,0.026042769],"study_design_scores_gemma":[0.0007711978,0.00078578887,0.004182416,0.000031885156,0.000006565898,0.0000014099247,0.000016467746,0.9809681,0.0024690977,0.001812945,0.00872085,0.00023326649],"about_ca_topic_score_codex":0.00002298724,"about_ca_topic_score_gemma":0.00003202075,"teacher_disagreement_score":0.9700576,"about_ca_system_score_codex":0.000016251988,"about_ca_system_score_gemma":0.000083063016,"threshold_uncertainty_score":0.4132725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035221197,0.00003955541,0.79603666,0.00081863394,0.00006853855,0.00020861643,5.535771e-7,0.00037035643,0.19893499],"genre_scores_gemma":[0.8496954,0.0000013475128,0.14699675,0.0027404265,0.000050552826,0.000037731883,0.0000016014445,0.0000061603346,0.00047006898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986319,0.000055222263,0.00016910216,0.0005549956,0.00023772458,0.00035105692],"domain_scores_gemma":[0.9989246,0.00007993059,0.0000381841,0.0004474797,0.00010661993,0.00040314806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011935186,0.00016519119,0.00018998874,0.00006290899,0.0000879877,0.00023155073,0.0012681519,0.00005930063,0.00004853693],"category_scores_gemma":[0.00024493303,0.00012800834,0.00006555118,0.00077359664,0.000023848286,0.00023635008,0.00031620238,0.00012295957,0.0007700092],"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.000031233463,0.00044957828,0.0144653665,0.00012894713,0.000027097782,0.000010805141,0.005576963,0.0020482216,0.00083347474,0.93191296,0.012426527,0.032088805],"study_design_scores_gemma":[0.0012184529,0.00072226615,0.010320876,0.000039167535,0.000018143379,0.000005979294,0.000105398685,0.95387167,0.006787013,0.0056237592,0.020345345,0.0009419419],"about_ca_topic_score_codex":0.000030508538,"about_ca_topic_score_gemma":0.000014526733,"teacher_disagreement_score":0.9518234,"about_ca_system_score_codex":0.000025993255,"about_ca_system_score_gemma":0.00021796765,"threshold_uncertainty_score":0.9897167},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057182487,0.0000328441,0.7590215,0.01419242,0.00018334178,0.00034041752,0.0000022440493,0.00020130488,0.16884343],"genre_scores_gemma":[0.99407196,0.0000038714497,0.0022228223,0.0034455734,0.000060433893,0.000016473301,0.000006250413,0.0000030527608,0.0001695475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999148,0.00009626574,0.00016154049,0.00022755464,0.00018871643,0.00017792173],"domain_scores_gemma":[0.99943537,0.000158727,0.00004429196,0.00022881321,0.000051355433,0.00008147423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015874274,0.00008717907,0.00009285126,0.00005140077,0.00017276064,0.0001645631,0.0005082206,0.000039832994,0.00033911937],"category_scores_gemma":[0.00016996043,0.000060930284,0.000050367245,0.0006283973,0.000088675784,0.00029831292,0.00007555197,0.00013109457,0.0005062785],"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.0000015715588,0.00008057209,0.0016952163,0.00000523698,0.000010505305,0.000012500124,0.009324936,0.00007571584,0.0009799281,0.97135025,0.0070760213,0.009387559],"study_design_scores_gemma":[0.0014276912,0.00021465358,0.31960514,0.000021725493,0.000024583082,0.00009229715,0.0023852238,0.62267643,0.0005643872,0.034450993,0.018040435,0.00049644103],"about_ca_topic_score_codex":0.00011145793,"about_ca_topic_score_gemma":0.00032013512,"teacher_disagreement_score":0.93689924,"about_ca_system_score_codex":0.00003563663,"about_ca_system_score_gemma":0.000103730454,"threshold_uncertainty_score":0.65073544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015008769,0.0006344104,0.93922895,0.0011039001,0.00028081023,0.00063344324,0.0000031656698,0.000042765674,0.05805753],"genre_scores_gemma":[0.93459547,0.0024003908,0.04474449,0.0017639594,0.0020613456,0.0012667131,0.00017683633,0.00008409334,0.012906689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867123,0.00002698243,0.0004450886,0.00047905347,0.00019086422,0.00018679176],"domain_scores_gemma":[0.9992976,0.00008003802,0.00018191148,0.00033771215,0.000048160633,0.000054588196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033524435,0.00018612285,0.0002019218,0.00016138914,0.00017876677,0.00014672073,0.0005557556,0.00017027101,0.000008188607],"category_scores_gemma":[0.00002541118,0.00016100543,0.000066076755,0.00020193894,0.00008906846,0.00017522016,0.00008717497,0.00040812232,0.00009753771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023886807,0.000026760625,0.000022891247,0.000011425594,0.000005086994,0.00000389385,0.0013625948,0.00011635432,0.000017873645,0.5622939,0.0005041153,0.4356327],"study_design_scores_gemma":[0.000023689483,0.000038582395,0.00011220725,0.000048319238,0.000018243372,0.0000067729807,0.0006436355,0.09032655,0.00032767936,0.83077127,0.07736565,0.00031737104],"about_ca_topic_score_codex":0.00003589839,"about_ca_topic_score_gemma":0.00017784908,"teacher_disagreement_score":0.93458045,"about_ca_system_score_codex":0.00008724676,"about_ca_system_score_gemma":0.00004948737,"threshold_uncertainty_score":0.6565611},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78027576,0.0012409724,0.040816046,0.00044133564,0.00040310592,0.0011078825,0.000006307129,0.00021321006,0.17549537],"genre_scores_gemma":[0.9927029,0.00007010303,0.0062336875,0.000022678783,0.00010210616,0.000063677355,0.000012451176,0.000011399842,0.0007809943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986369,0.000083566425,0.0003141134,0.00053833576,0.0001603843,0.00026670273],"domain_scores_gemma":[0.9987052,0.0003523999,0.0001978206,0.00042885906,0.00020951843,0.00010622268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030267896,0.00018572147,0.0002690935,0.00037078088,0.00016068698,0.00007581458,0.00033380406,0.00011941601,0.000012536321],"category_scores_gemma":[0.00026781106,0.00014628487,0.00004784373,0.0008760549,0.00021117888,0.00027500512,0.00015579585,0.00024344011,0.00001825008],"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.0004081856,0.0019913719,0.3587583,0.00016921981,0.00009671326,0.00003547318,0.01767412,0.0005593723,0.002855147,0.5560791,0.00054210273,0.060830932],"study_design_scores_gemma":[0.00216722,0.00036006086,0.96299565,0.0003418403,0.00001572077,0.0000341913,0.000820681,0.02235898,0.005118278,0.0013103163,0.0040851664,0.00039189425],"about_ca_topic_score_codex":0.00009056809,"about_ca_topic_score_gemma":0.0011388654,"teacher_disagreement_score":0.6042374,"about_ca_system_score_codex":0.00007334694,"about_ca_system_score_gemma":0.00013169432,"threshold_uncertainty_score":0.5965324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03629418,0.00007705154,0.95956755,0.0011885999,0.00048466958,0.00018003433,6.7954085e-7,0.0004118778,0.0017953462],"genre_scores_gemma":[0.9215685,0.0000018082484,0.07636201,0.00076356006,0.0011281797,0.0000048770225,0.00008275923,0.000010438331,0.00007786145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866325,0.00015017264,0.0002746794,0.0005052238,0.00018890091,0.00021779214],"domain_scores_gemma":[0.99935406,0.00008590016,0.00013485829,0.00015208389,0.00010269855,0.00017038078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010640698,0.00016285713,0.00017317508,0.000039377483,0.0003374018,0.00041346424,0.00032262996,0.00006659555,0.000019891737],"category_scores_gemma":[0.00012522681,0.00015686282,0.00008476679,0.0003191882,0.000023851664,0.00030874976,0.000104744126,0.0002185724,0.00009654288],"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.000012745245,0.00007400655,0.00087665557,0.000013323117,0.000042737873,0.000017930714,0.04793704,0.037760567,0.009791718,0.022160996,0.0006018791,0.8807104],"study_design_scores_gemma":[0.0003192047,0.00033288132,0.00042674204,0.000020072395,0.000014204823,0.0000029879968,0.00014943077,0.9960718,0.0007370039,0.0010984724,0.0006408462,0.00018636351],"about_ca_topic_score_codex":0.000022346463,"about_ca_topic_score_gemma":0.000021879325,"teacher_disagreement_score":0.9583112,"about_ca_system_score_codex":0.0000412515,"about_ca_system_score_gemma":0.00010348626,"threshold_uncertainty_score":0.63966805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009228797,0.0018466413,0.88121694,0.0006082702,0.00030340892,0.00036689546,0.0000324022,0.00003653572,0.11557965],"genre_scores_gemma":[0.76978344,0.014949699,0.119735956,0.0014097387,0.002383843,0.0004757409,0.00034664304,0.00009517687,0.090819776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899,0.0000122685615,0.00043814382,0.00024718087,0.00017569558,0.00013669817],"domain_scores_gemma":[0.99926776,0.00010288075,0.00020030912,0.00028173727,0.0000917615,0.00005554589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008774623,0.00015353148,0.00021554252,0.0000830116,0.00020509846,0.000101321624,0.00070672104,0.00015813709,0.000024631143],"category_scores_gemma":[0.00002896008,0.00011217688,0.00006651383,0.000104111845,0.00042051382,0.00012563982,0.00019963905,0.0002716375,0.000024326546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003117619,0.0000053922045,0.000021169193,0.000010949566,0.000010026263,3.303186e-7,0.00029936025,0.000028456423,0.000006442597,0.86788946,0.0010957305,0.13062954],"study_design_scores_gemma":[0.000007987879,0.000022024149,0.000014041593,0.000013767134,0.000007196058,0.000001852763,0.00015404327,0.0051637767,0.00037720232,0.85092986,0.14319137,0.00011688377],"about_ca_topic_score_codex":0.0000036125816,"about_ca_topic_score_gemma":0.00002841229,"teacher_disagreement_score":0.7697742,"about_ca_system_score_codex":0.000023402186,"about_ca_system_score_gemma":0.00007760761,"threshold_uncertainty_score":0.45744404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019033155,0.000008951504,0.9869043,0.0021640835,0.00006900422,0.0002191624,0.00000699858,0.000056412668,0.008667725],"genre_scores_gemma":[0.8072133,8.562932e-7,0.19129363,0.0013175982,0.000026350277,0.0000134259735,0.00001975219,0.000005394926,0.00010971713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991486,0.000022373504,0.00017208995,0.00033172895,0.00017201631,0.00015316562],"domain_scores_gemma":[0.998713,0.0005298814,0.00005404416,0.000608319,0.000044071938,0.00005064037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030604072,0.00009316241,0.00010637178,0.000020595915,0.00011277853,0.00008287399,0.0014117877,0.000026035039,0.000016170572],"category_scores_gemma":[0.00010255488,0.000054685373,0.000030482135,0.00013181636,0.000013838378,0.00014607399,0.00026490205,0.00006100742,0.0000371151],"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.000086794505,0.00038973495,0.000049583334,0.000120555145,0.0000578978,0.0000024326996,0.006545707,0.09640868,0.0004676824,0.7300164,0.009348726,0.15650582],"study_design_scores_gemma":[0.00018043775,0.00009352394,0.000034279627,0.000020961643,0.0000018930016,7.647903e-8,0.0000260337,0.9945588,0.0011026438,0.00089942565,0.002998835,0.00008308154],"about_ca_topic_score_codex":0.0000012745015,"about_ca_topic_score_gemma":0.000007781429,"teacher_disagreement_score":0.89815015,"about_ca_system_score_codex":0.000018964553,"about_ca_system_score_gemma":0.00011558757,"threshold_uncertainty_score":0.2623476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07511313,0.00010600279,0.90232325,0.0017928319,0.00019315106,0.0009592447,0.00008484849,0.00016740408,0.019260144],"genre_scores_gemma":[0.5982031,0.0009829844,0.3844038,0.000036944653,0.00019053524,0.0000016449542,0.00029621928,0.000034033448,0.015850741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710536,0.00044942147,0.000154815,0.000814773,0.0006440707,0.00083153264],"domain_scores_gemma":[0.9969745,0.00049200305,0.000148287,0.00076863356,0.0012769379,0.00033959994],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008678467,0.0002113383,0.00035925713,0.00048498358,0.0013625337,0.00013465162,0.0018031651,0.00013584433,0.000051359973],"category_scores_gemma":[0.00033245754,0.00026799267,0.00028381555,0.0011848797,0.0005681272,0.0008765479,0.001632918,0.00043430223,0.000010632824],"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.0003500582,0.0010479161,0.003681209,0.0006269701,0.00031493968,0.0010286953,0.009594478,0.0004090509,0.004325456,0.8652173,0.008404253,0.10499966],"study_design_scores_gemma":[0.0026659402,0.0009896604,0.0025527463,0.0001232589,0.000079652855,0.00005328854,0.006871161,0.18206392,0.0006804093,0.017514525,0.7857768,0.00062865217],"about_ca_topic_score_codex":0.000112470276,"about_ca_topic_score_gemma":0.001277558,"teacher_disagreement_score":0.8477028,"about_ca_system_score_codex":0.00026677712,"about_ca_system_score_gemma":0.00088961056,"threshold_uncertainty_score":0.99997723},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006339967,0.012300921,0.012293118,0.000031594234,0.00038581144,0.00031409544,0.000002808727,0.00017074688,0.9744375],"genre_scores_gemma":[0.11373435,0.0001505319,0.00058280595,0.000060197846,0.0006204159,0.000019810572,0.000003283903,0.000041271436,0.8847873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988474,0.00007278318,0.00021303297,0.0003610227,0.00016484004,0.00034091898],"domain_scores_gemma":[0.99864465,0.00017573054,0.00016890887,0.0008077191,0.00007809576,0.00012492051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004306721,0.00029744263,0.00027098617,0.000060376715,0.0002082486,0.00016869111,0.000855773,0.0002564836,0.000016914886],"category_scores_gemma":[0.000018800885,0.00020710414,0.00009496294,0.0000067319606,0.00014169456,0.00010154753,0.0006720302,0.00034661617,0.00008261323],"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.0000046435894,0.000008501124,0.000011726406,0.00007586381,0.00005374694,0.000005388762,0.0047843116,0.0000014290235,0.000030124933,0.9262172,0.001552065,0.06725501],"study_design_scores_gemma":[0.00036902228,0.0000665096,0.00035221124,0.00034022276,0.00023649249,0.000086403255,0.000006719177,0.0060584717,0.00045194977,0.14792822,0.8434142,0.00068960193],"about_ca_topic_score_codex":0.000041498966,"about_ca_topic_score_gemma":0.000055159435,"teacher_disagreement_score":0.84186214,"about_ca_system_score_codex":0.00004590119,"about_ca_system_score_gemma":0.00007182312,"threshold_uncertainty_score":0.8445462},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1725124,0.001030536,0.76719785,0.00012665309,0.00033292826,0.000315118,0.0000055135315,0.0002758186,0.058203176],"genre_scores_gemma":[0.88134044,0.00016902985,0.118211895,0.0001373963,0.00006257359,0.000023868824,0.00000410024,0.0000069575885,0.000043761946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990076,0.00011302367,0.00019317726,0.00031227592,0.00017408365,0.00019985178],"domain_scores_gemma":[0.99889237,0.0004651549,0.0001513304,0.00025980192,0.00012938294,0.000101968195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002830134,0.00013364051,0.00014811548,0.000052297113,0.00015056525,0.0001444899,0.00028942854,0.000063932705,0.00004980116],"category_scores_gemma":[0.0007053892,0.00012016382,0.000031611464,0.00017531868,0.00007278196,0.00091170275,0.00016347837,0.00012574097,0.00014324827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000807981,0.00046511958,0.010866158,0.00017178724,0.00020643964,0.00010575606,0.121948026,0.000003125706,0.002402385,0.62230176,0.0011411298,0.24030754],"study_design_scores_gemma":[0.000881751,0.00032405945,0.086929895,0.0011421215,0.00014771061,0.000054281252,0.0005821066,0.09326679,0.0140565,0.8015887,0.00032188342,0.0007041738],"about_ca_topic_score_codex":0.000093489856,"about_ca_topic_score_gemma":0.000029758852,"teacher_disagreement_score":0.70882803,"about_ca_system_score_codex":0.000019745901,"about_ca_system_score_gemma":0.000038161754,"threshold_uncertainty_score":0.49001384},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16332446,0.0027031072,0.63344157,0.008275857,0.0055831335,0.0005086427,0.0000021591472,0.0014159454,0.18474512],"genre_scores_gemma":[0.9516199,0.000044416316,0.044007648,0.00088699954,0.00033482784,0.000008242878,0.0000029341425,0.000012791784,0.0030822025],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988193,0.00008428409,0.00017666393,0.0003464186,0.00024776894,0.0003255961],"domain_scores_gemma":[0.9983247,0.00012307499,0.000080694605,0.0011112882,0.00012451268,0.00023573876],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029409802,0.00014443525,0.00017457429,0.000058675305,0.00009084067,0.0001481506,0.0015528854,0.00009884435,0.000016108334],"category_scores_gemma":[0.00072649,0.00010971225,0.00006162659,0.00030091344,0.00003747797,0.0004102502,0.0008515476,0.00013181569,0.0009643966],"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.000025125524,0.0004430294,0.08464901,0.000047448073,0.00005577632,0.00037962894,0.009862758,0.00009176569,0.0026308578,0.16988197,0.45516133,0.27677128],"study_design_scores_gemma":[0.002859524,0.00074335287,0.0102758445,0.0001037388,0.000046847144,0.00028555212,0.0007340852,0.02942294,0.010543386,0.21084897,0.732722,0.001413796],"about_ca_topic_score_codex":0.000049786657,"about_ca_topic_score_gemma":0.000059961072,"teacher_disagreement_score":0.78829545,"about_ca_system_score_codex":0.000044076784,"about_ca_system_score_gemma":0.00013849341,"threshold_uncertainty_score":0.9998135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2893284,0.32154882,0.03273282,0.00053334614,0.023494605,0.0028156547,0.00011835697,0.00040181595,0.3290262],"genre_scores_gemma":[0.96539116,0.024660066,0.0018007389,0.00072095945,0.0010765071,0.000051870535,0.000010030689,0.000108945365,0.0061797346],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99281883,0.0007669042,0.0019649921,0.0014970095,0.0015582655,0.0013939845],"domain_scores_gemma":[0.9932414,0.00044914638,0.0022382825,0.0020670386,0.0009150151,0.0010891136],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029944277,0.0009345458,0.0018036312,0.0014729525,0.00070978195,0.0045626024,0.015045326,0.00036742623,0.03192367],"category_scores_gemma":[0.0006179079,0.0008364673,0.0007458556,0.0025764098,0.0004357125,0.0061101196,0.0056555234,0.0010572715,0.0014008016],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003861611,0.0032121262,0.6457454,0.000421952,0.00257447,0.0009950028,0.007382613,0.000048278176,0.0063837958,0.0100824535,0.2316119,0.09115588],"study_design_scores_gemma":[0.002171875,0.00013883952,0.8017871,0.0017937414,0.0011161626,0.00009801902,0.00021635776,0.0035268546,0.025529534,0.053288907,0.107633844,0.0026988143],"about_ca_topic_score_codex":0.0017053876,"about_ca_topic_score_gemma":0.000091298054,"teacher_disagreement_score":0.67606276,"about_ca_system_score_codex":0.00031908468,"about_ca_system_score_gemma":0.00068627397,"threshold_uncertainty_score":0.9994086},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018330082,0.0008747275,0.8697655,0.0014823208,0.00024483047,0.00083200546,0.00000113122,0.00029060058,0.10817881],"genre_scores_gemma":[0.9737826,0.0000083244495,0.021300683,0.000043170345,0.00006649945,0.000046440917,0.000001974436,0.0000059402446,0.0047443556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900025,0.00005471871,0.00014424695,0.00031698972,0.0002502555,0.0002335489],"domain_scores_gemma":[0.9995082,0.00003865576,0.00003165381,0.00020987645,0.00011113667,0.000100460136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033437673,0.00009943985,0.00012227986,0.00005846874,0.00015244116,0.0002166562,0.0002685719,0.000057138488,0.0000101893365],"category_scores_gemma":[0.000016069607,0.00006942692,0.000026594096,0.00020870882,0.00006493607,0.00037419607,0.00016463402,0.00011501199,0.00007952601],"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.0000031501947,0.00009478908,0.00077414827,0.000061488856,0.000013473765,0.000009740734,0.0013071492,0.0006462478,0.0004029841,0.9955826,0.00020883275,0.00089540315],"study_design_scores_gemma":[0.015161194,0.0031511914,0.019682584,0.0010005891,0.00005251334,0.0029107234,0.00037838588,0.5358176,0.016500868,0.37729782,0.025174025,0.0028725127],"about_ca_topic_score_codex":0.00007477974,"about_ca_topic_score_gemma":0.0000116994215,"teacher_disagreement_score":0.9554525,"about_ca_system_score_codex":0.00005324887,"about_ca_system_score_gemma":0.00011980734,"threshold_uncertainty_score":0.28311476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4812424,0.0005594186,0.5157827,0.00007910444,0.00045722254,0.0009794137,0.000019034711,0.000042882384,0.0008377968],"genre_scores_gemma":[0.99641794,0.000009589997,0.0033498374,0.00001670468,0.000038963914,0.00010478588,0.000011998402,0.000010268743,0.00003991445],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975706,0.00018319998,0.00061679597,0.00044679682,0.0006953721,0.00048728622],"domain_scores_gemma":[0.98146397,0.00051684753,0.00015390401,0.00042441767,0.017319385,0.00012147564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069599797,0.00013050858,0.0003103792,0.0001960229,0.0001935125,0.00005780165,0.00085615803,0.00008811883,0.000012915561],"category_scores_gemma":[0.0019220992,0.00011527152,0.00009112954,0.0008373521,0.0001691072,0.00013362478,0.0002737945,0.000180299,0.000041431267],"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.0011291421,0.0010850491,0.01020744,0.004094194,0.00025820083,0.00005208551,0.12302484,0.0010039189,0.022292627,0.24668875,0.00013939808,0.59002435],"study_design_scores_gemma":[0.00021485581,0.00035809932,0.00022788235,0.00029002473,0.00000776413,0.000002069296,0.04636435,0.019756572,0.9307863,0.0014561556,0.0003772023,0.00015871265],"about_ca_topic_score_codex":0.000046225567,"about_ca_topic_score_gemma":0.000082891165,"teacher_disagreement_score":0.9084937,"about_ca_system_score_codex":0.00013767235,"about_ca_system_score_gemma":0.000895889,"threshold_uncertainty_score":0.47006363},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5854167,0.0006441212,0.4039052,0.000024395793,0.0021569154,0.0010317466,0.00008800637,0.00016374006,0.0065692114],"genre_scores_gemma":[0.9847893,0.00056253735,0.009388357,0.000098868644,0.00057610025,0.000014686043,0.00009016691,0.0000921218,0.0043878555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99296194,0.0007088129,0.001064881,0.003742395,0.0002678015,0.0012541763],"domain_scores_gemma":[0.99185985,0.0008055539,0.0011962384,0.0029466597,0.0023196486,0.00087204145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012610704,0.0011630454,0.0016369858,0.0005492022,0.0007313855,0.00066221255,0.004698374,0.00051403535,0.0003424522],"category_scores_gemma":[0.00074447814,0.0013493084,0.0011914542,0.0011408234,0.00051396294,0.001554927,0.0049384004,0.0009321459,0.00014080704],"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.00080463826,0.007980843,0.009568575,0.0058146776,0.001987257,0.0027078295,0.016533136,0.06053217,0.002815866,0.8716536,0.0009314524,0.018669939],"study_design_scores_gemma":[0.0028219835,0.00092494645,0.0003233807,0.0011383151,0.00042002686,0.00008299617,0.0018452269,0.95157284,0.025820779,0.0105859,0.0025575839,0.0019060399],"about_ca_topic_score_codex":0.00029938444,"about_ca_topic_score_gemma":0.00014917502,"teacher_disagreement_score":0.8910406,"about_ca_system_score_codex":0.0005186805,"about_ca_system_score_gemma":0.0025094284,"threshold_uncertainty_score":0.99889565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23855321,0.00019050964,0.7117201,0.0075109326,0.0017494849,0.0018202879,0.000026286985,0.00020690083,0.03822231],"genre_scores_gemma":[0.97880024,0.00006819311,0.020360159,0.00015786644,0.000092061186,0.000053096963,9.1517995e-7,0.000009379489,0.00045811108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982654,0.000017795035,0.00045788733,0.0006045485,0.00030189686,0.00035250338],"domain_scores_gemma":[0.9979211,0.00030987483,0.00025209217,0.00032489395,0.001078968,0.00011308588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008074746,0.00021595057,0.00035491094,0.00005812631,0.0002746634,0.00032717176,0.0010689921,0.00010251444,0.000031423413],"category_scores_gemma":[0.0011934153,0.00015569467,0.00015161363,0.00042998843,0.00028180247,0.00036897563,0.00047127734,0.00019780522,0.000023442775],"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.000075812575,0.00015217188,0.00056807516,0.000110555186,0.000020851108,6.365488e-7,0.0021199957,0.0000070897895,0.014994445,0.8174117,0.00018857468,0.16435006],"study_design_scores_gemma":[0.00014271976,0.00018831513,0.0005413156,0.00013318195,0.00001793494,0.000011225486,0.00048539293,0.15817249,0.4696881,0.3700325,0.00034199638,0.0002448498],"about_ca_topic_score_codex":0.000019883078,"about_ca_topic_score_gemma":0.000024966015,"teacher_disagreement_score":0.740247,"about_ca_system_score_codex":0.00003682199,"about_ca_system_score_gemma":0.0001778472,"threshold_uncertainty_score":0.63490444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43054652,0.00022702091,0.5480469,0.0006545143,0.0002814169,0.0003051201,0.000004709568,0.00009841746,0.019835375],"genre_scores_gemma":[0.98153204,0.000009929948,0.018042326,0.000080029175,0.00010153571,0.00003462489,0.0000020125865,0.00000897454,0.0001885022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984845,0.00013691525,0.00035984901,0.0004676489,0.00023338839,0.0003177064],"domain_scores_gemma":[0.99805456,0.00057086546,0.0001584639,0.00069770496,0.00044531847,0.000073069896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071064103,0.00014681494,0.00020877187,0.00001967139,0.00026238099,0.0002521809,0.0007101696,0.00006534479,0.000058523012],"category_scores_gemma":[0.00031975683,0.00009595983,0.000103831626,0.0005299093,0.0002548581,0.00021983116,0.000108796994,0.00015530852,0.000035353252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004091387,0.00017687697,0.0009217216,0.000027096534,0.000020793017,0.000009894709,0.0042319484,0.000082741404,0.00063474244,0.9788215,0.00001887431,0.015012903],"study_design_scores_gemma":[0.00009138335,0.00030773022,0.0012104787,0.0001413299,0.00004372843,0.00012578211,0.005156644,0.05483687,0.16655582,0.7673519,0.0037060152,0.00047229542],"about_ca_topic_score_codex":0.00013976615,"about_ca_topic_score_gemma":0.0009678811,"teacher_disagreement_score":0.5509855,"about_ca_system_score_codex":0.00003197601,"about_ca_system_score_gemma":0.00027247105,"threshold_uncertainty_score":0.39131287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012580918,0.00005997726,0.93306875,0.0038093296,0.0003093225,0.00016903866,0.000008239774,0.00007654441,0.04991785],"genre_scores_gemma":[0.7521146,0.0000040442696,0.24072169,0.0005802787,0.0000803165,0.000008230491,0.000041425716,0.0000039323636,0.006445508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990906,0.000040871695,0.00013950744,0.0002984497,0.00026632033,0.00016421752],"domain_scores_gemma":[0.99924296,0.000018950901,0.00005455981,0.00030394678,0.00032580827,0.000053770756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009018012,0.00008901082,0.0001283248,0.000026941076,0.00009872555,0.00013410627,0.00029831912,0.00003435717,0.00009643318],"category_scores_gemma":[0.000032024866,0.00007373999,0.000051521412,0.00030591054,0.000042851898,0.00043031533,0.00025085406,0.00004600332,0.00005929019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045572406,0.0002201084,0.0030263795,0.000023584258,0.000020021393,0.000006816855,0.00073343114,0.000032053988,0.008202524,0.980716,0.004978829,0.0020356996],"study_design_scores_gemma":[0.0021064451,0.00094361586,0.30354884,0.00016973932,0.000038384616,0.00012290836,0.00039544742,0.040902134,0.20031253,0.32888752,0.121357545,0.0012148981],"about_ca_topic_score_codex":0.000024170231,"about_ca_topic_score_gemma":0.000037012218,"teacher_disagreement_score":0.73953366,"about_ca_system_score_codex":0.00004324236,"about_ca_system_score_gemma":0.00008047085,"threshold_uncertainty_score":0.30070293},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08946986,0.0011615314,0.6855159,0.026638854,0.004572081,0.00068046636,0.00002890452,0.000519042,0.1914134],"genre_scores_gemma":[0.9753472,0.000026676544,0.0223711,0.00060520653,0.00013795713,0.00000641698,0.000002874126,0.0000073421247,0.0014951882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842584,0.0003307573,0.0003330797,0.00036674135,0.0003229324,0.00022063407],"domain_scores_gemma":[0.99847937,0.00011994988,0.00023606564,0.0007683556,0.00031811363,0.00007815968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044993483,0.00013440399,0.00025343618,0.000048919366,0.00013485823,0.00004208041,0.0010298918,0.00010795988,0.00037537882],"category_scores_gemma":[0.0002607411,0.00009265178,0.00017834379,0.00031184175,0.00019537486,0.000040338222,0.00038163245,0.00018833343,0.000045801105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062754756,0.0015152309,0.0023489418,0.00017292105,0.000116444986,0.00003349559,0.0007835462,0.0029913033,0.04751166,0.92435986,0.014059336,0.0060445024],"study_design_scores_gemma":[0.004104612,0.0037251646,0.15463156,0.00032754857,0.00019920334,0.0010285095,0.00041279985,0.07276444,0.101344615,0.36492395,0.294995,0.0015425613],"about_ca_topic_score_codex":0.00005001198,"about_ca_topic_score_gemma":0.000009530014,"teacher_disagreement_score":0.8858774,"about_ca_system_score_codex":0.000026734135,"about_ca_system_score_gemma":0.00008049546,"threshold_uncertainty_score":0.41101345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003933865,0.00067657616,0.75390023,0.0005398101,0.0013358027,0.00022370671,0.000008875797,0.00031995375,0.2390612],"genre_scores_gemma":[0.9224082,0.000022627457,0.041423194,0.0006600757,0.00027864877,0.000088656045,0.000028502835,0.000019904675,0.03507015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986224,0.00007352899,0.00019051941,0.00057806267,0.00013551892,0.0003999278],"domain_scores_gemma":[0.9983687,0.00044816156,0.000052500087,0.000568657,0.00041011977,0.00015186545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020097123,0.00018644563,0.00023383668,0.000056459947,0.00021571701,0.00022537014,0.00056192715,0.000046022047,0.00016858263],"category_scores_gemma":[0.0003053822,0.00015007367,0.00017317614,0.00032780602,0.000049282044,0.00038767816,0.00037403565,0.000084408966,0.00036650684],"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.000015261388,0.000493382,0.0005574732,0.00006242995,0.00007931152,0.00006764648,0.0011790134,0.000006133409,0.00037070378,0.8147092,0.07216848,0.11029096],"study_design_scores_gemma":[0.0032121711,0.00049272605,0.003515268,0.00008115139,0.00007117131,0.0002551903,0.000471789,0.15180646,0.1301614,0.14482668,0.56369185,0.001414145],"about_ca_topic_score_codex":0.000011085566,"about_ca_topic_score_gemma":0.00013587758,"teacher_disagreement_score":0.9184744,"about_ca_system_score_codex":0.00007108888,"about_ca_system_score_gemma":0.00029359234,"threshold_uncertainty_score":0.61198264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91005826,0.0003372034,0.08630814,0.0010811087,0.00015489548,0.00018797239,0.000010005738,0.000074528034,0.0017878957],"genre_scores_gemma":[0.98352796,0.000103214334,0.015370115,0.00034003402,0.00004285467,0.0000141191595,0.0000056310123,0.000005447749,0.0005906213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991053,0.00003135971,0.00015559306,0.00042752037,0.00014546601,0.00013475903],"domain_scores_gemma":[0.9990872,0.00013191868,0.0000476915,0.00024411915,0.00032017074,0.00016886876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011687299,0.000105312574,0.00014998617,0.00008606279,0.00018123374,0.00008423321,0.00010387981,0.000057380716,0.000017363409],"category_scores_gemma":[0.00008654501,0.00009157748,0.00001855877,0.00020831113,0.000045388166,0.000325784,0.00021096993,0.00007650008,0.0000101805235],"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.00004867892,0.00062525243,0.0053214943,0.00011972485,0.00006479257,0.000038176735,0.0021295752,0.00013966569,0.43172354,0.47335434,0.001561112,0.084873654],"study_design_scores_gemma":[0.0015229286,0.0008051312,0.46821576,0.0001506868,0.000103225924,0.002431835,0.0016310234,0.42087728,0.06322819,0.012692419,0.027185932,0.0011555942],"about_ca_topic_score_codex":0.000019134339,"about_ca_topic_score_gemma":0.0000667964,"teacher_disagreement_score":0.46289426,"about_ca_system_score_codex":0.000013742589,"about_ca_system_score_gemma":0.000078266086,"threshold_uncertainty_score":0.3734421},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008765736,0.0027771345,0.89793795,0.07804034,0.0027242394,0.00020493343,0.000006985869,0.00009103297,0.009451619],"genre_scores_gemma":[0.93191177,0.00024012229,0.06477574,0.001589476,0.0013246656,0.0000026291768,0.000002224717,0.000014340882,0.00013902364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978,0.0001618564,0.0007710232,0.00035984596,0.00048203382,0.0004252577],"domain_scores_gemma":[0.9970498,0.000612061,0.00053751876,0.0004759711,0.0010443446,0.00028026797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087913236,0.00022583327,0.0005666886,0.0001199216,0.00017532035,0.00021033901,0.0010420516,0.00022667847,0.00004557937],"category_scores_gemma":[0.0016874268,0.00016094244,0.00048720388,0.00042195004,0.000083611936,0.0003282879,0.00026650203,0.0005279621,0.00003747734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036582904,0.00038318336,0.00015764014,0.000045752375,0.00006165354,0.0005782114,0.000117546115,0.00007161426,0.0024503232,0.99278647,0.0008189951,0.0024920527],"study_design_scores_gemma":[0.0010947809,0.0007795859,0.0008258637,0.0000624601,0.000055462886,0.0010836599,0.000020388987,0.0066427616,0.0023021323,0.98217314,0.004703044,0.00025674122],"about_ca_topic_score_codex":4.2802884e-7,"about_ca_topic_score_gemma":0.0000016105902,"teacher_disagreement_score":0.92314607,"about_ca_system_score_codex":0.00006222449,"about_ca_system_score_gemma":0.00031337238,"threshold_uncertainty_score":0.6563042},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022677486,0.00022748481,0.77843696,0.0011957997,0.00062084506,0.000039355673,1.4333729e-7,0.000104508734,0.21710716],"genre_scores_gemma":[0.9735531,0.000019198491,0.0047628623,0.0003239399,0.00008222849,0.000005729757,9.2451575e-7,0.0000024805445,0.021249488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944776,0.00004265862,0.00008484128,0.0001656992,0.000114890165,0.00014415289],"domain_scores_gemma":[0.99932855,0.00016110067,0.00002253511,0.00035397182,0.00009234312,0.000041466406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014141298,0.000050200895,0.000049052793,0.000008920279,0.00022240831,0.00022667952,0.0003397421,0.0000230897,0.000033841017],"category_scores_gemma":[0.00015016519,0.000029865312,0.000036129746,0.00016043996,0.000022947557,0.0001010335,0.00016189265,0.000045305576,0.00032081458],"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":[6.301162e-7,0.000024824194,0.000117776166,0.0000023904959,0.0000057381294,0.000038592796,0.0005247261,0.000003941657,0.00041856398,0.8889873,0.0034596068,0.10641591],"study_design_scores_gemma":[0.00076867995,0.00015760644,0.016110525,0.000019673362,0.000020896081,0.00026113016,0.00034495976,0.6026048,0.026975986,0.07873005,0.27341866,0.0005869902],"about_ca_topic_score_codex":0.0000055787987,"about_ca_topic_score_gemma":0.000092752365,"teacher_disagreement_score":0.9712854,"about_ca_system_score_codex":0.000016230038,"about_ca_system_score_gemma":0.000098616525,"threshold_uncertainty_score":0.41235295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03353706,0.000048239395,0.84484357,0.0025152087,0.0028537984,0.0002896567,0.000020981617,0.00021577606,0.115675725],"genre_scores_gemma":[0.99473405,0.000027012804,0.0018889168,0.00007691484,0.00021763962,0.00008569617,0.00003605537,0.000010208863,0.0029235133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99861455,0.00012277617,0.00031242325,0.00046840656,0.0003043875,0.00017745908],"domain_scores_gemma":[0.99824005,0.00006194363,0.00023213371,0.00033339864,0.0010626656,0.00006982855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019188829,0.00016709766,0.00018435493,0.0002033151,0.00014677973,0.000177346,0.0004943405,0.000061558196,0.00025171164],"category_scores_gemma":[0.00031749406,0.00015670502,0.0001054539,0.0003206716,0.000049913226,0.0005057901,0.00020703618,0.00022353047,0.00014831671],"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.00003975845,0.00048321518,0.00026933083,0.000030544772,0.00009199256,0.000023864846,0.0014043691,0.000048164133,0.06871747,0.87789303,0.00022360642,0.05077468],"study_design_scores_gemma":[0.0011003733,0.000492506,0.009064684,0.0006175613,0.000022960947,0.00014132362,0.00017112243,0.148325,0.79363286,0.02580673,0.019998698,0.00062621123],"about_ca_topic_score_codex":0.000023049071,"about_ca_topic_score_gemma":0.000017051021,"teacher_disagreement_score":0.96119696,"about_ca_system_score_codex":0.00012286112,"about_ca_system_score_gemma":0.00027130477,"threshold_uncertainty_score":0.63902456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12763865,0.0012323102,0.8643267,0.0007891065,0.0016105352,0.0002403788,3.7280353e-7,0.00002725307,0.0041346587],"genre_scores_gemma":[0.99578273,0.00015856266,0.0033920973,0.000015014657,0.00033025202,0.0000038605854,1.725823e-7,0.000010421687,0.0003069148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623895,0.000838667,0.0008917236,0.00029459613,0.0010714903,0.000664554],"domain_scores_gemma":[0.9973171,0.000928401,0.00021769699,0.0004118577,0.0008793408,0.0002456189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008930427,0.0001343641,0.00032531464,0.0008569983,0.00018844644,0.00046442408,0.0016713943,0.000106379164,0.0000166499],"category_scores_gemma":[0.0016552428,0.000106667,0.00013011401,0.0011476636,0.00013813122,0.00054423406,0.00029514695,0.000926449,0.00027157442],"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.00006183568,0.0005006472,0.0011932154,0.000070045695,0.000027443888,0.00023165507,0.0043049413,0.0067230025,0.005844694,0.21081817,0.00038161594,0.76984274],"study_design_scores_gemma":[0.00008728135,0.0007457115,0.0010839542,0.00035057924,0.000003798792,0.00017153466,0.001275353,0.96061933,0.0061166924,0.024405371,0.004906479,0.00023390705],"about_ca_topic_score_codex":0.00015570574,"about_ca_topic_score_gemma":0.00024200956,"teacher_disagreement_score":0.95389634,"about_ca_system_score_codex":0.00030606947,"about_ca_system_score_gemma":0.00040583021,"threshold_uncertainty_score":0.44784522},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044065367,0.000037618425,0.916885,0.00063639437,0.00019078818,0.00015008257,0.000003280892,0.00005682229,0.037974622],"genre_scores_gemma":[0.9957293,0.000007677598,0.0039615436,0.00014418321,0.000057917805,0.000005332707,0.0000022170475,0.0000029452779,0.00008884623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984095,0.00010881349,0.00042935094,0.00036729986,0.00048856274,0.00019648038],"domain_scores_gemma":[0.9981329,0.0005952515,0.00015323889,0.00018031677,0.00084732025,0.00009097539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025653322,0.000121108154,0.0001707973,0.00015675189,0.00010964753,0.000075344076,0.0003232177,0.00009573934,0.00011810723],"category_scores_gemma":[0.00138194,0.00010178412,0.000052905532,0.00031740655,0.00026409357,0.00020520025,0.00010894165,0.00016416426,0.00006158263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028964014,0.00012526882,0.0001076368,0.0000059034833,0.000003927663,0.0000014660164,0.00036595383,0.000018163091,0.0033829988,0.8482387,0.000014174459,0.14770685],"study_design_scores_gemma":[0.000026739519,0.00017211659,0.013862508,0.000018961708,0.000002171276,0.0000048028473,0.00013618542,0.028365118,0.04524888,0.9119624,0.00007328991,0.00012682981],"about_ca_topic_score_codex":0.00000925602,"about_ca_topic_score_gemma":0.000028103605,"teacher_disagreement_score":0.951664,"about_ca_system_score_codex":0.00006291333,"about_ca_system_score_gemma":0.00014668108,"threshold_uncertainty_score":0.4150636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91655374,0.005969535,0.04892724,0.0015349691,0.007733531,0.00077758793,0.0000022867137,0.00045000607,0.0180511],"genre_scores_gemma":[0.997777,0.00006309,0.001494894,0.00010859414,0.000029830815,0.000018104913,8.25951e-7,0.000009958893,0.0004977259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989484,0.000031329604,0.00017909918,0.0002904296,0.00014886481,0.0004018845],"domain_scores_gemma":[0.9985147,0.0007262451,0.00007517746,0.00045188726,0.00010670906,0.00012529596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085230736,0.00013121813,0.00013108982,0.00003733515,0.0003437785,0.0002148006,0.0006666885,0.00007072832,0.0000014621413],"category_scores_gemma":[0.00022666974,0.00009041584,0.000060718656,0.00017130475,0.00009121514,0.00018275704,0.00021556085,0.000100845056,0.000020663529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007980504,0.000036734244,0.0019496931,0.000005210543,0.000009881713,0.000005111545,0.0007723299,1.4202124e-7,0.00010089159,0.95020765,0.0018875841,0.045016773],"study_design_scores_gemma":[0.00071674323,0.00013850312,0.016497076,0.0000105430145,0.000006233825,0.000012365275,0.00004910092,0.0012520566,0.0014713168,0.9351223,0.044544008,0.00017974616],"about_ca_topic_score_codex":0.0000071448503,"about_ca_topic_score_gemma":0.000025205922,"teacher_disagreement_score":0.081223235,"about_ca_system_score_codex":0.000024832101,"about_ca_system_score_gemma":0.000039603605,"threshold_uncertainty_score":0.36870506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008794785,0.00008750661,0.90200055,0.00037964364,0.0008015613,0.00032563682,0.000007959394,0.00020491745,0.08739746],"genre_scores_gemma":[0.98910964,0.0000022659988,0.010283677,0.00021744447,0.00017355758,0.000030540665,0.00001743533,0.000011190232,0.00015426129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803025,0.00010504755,0.0005289994,0.00047927457,0.0004948815,0.00036155747],"domain_scores_gemma":[0.998566,0.00019443476,0.0002334684,0.00031872623,0.00048808102,0.00019932112],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042694205,0.0002804736,0.0002689497,0.00051334343,0.00025703703,0.0013024601,0.0007461246,0.00009589367,0.00001600945],"category_scores_gemma":[0.00014779899,0.00023756574,0.000040031005,0.00041114393,0.0000825879,0.0007273115,0.00013131287,0.00025682535,0.00031988893],"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.00010846354,0.0001855999,0.0008134005,0.00007235574,0.00006649251,0.000034356282,0.019574339,0.080796905,0.00032327112,0.8285385,0.0006406276,0.06884572],"study_design_scores_gemma":[0.000076638076,0.00022166331,0.000116506235,0.0004999466,0.0000048568913,0.00006283719,0.0013120968,0.99274766,0.0005046834,0.00092420494,0.0031932013,0.00033568032],"about_ca_topic_score_codex":0.00008656877,"about_ca_topic_score_gemma":0.0000067327883,"teacher_disagreement_score":0.98031485,"about_ca_system_score_codex":0.00011156998,"about_ca_system_score_gemma":0.00006973887,"threshold_uncertainty_score":0.9997343},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60896456,0.0003144638,0.29084393,0.00082292897,0.0010692402,0.0006103043,0.0000070895835,0.00028660195,0.097080864],"genre_scores_gemma":[0.9924743,0.000085967404,0.0070268544,0.00010548852,0.000040115207,0.000015968952,4.298635e-7,0.000008251023,0.0002425902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856687,0.000022039512,0.00040152282,0.00045116246,0.00027027982,0.00028815743],"domain_scores_gemma":[0.9988721,0.000039656352,0.00032470515,0.00020077713,0.00047595252,0.00008682582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047858394,0.00020752687,0.00020751053,0.00008854386,0.00023027002,0.00027490643,0.0011612115,0.000108368076,0.000040007348],"category_scores_gemma":[0.00038276476,0.0001460211,0.000071257244,0.0003105779,0.00028437914,0.00068500615,0.00030549744,0.00025845208,0.000052713356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016087908,0.0000913669,0.000756009,0.00002042382,0.000006276431,2.164712e-7,0.0041875793,1.9888454e-7,0.04986605,0.87228805,0.00022080417,0.07254693],"study_design_scores_gemma":[0.000028680846,0.00032512328,0.001009401,0.00017883917,0.000013838338,0.000011501407,0.0014321454,0.024885261,0.38712996,0.58457047,0.0001412101,0.00027356078],"about_ca_topic_score_codex":0.000086805325,"about_ca_topic_score_gemma":0.000014526927,"teacher_disagreement_score":0.38350976,"about_ca_system_score_codex":0.000036748672,"about_ca_system_score_gemma":0.00004199675,"threshold_uncertainty_score":0.5954568},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028887733,0.00070045074,0.97535574,0.00037906587,0.0014081672,0.00037806676,0.000024515477,0.0003034292,0.01856176],"genre_scores_gemma":[0.9122593,0.00036586053,0.08252922,0.0008318253,0.00053502136,0.00007384686,0.000040281164,0.000019391655,0.0033452662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843246,0.00007104377,0.0002726891,0.0005369728,0.0002475326,0.0004393065],"domain_scores_gemma":[0.9988216,0.00012965772,0.00015861305,0.0005681633,0.00018971213,0.00013223574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032212536,0.00021008038,0.00021679266,0.0001032337,0.000294676,0.0001844486,0.00065961014,0.00009412183,0.00016207603],"category_scores_gemma":[0.00024374461,0.000179098,0.0001450424,0.00032090445,0.00005886441,0.00084019377,0.00022996005,0.00017456475,0.0003037363],"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.000023715058,0.0005325982,0.0007183567,0.00005288951,0.000041465195,0.0000352085,0.002381786,0.00024057885,0.0014356379,0.8063352,0.050638363,0.13756421],"study_design_scores_gemma":[0.0014789315,0.00046805802,0.004036928,0.0000509224,0.000039520604,0.000080896134,0.0003353143,0.24464758,0.0029056957,0.035449244,0.7096101,0.0008967888],"about_ca_topic_score_codex":0.000007438608,"about_ca_topic_score_gemma":0.000013646424,"teacher_disagreement_score":0.90937054,"about_ca_system_score_codex":0.00015381005,"about_ca_system_score_gemma":0.000021833072,"threshold_uncertainty_score":0.7303405},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062372103,0.0001177262,0.9306779,0.0006882351,0.00050513475,0.00060427445,0.000014390477,0.000413134,0.0046070884],"genre_scores_gemma":[0.9468746,0.0000016206759,0.051410995,0.00033328804,0.000540793,0.000026644726,0.000149469,0.000023544733,0.000639011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997053,0.00015268744,0.0004025824,0.0007833542,0.0006029007,0.001005428],"domain_scores_gemma":[0.99814063,0.0005442111,0.0001999498,0.0004934194,0.00038495284,0.0002368266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014495085,0.00029299795,0.00029814968,0.00024136523,0.00064756273,0.00020947479,0.00096651254,0.000115695584,0.000075229895],"category_scores_gemma":[0.00008648864,0.00030675452,0.00018303457,0.0005851952,0.00013369069,0.00042103473,0.00012764448,0.00028436072,0.00019786083],"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.00030190492,0.0004343207,0.00005310603,0.000010530838,0.00003700155,0.0000045218253,0.00029384997,0.006876367,0.0010893103,0.9838764,0.0037864316,0.0032362696],"study_design_scores_gemma":[0.0017305942,0.0019605828,0.00909668,0.000014296432,0.000014996365,0.000040103856,0.000021655227,0.6824703,0.0014084517,0.2840766,0.01863533,0.0005304146],"about_ca_topic_score_codex":0.00002755483,"about_ca_topic_score_gemma":0.00017451613,"teacher_disagreement_score":0.88450253,"about_ca_system_score_codex":0.00059172866,"about_ca_system_score_gemma":0.00054086896,"threshold_uncertainty_score":0.9999384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005809327,0.000091390706,0.8549311,0.012515105,0.0010369367,0.00047471316,0.000018488916,0.0003416963,0.12478123],"genre_scores_gemma":[0.99154484,0.000028559163,0.005708378,0.002138247,0.00025732422,0.000071409755,0.0000077603045,0.000007611544,0.00023587488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998083,0.000063411026,0.0003251352,0.00052154996,0.0006797668,0.00032713686],"domain_scores_gemma":[0.9983155,0.00018159978,0.00013047775,0.0002693395,0.0009682078,0.00013488976],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040834793,0.00020135495,0.00017784572,0.00017411252,0.00025296173,0.00023950181,0.000925825,0.00010647878,0.00017050553],"category_scores_gemma":[0.0004431064,0.00018468921,0.000074779564,0.00056506775,0.00017060529,0.00054759986,0.00013762582,0.00024718983,0.0020086756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010789895,0.00016040566,0.000021482225,0.0000029432852,0.000007307164,0.0000078285875,0.0012794578,0.00012335257,0.00025199336,0.95034415,0.00007794398,0.04771235],"study_design_scores_gemma":[0.00005863163,0.00024100703,0.0012719927,0.000054037013,0.0000025248248,0.00000852674,0.00012341724,0.018948454,0.026331946,0.95136297,0.001291539,0.0003049663],"about_ca_topic_score_codex":0.00010366859,"about_ca_topic_score_gemma":0.00021305196,"teacher_disagreement_score":0.98573554,"about_ca_system_score_codex":0.00017623151,"about_ca_system_score_gemma":0.00049803185,"threshold_uncertainty_score":0.9987684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123161204,0.017256401,0.59220564,0.0013029804,0.0012959784,0.000067633075,0.0000011269595,0.000033134987,0.2646759],"genre_scores_gemma":[0.9682955,0.00065354444,0.030558059,0.00019417195,0.00012743485,2.3527633e-7,1.4774902e-7,0.000003250557,0.00016765145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990452,0.00008417758,0.00033809003,0.00014483155,0.00021289095,0.00017479982],"domain_scores_gemma":[0.99891186,0.0001320138,0.000323841,0.00019201048,0.00035147453,0.00008877659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045149698,0.00009286277,0.00027262213,0.000057927544,0.000060672573,0.00006275519,0.00041706755,0.00005762235,0.000017947],"category_scores_gemma":[0.00025542174,0.00006752202,0.00009156735,0.00023393007,0.00006246915,0.00027319355,0.000178494,0.00018578388,0.0000037050277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011142076,0.00013237813,0.005700517,0.00006904637,0.00004805018,0.000635878,0.00153034,0.00011430057,0.003946797,0.9507557,0.00039293125,0.036662918],"study_design_scores_gemma":[0.002404925,0.0012347949,0.04960642,0.00051015656,0.00008016158,0.004804265,0.0007369116,0.005087456,0.04204646,0.88089234,0.011972849,0.0006232472],"about_ca_topic_score_codex":0.0000019924037,"about_ca_topic_score_gemma":0.000003342168,"teacher_disagreement_score":0.8451343,"about_ca_system_score_codex":0.000018548297,"about_ca_system_score_gemma":0.00010892377,"threshold_uncertainty_score":0.27534682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908284,0.0035326933,0.0010502763,0.0009886902,0.00018815072,0.002213122,0.000010047062,0.00047522294,0.00071340246],"genre_scores_gemma":[0.90380317,0.00005226089,0.09486443,0.00008379747,0.00008217182,0.00057384075,0.0000060965276,0.000048818103,0.00048541048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.997317,0.000053469557,0.00039598448,0.00090037985,0.00060880306,0.0007243271],"domain_scores_gemma":[0.99783623,0.00031975203,0.00064865086,0.0006072367,0.000425229,0.00016292844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012753878,0.0004142477,0.0004932958,0.00013130631,0.0011190033,0.0006222057,0.0019042363,0.00009897428,0.0000024083176],"category_scores_gemma":[0.0033121726,0.0002919399,0.000106234256,0.00067940867,0.00048284844,0.0004985385,0.0020912685,0.00043430412,3.943783e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006705784,0.0006416976,0.12918627,0.0022551473,0.00020799847,0.00002083794,0.04142818,0.000028468108,0.0018397168,0.43868113,0.00043438675,0.3846056],"study_design_scores_gemma":[0.035303522,0.069675975,0.20146836,0.049306784,0.0033433007,0.009501772,0.23462859,0.10732187,0.060140453,0.092560925,0.11963599,0.017112456],"about_ca_topic_score_codex":0.00006520621,"about_ca_topic_score_gemma":0.000021481364,"teacher_disagreement_score":0.36749312,"about_ca_system_score_codex":0.00008854147,"about_ca_system_score_gemma":0.00009476437,"threshold_uncertainty_score":0.99995327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008289623,0.00066697696,0.5660621,0.28822997,0.09867509,0.00017968132,8.942231e-7,0.00023515179,0.037660524],"genre_scores_gemma":[0.8322575,0.00001962651,0.006821957,0.0005205123,0.16031769,8.063855e-7,4.2834608e-7,0.000006191129,0.000055301953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985089,0.00017632051,0.00043455488,0.0002241728,0.00042404133,0.00023203096],"domain_scores_gemma":[0.99861497,0.0001515238,0.00035390334,0.00032652495,0.0003454489,0.00020763098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010076197,0.0001389359,0.00029192783,0.00014073848,0.0001018928,0.000101925965,0.00087726914,0.00012952501,0.00003582906],"category_scores_gemma":[0.00085100444,0.00009425291,0.00017386401,0.00026707567,0.00008243993,0.0004614118,0.00014298875,0.00046853017,0.0001446417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019752144,0.00022058676,0.00021445571,0.00001186341,0.000022987266,0.000034802517,0.000093019364,0.000047890786,0.0010834833,0.94662446,0.04768866,0.0039380556],"study_design_scores_gemma":[0.00047896308,0.0009593163,0.001065172,0.000016555314,0.000017295311,0.00045856123,0.0000026649154,0.0015892889,0.0005335687,0.8089651,0.1857405,0.00017305995],"about_ca_topic_score_codex":6.702742e-7,"about_ca_topic_score_gemma":2.6092238e-7,"teacher_disagreement_score":0.8239679,"about_ca_system_score_codex":0.00005318769,"about_ca_system_score_gemma":0.000046742174,"threshold_uncertainty_score":0.3843522},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026036143,0.0013608688,0.9692056,0.00043942238,0.00035040308,0.00007175552,2.8266406e-8,0.000028233751,0.0025075441],"genre_scores_gemma":[0.23893434,0.000050974908,0.7606496,0.00014318289,0.00014246232,0.0000024295073,4.7583754e-8,0.0000035875257,0.00007334608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981196,0.00067924516,0.00048879295,0.00022001375,0.00019818329,0.00029414965],"domain_scores_gemma":[0.9984996,0.0007933518,0.00027908068,0.0001622826,0.00008711881,0.00017861927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004604059,0.0001314896,0.0003638126,0.00011926854,0.00007233081,0.00016148189,0.00054839026,0.000096147916,0.000011647911],"category_scores_gemma":[0.0013021778,0.00008143659,0.00010595977,0.00031915924,0.0000826917,0.00028380245,0.00021742412,0.00037574972,0.0000025448057],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062850063,0.00007470679,0.002050502,0.000015509771,0.000008036331,0.000020359732,0.00036488223,0.000004079271,0.0003741778,0.11278724,0.000020213867,0.884274],"study_design_scores_gemma":[0.002136535,0.0023442751,0.024747292,0.0002597253,0.000036988647,0.0012220778,0.00019730945,0.016825879,0.0032369914,0.7677131,0.18062265,0.000657158],"about_ca_topic_score_codex":0.0000017665201,"about_ca_topic_score_gemma":0.0000010933875,"teacher_disagreement_score":0.88361686,"about_ca_system_score_codex":0.000017960265,"about_ca_system_score_gemma":0.000026954423,"threshold_uncertainty_score":0.33208877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018890502,0.000040953466,0.9630735,0.002777833,0.00048684079,0.000068154404,0.0000013759292,0.00011938761,0.0145414835],"genre_scores_gemma":[0.9711269,0.000009458415,0.028546203,0.000105271196,0.00007447503,0.000011711962,6.4090324e-7,0.000004203587,0.00012109806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982953,0.00006847617,0.0002257505,0.0006594841,0.00029899552,0.0004519861],"domain_scores_gemma":[0.9989043,0.00023872544,0.00004839041,0.0005073301,0.00010970103,0.00019158448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007830363,0.00014221971,0.0001497265,0.0004196992,0.00037667522,0.00045198048,0.0010558343,0.000042352833,0.00009750451],"category_scores_gemma":[0.00009236026,0.0000858893,0.000039871178,0.0014638263,0.0019183182,0.0009297428,0.0006271418,0.0000906004,0.00007535345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013143176,0.000041575673,0.00043582945,0.0000011167373,0.0000011134945,0.0000039622355,0.00017475123,0.0000012263685,0.00005636517,0.7194305,0.000031395368,0.27982086],"study_design_scores_gemma":[0.00062426704,0.0002484037,0.0331288,0.00005327313,0.000003614285,0.000060564387,0.000005246366,0.20095403,0.0003804662,0.7618943,0.0023167804,0.0003302607],"about_ca_topic_score_codex":0.0000044515164,"about_ca_topic_score_gemma":0.000009711618,"teacher_disagreement_score":0.9522364,"about_ca_system_score_codex":0.000055523284,"about_ca_system_score_gemma":0.00007233721,"threshold_uncertainty_score":0.7068123},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.013754e-7,0.0011155669,0.04921122,0.00015333496,0.000540069,0.00008012195,5.96041e-7,0.00008948143,0.9488092],"genre_scores_gemma":[0.0026880899,0.000746044,0.001282177,0.0000744062,0.00013015291,0.0000021696721,9.4355426e-7,0.0000076061665,0.99506843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999261,0.000010270557,0.00018576454,0.00023121935,0.00017948695,0.00013223175],"domain_scores_gemma":[0.99906015,0.000111943824,0.00014773676,0.00054953067,0.0000965207,0.000034105688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001354721,0.00014043774,0.00015536905,0.000041731993,0.00011140954,0.000058522757,0.0007460843,0.00015196463,0.00033739628],"category_scores_gemma":[0.000015901316,0.00007813838,0.00012577446,0.000025966083,0.00007136646,0.000063977255,0.000183332,0.00014770028,0.0004087888],"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":[4.6966858e-7,0.000004907955,0.0000015576834,0.0000042050383,0.000010917245,0.000001985969,0.000051069,8.499403e-7,0.0000015301149,0.95521456,0.022813708,0.021894222],"study_design_scores_gemma":[0.00006529011,0.000081269885,0.000023752149,0.000021714372,0.000008335178,0.000011593041,0.0000020093653,0.0021535885,0.00004373462,0.17196316,0.82547826,0.00014732257],"about_ca_topic_score_codex":0.0000046343007,"about_ca_topic_score_gemma":0.00000837299,"teacher_disagreement_score":0.8026645,"about_ca_system_score_codex":0.00002352061,"about_ca_system_score_gemma":0.00002172307,"threshold_uncertainty_score":0.52542895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08296507,0.0042072185,0.017476585,0.015725605,0.0023043442,0.0005642546,0.000012005625,0.00072529836,0.8760196],"genre_scores_gemma":[0.9885463,0.00001694664,0.0058259163,0.0011349673,0.00008545858,0.000038464572,0.0000019393337,0.000007697631,0.0043422733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987006,0.00013588113,0.00022606715,0.00033303743,0.0003210262,0.00028339075],"domain_scores_gemma":[0.9991133,0.00013020828,0.00014920376,0.0004810035,0.000056654604,0.00006962093],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044995596,0.00012256774,0.0002187913,0.00008559416,0.00023004747,0.000038131784,0.0013686355,0.000033806336,0.001966143],"category_scores_gemma":[0.00008028605,0.00010627533,0.00010126526,0.00026864046,0.00006542604,0.000028681621,0.0009134625,0.00016417755,0.00034926797],"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.000011688415,0.0003807957,0.0011732304,0.000039742623,0.000028929286,0.00005407177,0.002109667,0.00042047596,0.00032090614,0.9153655,0.06915604,0.010938926],"study_design_scores_gemma":[0.00055880507,0.00042228488,0.0045361696,0.000008849104,0.000012429383,0.00006267148,0.00026153744,0.0014307786,0.00061547174,0.021066641,0.97069144,0.00033291627],"about_ca_topic_score_codex":0.00007641575,"about_ca_topic_score_gemma":0.0000012608812,"teacher_disagreement_score":0.9055813,"about_ca_system_score_codex":0.00003456564,"about_ca_system_score_gemma":0.00005257067,"threshold_uncertainty_score":0.9989462},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003118994,0.0005821465,0.97815967,0.00041689424,0.0016092652,0.00037497593,0.000012859449,0.000059052047,0.01566617],"genre_scores_gemma":[0.97973466,0.000026795546,0.018640282,0.00041395304,0.00013882785,0.0000076136894,0.0000037297184,0.000020394406,0.0010137422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968778,0.0001318938,0.0004991297,0.00090592244,0.0011962297,0.00038901865],"domain_scores_gemma":[0.9965322,0.00043814367,0.00072210206,0.0020242836,0.00022299557,0.00006030262],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011680751,0.00031903078,0.00059128384,0.00055240764,0.0004172707,0.00011708198,0.0055230255,0.00016780813,0.00008913821],"category_scores_gemma":[0.00020698969,0.00019634275,0.00050057925,0.0029281562,0.00079899153,0.00026005897,0.0032332768,0.00063090114,0.00000508173],"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.00001805114,0.00017808612,0.0064245095,0.00009359644,0.00044999976,0.000016784597,0.011841454,0.43775335,0.0015601102,0.2243261,0.00010988857,0.31722805],"study_design_scores_gemma":[0.00015832171,0.000096267235,0.008516469,0.00023592803,0.00018340135,0.000017328546,7.052591e-7,0.96110773,0.0027071885,0.025416413,0.0011692785,0.00039096316],"about_ca_topic_score_codex":0.00008821519,"about_ca_topic_score_gemma":0.00009118927,"teacher_disagreement_score":0.97661567,"about_ca_system_score_codex":0.00024746504,"about_ca_system_score_gemma":0.00045619757,"threshold_uncertainty_score":0.99985754},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016297969,0.00005584524,0.30531728,0.0000933029,0.0005514585,0.0001514288,0.0000014420796,0.00021108455,0.69360185],"genre_scores_gemma":[0.0026442953,0.000009544948,0.05758997,0.0007059416,0.00063031795,0.000019194138,0.000036699552,0.000023272307,0.9383408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855757,0.000030192867,0.00019296812,0.000554985,0.00027949843,0.0003847691],"domain_scores_gemma":[0.9980426,0.000044700417,0.0001864151,0.0013039546,0.00016652899,0.00025579304],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004053581,0.00024938886,0.00026282904,0.00015914878,0.00037261762,0.00069704466,0.0020730407,0.00024539608,0.00004590453],"category_scores_gemma":[0.00010509578,0.00021258692,0.000092168535,0.000045810124,0.000028591818,0.0014166519,0.0004436695,0.00021880755,0.00092408364],"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.0000030799968,0.000018616998,0.000027028913,0.000018435629,0.0000127367,0.000017090084,0.0013256281,0.000008177439,0.00001246325,0.7612625,0.14124389,0.0960504],"study_design_scores_gemma":[0.00029724484,0.0005036969,0.00086310855,0.0002130278,0.000019030898,0.00003212787,0.000017116146,0.012673905,0.00013129065,0.04350764,0.9408485,0.00089327095],"about_ca_topic_score_codex":0.000022991635,"about_ca_topic_score_gemma":0.00013096994,"teacher_disagreement_score":0.79960465,"about_ca_system_score_codex":0.00012874279,"about_ca_system_score_gemma":0.00039239647,"threshold_uncertainty_score":0.9998538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008508868,0.0031578226,0.44914627,0.0023205413,0.0028528308,0.00020195318,0.0000014508572,0.0005619968,0.53324825],"genre_scores_gemma":[0.88912547,0.00007678257,0.098902486,0.0012380097,0.0017804225,0.000022435923,0.000005677944,0.000017573757,0.008831139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876213,0.00004622383,0.00022483064,0.0004176265,0.00019273284,0.00035646601],"domain_scores_gemma":[0.9991834,0.000040941042,0.00009612152,0.0005514722,0.000045985544,0.0000820531],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013359803,0.00015414096,0.00015402875,0.00011452719,0.00014753154,0.0001305327,0.00082858506,0.00007366238,0.00005014264],"category_scores_gemma":[0.00001585886,0.00012057792,0.00011731534,0.00072092377,0.000023312514,0.0002011968,0.00012510912,0.00012234742,0.0009771277],"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.000003628199,0.00023975532,0.024427675,0.000011789065,0.000006651761,0.0000126196755,0.00010759901,0.00003239215,0.000048137463,0.7345684,0.2112022,0.029339144],"study_design_scores_gemma":[0.0011675667,0.00020034474,0.04829203,0.000005464185,0.000020388608,0.000070280184,0.000025040175,0.005297275,0.00012398987,0.4211134,0.5230176,0.00066660956],"about_ca_topic_score_codex":0.00030479147,"about_ca_topic_score_gemma":0.00013992282,"teacher_disagreement_score":0.8806166,"about_ca_system_score_codex":0.000028207105,"about_ca_system_score_gemma":0.00005510144,"threshold_uncertainty_score":0.99980074},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046117534,0.005742053,0.0026108355,0.03284852,0.00074166496,0.00042423946,0.000016405425,0.00007433658,0.95753735],"genre_scores_gemma":[0.918952,0.015735231,0.011824424,0.019734623,0.002625948,0.00031107568,0.00019619998,0.00009245175,0.030528074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976839,0.00015719536,0.00063853833,0.0009316208,0.00032560102,0.00026316455],"domain_scores_gemma":[0.99751866,0.0016290213,0.00025913678,0.00036678108,0.00014992496,0.00007645108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012102134,0.00041179662,0.00081712974,0.0001803086,0.00026574644,0.00002478948,0.00053881545,0.0010613409,0.000010505693],"category_scores_gemma":[0.0003258457,0.00036749517,0.00008036661,0.000114911236,0.0013241762,0.000060055823,0.0007998714,0.0022705868,0.0000642136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003491903,0.000024428533,0.000039735547,0.0002893825,0.00007297116,0.00011896997,0.002069806,0.000024311548,0.0000020006207,0.99663836,0.00039251952,0.0002925858],"study_design_scores_gemma":[0.0004391601,0.0000793537,0.00017784817,0.00012388489,0.000012946819,0.000030704236,0.000025640364,0.00015315459,0.0000022389397,0.9898821,0.008721774,0.0003511577],"about_ca_topic_score_codex":0.0000068747413,"about_ca_topic_score_gemma":0.00019557335,"teacher_disagreement_score":0.9270093,"about_ca_system_score_codex":0.00015240438,"about_ca_system_score_gemma":0.00031274869,"threshold_uncertainty_score":0.9998777},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02746546,0.0041936277,0.13516088,0.15305519,0.00040715814,0.0015757654,0.000001702997,0.00072844425,0.6774118],"genre_scores_gemma":[0.9708204,0.00015747013,0.0189957,0.0014698583,0.00011119829,0.000058733716,3.3506402e-7,0.000006537414,0.008379742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935967,0.00002181935,0.00009349704,0.00024285886,0.000096932185,0.00018521906],"domain_scores_gemma":[0.99953425,0.000068309564,0.000033637272,0.00028983218,0.00003074359,0.000043204425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016020404,0.00007822194,0.000072086725,0.000050204268,0.00012902322,0.00016503864,0.00043372132,0.000044146884,0.0000673555],"category_scores_gemma":[0.00003847245,0.000047309393,0.000013923731,0.0003348229,0.000039095226,0.00019205791,0.00012828283,0.00013551193,0.00009096105],"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.0000013881531,0.00022127172,0.005162843,0.000041759045,0.000009661608,0.000009255107,0.1052906,0.000015562891,0.000528109,0.79517174,0.008777414,0.08477041],"study_design_scores_gemma":[0.0011606197,0.00021311399,0.040865686,0.0001400366,0.000012083518,0.00015719132,0.0013490156,0.42685944,0.0014102978,0.029197985,0.49775374,0.0008807672],"about_ca_topic_score_codex":0.000015873544,"about_ca_topic_score_gemma":0.00013955779,"teacher_disagreement_score":0.94335496,"about_ca_system_score_codex":0.000016990372,"about_ca_system_score_gemma":0.000010271514,"threshold_uncertainty_score":0.1929221},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021646557,0.00036264546,0.9586011,0.0003634636,0.0005318409,0.0001730929,1.4243113e-7,0.0001755751,0.018145563],"genre_scores_gemma":[0.9382566,0.000018276722,0.061289836,0.00033634444,0.000056840036,0.000011016246,1.7297373e-7,0.000008379685,0.000022525435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648994,0.00022365023,0.00028826843,0.0009791688,0.0005622076,0.0014567797],"domain_scores_gemma":[0.9981758,0.0004955841,0.00005996781,0.00093142485,0.00011464501,0.00022258116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025206401,0.00023210394,0.00023823947,0.00022745389,0.000294828,0.00036185142,0.0027187064,0.00007779302,0.00006363879],"category_scores_gemma":[0.0006085562,0.00019058259,0.00007296946,0.0019921153,0.0014749443,0.00063836767,0.0005441184,0.00045369868,0.00014511602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022983652,0.00007848532,0.00037873254,0.0000029811454,0.0000020663804,0.000008854335,0.0003188754,0.0001363277,0.00024245994,0.9798267,0.0000094082225,0.018992808],"study_design_scores_gemma":[0.00036409794,0.00031873863,0.0006384486,0.000018686882,0.0000021694884,0.00008059925,0.0000023143964,0.17488873,0.018300073,0.80380434,0.0012326305,0.00034920065],"about_ca_topic_score_codex":0.0000029774783,"about_ca_topic_score_gemma":0.0000063550438,"teacher_disagreement_score":0.91661006,"about_ca_system_score_codex":0.0002803133,"about_ca_system_score_gemma":0.00061907154,"threshold_uncertainty_score":0.7771732},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002572981,0.0041792435,0.056912493,0.0048383446,0.00065914134,0.00031891678,0.000005069758,0.000047622227,0.9327819],"genre_scores_gemma":[0.24797758,0.0047304253,0.0720837,0.020075018,0.0014436813,0.0000919475,0.000012894974,0.0000586295,0.6535261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984104,0.00013080306,0.00025803834,0.00058601197,0.00039870472,0.00021603618],"domain_scores_gemma":[0.99719375,0.0018281675,0.00036043423,0.0002700636,0.00026395486,0.00008360467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023214,0.00030445564,0.00044902184,0.000095210096,0.00010379817,0.00038746605,0.0011313983,0.00057823176,0.00044908654],"category_scores_gemma":[0.0016862405,0.00015444803,0.00014268706,0.00020708152,0.00018057394,0.0003498152,0.0006058284,0.0010429363,0.00006231067],"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.000083188905,0.00016474014,0.0000060373995,0.000032222262,0.0006074214,0.000005080527,0.0017308991,0.000008208976,0.000011839177,0.87932956,0.09701037,0.021010421],"study_design_scores_gemma":[0.0015801507,0.00093971123,0.0014969273,0.0006917401,0.0030017416,0.00080977817,0.0045455163,0.003327102,0.00070593174,0.102242,0.8785557,0.0021036868],"about_ca_topic_score_codex":0.000004358362,"about_ca_topic_score_gemma":0.0000015713509,"teacher_disagreement_score":0.78154534,"about_ca_system_score_codex":0.000024783674,"about_ca_system_score_gemma":0.000047355305,"threshold_uncertainty_score":0.62982076},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046879745,0.00035780465,0.1305587,0.00005455635,0.0009719804,0.00007258254,7.9136123e-7,0.0003519693,0.8676269],"genre_scores_gemma":[0.00082303485,0.00007200215,0.011353229,0.00028916588,0.0007063728,0.000002461148,0.000002453709,0.00002352319,0.9867278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885345,0.0000064300652,0.00018492732,0.0005082154,0.0001983771,0.0002486024],"domain_scores_gemma":[0.99889046,0.000041992313,0.00009167354,0.0007624834,0.00010494945,0.00010843769],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001387578,0.00025613027,0.00024786146,0.0001026906,0.00008571622,0.00015227546,0.0010164855,0.00024566255,0.0017980008],"category_scores_gemma":[0.000012290294,0.00020615547,0.00014000114,0.000025783567,0.00007269075,0.00018739169,0.00051258627,0.00019081958,0.0046416037],"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":[5.948262e-7,0.0000042378406,0.0000038173343,0.000011101425,0.000017691744,0.000022434577,0.00019850094,1.2710817e-7,0.000005802176,0.9571607,0.02932523,0.013249744],"study_design_scores_gemma":[0.00007138973,0.00006404133,0.000013522849,0.000063392756,0.0000068229087,0.000024948326,0.0000019497945,0.0006077856,0.00010259003,0.10089914,0.89778364,0.0003607847],"about_ca_topic_score_codex":0.00000957176,"about_ca_topic_score_gemma":0.00004034984,"teacher_disagreement_score":0.8684584,"about_ca_system_score_codex":0.000045325363,"about_ca_system_score_gemma":0.00008731823,"threshold_uncertainty_score":0.9991145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017374028,0.00007521707,0.2056134,0.000046730347,0.0004548281,0.000092423455,5.2924105e-7,0.00036338196,0.77597946],"genre_scores_gemma":[0.9821141,0.000015883785,0.015916884,0.00089079054,0.00005537221,0.000010268911,0.0000012450133,0.0000030956712,0.0009923879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991089,0.000016491704,0.00019829458,0.00017440054,0.00014680496,0.0003551218],"domain_scores_gemma":[0.9992773,0.00003659321,0.00007689945,0.0004143592,0.00007967075,0.00011516546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018092798,0.00012781691,0.00012208511,0.00006911956,0.000108467306,0.00008428095,0.0010547446,0.000084981264,0.00021251888],"category_scores_gemma":[0.000050275565,0.00009355766,0.000061357416,0.00023275963,0.00006266837,0.0010029938,0.00035247416,0.00014494172,0.0018535616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045218617,0.000037109658,0.00574478,0.0000066153343,0.000005505059,0.000017385299,0.0029249985,0.00000396494,0.000015472075,0.9615786,0.00047595685,0.029185096],"study_design_scores_gemma":[0.0017749899,0.0019808004,0.40049508,0.000063748135,0.000022219616,0.00026568962,0.0003019231,0.0333056,0.007418902,0.40302432,0.14936021,0.0019865248],"about_ca_topic_score_codex":0.000029780756,"about_ca_topic_score_gemma":0.000011448237,"teacher_disagreement_score":0.96474004,"about_ca_system_score_codex":0.0000140500815,"about_ca_system_score_gemma":0.00006864288,"threshold_uncertainty_score":0.9989236},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014212214,0.004309835,0.0027766523,0.037911475,0.0028094398,0.0008104349,0.00015644977,0.0049588094,0.9462527],"genre_scores_gemma":[0.0049049426,0.0019658303,0.021953648,0.003497026,0.014273536,0.00009934532,0.00036985104,0.0007677921,0.95216805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99355584,0.0002764531,0.0012081773,0.002906253,0.0009561789,0.0010971144],"domain_scores_gemma":[0.99408126,0.0008795582,0.00077943114,0.00325374,0.000044667704,0.0009613516],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.000208749,0.0016170294,0.0016257447,0.0007700404,0.00036163512,0.001701834,0.005502865,0.001203686,0.013375776],"category_scores_gemma":[0.0002390215,0.0014547171,0.0009736222,0.00051802036,0.0004301982,0.01087142,0.0037210952,0.0017547888,0.010013347],"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.000060019167,0.00006721717,0.000027614504,0.00016530993,0.00019938724,0.0003222037,0.00037545554,0.000002648834,0.00005944678,0.70070356,0.26849157,0.029525556],"study_design_scores_gemma":[0.00017780675,0.00016110543,0.000022745406,0.00033705513,0.000069604495,0.000099854806,0.000014387816,0.0007786742,0.0038484915,0.19114664,0.80195606,0.0013875918],"about_ca_topic_score_codex":0.0000020939208,"about_ca_topic_score_gemma":4.2335088e-7,"teacher_disagreement_score":0.5334645,"about_ca_system_score_codex":0.000052634434,"about_ca_system_score_gemma":0.00070809934,"threshold_uncertainty_score":0.9998778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20169944,0.0008093997,0.6632616,0.00043363252,0.0026324817,0.00050598406,0.000010374638,0.00026436255,0.13038273],"genre_scores_gemma":[0.9668873,0.00037040043,0.028450113,0.00019364327,0.00005060236,0.000054321266,0.00019442238,0.0000123813725,0.0037868128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986016,0.00009513745,0.00022187455,0.0006691488,0.0001762718,0.00023597744],"domain_scores_gemma":[0.9992077,0.00003979083,0.00008620017,0.0005899746,0.000012130345,0.00006425075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019049602,0.00018680168,0.00021994796,0.000114418996,0.00003114396,0.00019280665,0.0007240413,0.00023141752,0.00017332184],"category_scores_gemma":[0.000027495342,0.00017704933,0.00008228449,0.00010453912,0.000019897678,0.00015223854,0.0015373874,0.00040544439,0.0003066621],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002064563,0.0019284429,0.016233455,0.00045658238,0.00020281186,0.0011410387,0.012422433,0.000794644,0.0017371493,0.00906023,0.002159851,0.9538427],"study_design_scores_gemma":[0.002912263,0.00024557993,0.23895933,0.0015210898,0.00006344281,0.00015752776,0.00071837794,0.592412,0.0057463045,0.14127819,0.011884582,0.0041013393],"about_ca_topic_score_codex":0.0000996309,"about_ca_topic_score_gemma":0.00038804283,"teacher_disagreement_score":0.94974136,"about_ca_system_score_codex":0.00015856924,"about_ca_system_score_gemma":0.000084316285,"threshold_uncertainty_score":0.7219862},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.5692556e-8,0.0062222164,0.16943789,0.000029844983,0.0017455117,0.00015705345,0.0000013407314,0.00088573375,0.8215203],"genre_scores_gemma":[0.000138451,0.00055550673,0.0057049496,0.00007011908,0.0002859283,0.000012423986,0.00000230759,0.000102206875,0.9931281],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893266,0.000049996823,0.00013310138,0.00038785255,0.00019195305,0.00030445718],"domain_scores_gemma":[0.99907315,0.00002247523,0.00010191956,0.00066787313,0.000022195234,0.000112373986],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000068428395,0.00020639472,0.00028078788,0.00011919667,0.000028678456,0.00019045093,0.0009972525,0.00022308726,0.0037574586],"category_scores_gemma":[0.000013516038,0.00014831552,0.00008265869,0.00016447894,0.000021651978,0.000051030824,0.00014017406,0.0000939433,0.0045629195],"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":[1.209082e-7,0.00001912079,0.000013598428,0.000024084144,0.000015080203,0.000012613079,0.00003646911,5.4189724e-7,4.5766652e-7,0.14529732,0.85275507,0.0018255468],"study_design_scores_gemma":[0.00018791844,0.000012159406,0.0000040539067,0.00006301518,0.0000052867467,0.000014467197,0.00000257657,0.004660177,0.00000354658,0.00009505578,0.9947305,0.0002212986],"about_ca_topic_score_codex":0.00022590662,"about_ca_topic_score_gemma":0.000034185206,"teacher_disagreement_score":0.17160779,"about_ca_system_score_codex":0.000028374623,"about_ca_system_score_gemma":0.000025789042,"threshold_uncertainty_score":0.9971532},"labels":[],"label_agreement":null},{"id":"W4240444301","doi":"10.1093/logcom/exaa064","title":"Editorial","year":2020,"lang":"en","type":"editorial","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Programming language; Computational logic; Computer science; Logic programming; Philosophy of logic; Paraconsistent logic; Type theory; Proof theory; Automated theorem proving; T-norm fuzzy logics; Classical logic; Intuitionistic logic; Mathematical logic; Mathematics; Theoretical computer science; Fuzzy logic; Artificial intelligence; Description logic; Higher-order logic; Propositional calculus; Type (biology); Fuzzy set; Mathematical proof; Fuzzy number","score_opus":0.013852064782993856,"score_gpt":0.26898394551565724,"score_spread":0.2551318807326634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240444301","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066283774,0.0006795434,0.25823358,0.00023230679,0.73968667,0.00004234136,0.0000018717319,0.000026217265,0.0010908392],"genre_scores_gemma":[0.0016005563,0.0002377414,0.0071918974,0.00005560247,0.9908319,8.1697397e-7,0.000009494448,0.000009034168,0.000062967054],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981424,0.00012346798,0.00049804896,0.00024728136,0.0008277697,0.00016098405],"domain_scores_gemma":[0.9974819,0.00056784257,0.00088429294,0.00009836545,0.00080908777,0.00015852181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004990866,0.00020193883,0.00045992696,0.00011760784,0.00009524864,0.00030042752,0.0005887708,0.00044058886,0.0000028426446],"category_scores_gemma":[0.00046825132,0.0001524503,0.00014679521,0.00017501577,0.000038880436,0.00034782474,0.0001751717,0.000807173,0.000016765254],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023976078,0.000027292896,0.0000040447158,0.0000319111,0.000032904733,0.00003031159,0.0003351727,0.00005447265,0.0000047249246,0.00229758,0.9880328,0.00912482],"study_design_scores_gemma":[0.00069751404,0.0007655411,0.000020170413,0.000060579652,0.000040695642,0.000022877175,0.00001800828,0.0021731597,0.0000039970832,0.024407113,0.9716037,0.00018664675],"about_ca_topic_score_codex":0.0000030157614,"about_ca_topic_score_gemma":6.0573797e-7,"teacher_disagreement_score":0.2511452,"about_ca_system_score_codex":0.000060142418,"about_ca_system_score_gemma":0.0004465115,"threshold_uncertainty_score":0.6216743},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0497384,0.00031122664,0.9367745,0.001042506,0.00045727025,0.00016818181,1.3821476e-7,0.00023191399,0.011275865],"genre_scores_gemma":[0.9671622,0.000050919876,0.03213661,0.00045263852,0.00014497925,0.000011210512,3.120502e-7,0.000008739339,0.00003242258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964719,0.00012978874,0.00029552405,0.0009911308,0.0005991276,0.0015125513],"domain_scores_gemma":[0.99819535,0.000445829,0.00006112629,0.0009480049,0.00012031197,0.00022938137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868915,0.00023357836,0.00024165705,0.00025758494,0.00029994315,0.00039374118,0.0035633992,0.000078652614,0.000066891786],"category_scores_gemma":[0.00028986164,0.00019123509,0.000074481715,0.0023388609,0.001522341,0.0007686854,0.0010624451,0.00045811565,0.00018431373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060278867,0.00008187276,0.00084191473,0.0000021707956,0.0000020474693,0.000023251245,0.0003246873,0.0001587724,0.00021794868,0.93047255,0.0000111475765,0.0678576],"study_design_scores_gemma":[0.00033827368,0.0003393009,0.0020106826,0.000021110109,0.000002031882,0.00013922853,0.0000018381787,0.43485227,0.0038058185,0.5569667,0.0012007585,0.000321942],"about_ca_topic_score_codex":0.0000072561747,"about_ca_topic_score_gemma":0.00001373464,"teacher_disagreement_score":0.9174238,"about_ca_system_score_codex":0.00029338503,"about_ca_system_score_gemma":0.0004267318,"threshold_uncertainty_score":0.7798341},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032191124,0.013974612,0.03389227,0.000043541,0.018389205,0.0013590646,0.0017548109,0.00027712595,0.9299875],"genre_scores_gemma":[0.015978498,0.0112857865,0.004446892,0.000080360274,0.00977352,0.00008899082,0.000976461,0.00026384243,0.95710564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.993142,0.00031681088,0.001961424,0.0020343368,0.001505141,0.0010402757],"domain_scores_gemma":[0.9919789,0.0005535647,0.0018251468,0.004092276,0.0009333967,0.00061672257],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001794066,0.0012609027,0.0018646559,0.0005483283,0.00035654605,0.00026199524,0.00342476,0.0007410416,0.0016221686],"category_scores_gemma":[0.00037489014,0.0011297053,0.0005566949,0.00026712907,0.00068475277,0.0009688687,0.0019555977,0.0007608711,0.0074229506],"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.00007716803,0.00042095425,0.00079444016,0.0038993233,0.00078075693,0.00052016595,0.008230254,0.000012801621,0.00010155127,0.6942649,0.28325415,0.007643519],"study_design_scores_gemma":[0.0007698424,0.00058824144,0.0000744938,0.0035475173,0.00027764658,0.00016524969,0.00023761278,0.0036696598,0.00008027309,0.0013883829,0.9876123,0.0015887747],"about_ca_topic_score_codex":0.0005812955,"about_ca_topic_score_gemma":0.00007109587,"teacher_disagreement_score":0.70435816,"about_ca_system_score_codex":0.0001500302,"about_ca_system_score_gemma":0.0006645324,"threshold_uncertainty_score":0.99929047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023159234,0.0055782087,0.59964955,0.027966162,0.0041596843,0.00025983804,0.00000182684,0.00021012423,0.33901536],"genre_scores_gemma":[0.9756154,0.00009393626,0.02229228,0.0013248645,0.00053251267,0.0000010619326,1.5727764e-7,0.000008327626,0.00013146435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813783,0.00023965798,0.00055137614,0.00024114555,0.00047529093,0.00035468978],"domain_scores_gemma":[0.9983709,0.00023291429,0.0003956382,0.00036409573,0.00033601178,0.0003004348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096661376,0.00019197576,0.00039325832,0.00014960622,0.000121882345,0.000117250594,0.0010970989,0.00017310707,0.00009186028],"category_scores_gemma":[0.00093034253,0.00012762567,0.00027829042,0.00040309434,0.00010075953,0.00036043153,0.00011637707,0.0005726836,0.00014247127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008565443,0.00021910969,0.00030197433,0.000007678419,0.000022693888,0.00043054402,0.00007648323,0.000052177347,0.00028629706,0.9966358,0.0006398164,0.0013188921],"study_design_scores_gemma":[0.00053704483,0.00069216656,0.0005231482,0.00001955568,0.000017440556,0.001662681,0.000007556718,0.0003552997,0.0004031621,0.98579425,0.0097930245,0.00019465864],"about_ca_topic_score_codex":4.2220816e-7,"about_ca_topic_score_gemma":3.2120923e-7,"teacher_disagreement_score":0.9524562,"about_ca_system_score_codex":0.000070315524,"about_ca_system_score_gemma":0.00015243991,"threshold_uncertainty_score":0.52044237},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000744615,0.000419575,0.6250911,0.00020868659,0.00056115276,0.00013622787,0.0000022462082,0.000090374175,0.37348318],"genre_scores_gemma":[0.00208509,0.000059385904,0.6972959,0.0007325147,0.0017736057,0.000028718094,0.00005110626,0.00007648588,0.2978972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985181,0.000050254028,0.0003923026,0.0004339033,0.00028614697,0.0003192916],"domain_scores_gemma":[0.9976357,0.0011739549,0.00025414702,0.0007642302,0.00011511405,0.000056860266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003460216,0.0003090086,0.00044876314,0.00019495033,0.00007749045,0.000063875785,0.0009834333,0.00068454555,0.0002622797],"category_scores_gemma":[0.00076752243,0.00025408308,0.000120605204,0.00015943553,0.00015671103,0.00008249189,0.00032792418,0.0005671899,0.0006778932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013458753,0.00006406586,0.000031916818,0.00016079455,0.000029616844,0.000030347135,0.0030825424,0.000056930778,0.0000041331505,0.98026955,0.012963185,0.003305592],"study_design_scores_gemma":[0.00012929454,0.00005932684,0.000014187809,0.00015322633,0.0000128148595,0.000060723884,8.0401577e-7,0.01084313,0.000050204268,0.94122505,0.047172654,0.00027860905],"about_ca_topic_score_codex":0.0000013671992,"about_ca_topic_score_gemma":0.000052236017,"teacher_disagreement_score":0.07558601,"about_ca_system_score_codex":0.00018883254,"about_ca_system_score_gemma":0.0003485509,"threshold_uncertainty_score":0.9999911},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000045979164,0.001728706,0.15255278,0.0010720292,0.0024895528,0.0005404303,0.000023667491,0.00018391927,0.8414043],"genre_scores_gemma":[0.23398224,0.00044438377,0.0032372193,0.0003082471,0.010749596,0.000057318157,0.000085762054,0.000082461615,0.7510528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683803,0.0001973369,0.0008007212,0.0009909889,0.00073758914,0.0004353235],"domain_scores_gemma":[0.9958228,0.0013207269,0.00091131934,0.0006412054,0.0010853576,0.00021860734],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008206948,0.00051342417,0.0009343061,0.0002374814,0.00011875447,0.000175718,0.0005486986,0.00064015226,0.00050390686],"category_scores_gemma":[0.0011206622,0.00042563892,0.0003008016,0.000104976934,0.00030388674,0.00055079383,0.00032252586,0.0008137877,0.0024144854],"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.00003291951,0.00010438025,0.000003819992,0.00009185661,0.00015044921,0.00007405586,0.0001166935,0.0000026816208,0.000015763633,0.97895575,0.008854966,0.011596671],"study_design_scores_gemma":[0.00086595997,0.0010039504,0.00006966704,0.00079264754,0.00032054994,0.0009021492,0.00012159478,0.0015479102,0.00014270081,0.057871297,0.93519753,0.0011640136],"about_ca_topic_score_codex":0.000013899062,"about_ca_topic_score_gemma":0.000005851866,"teacher_disagreement_score":0.9263426,"about_ca_system_score_codex":0.0001377221,"about_ca_system_score_gemma":0.0002598223,"threshold_uncertainty_score":0.9998195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047419626,0.0009892895,0.31243113,0.0053862417,0.00536992,0.0012033688,0.00008942838,0.000701218,0.62640977],"genre_scores_gemma":[0.94884324,0.00032102957,0.007825515,0.0017754222,0.00040780043,0.000050101524,0.0000065911663,0.000029019191,0.040741257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970425,0.0000936941,0.00084556354,0.00040409697,0.0006205454,0.000993641],"domain_scores_gemma":[0.9974792,0.0003051783,0.00037374956,0.001256437,0.00014738916,0.00043801722],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006037535,0.00042232822,0.00041646606,0.00015352185,0.00033676645,0.0006830646,0.0017599748,0.00019102774,0.0022558477],"category_scores_gemma":[0.00020147531,0.0002619621,0.00020447772,0.00039914757,0.00027892066,0.0027374832,0.0010997468,0.000199681,0.024553165],"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.000052618518,0.0004134224,0.0060730246,0.00042733675,0.00024918403,0.00002633584,0.022428535,0.0000044317844,0.00062033423,0.3738943,0.12082787,0.47498262],"study_design_scores_gemma":[0.0027658534,0.0007313379,0.007419959,0.0007614776,0.00006292819,0.00009155571,0.0005337044,0.006648273,0.0032337294,0.0054124943,0.97122127,0.0011174183],"about_ca_topic_score_codex":0.000019056099,"about_ca_topic_score_gemma":0.000009329389,"teacher_disagreement_score":0.90142363,"about_ca_system_score_codex":0.0002896858,"about_ca_system_score_gemma":0.00026663693,"threshold_uncertainty_score":0.99998325},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000679619,0.008456987,0.044438314,0.000023771208,0.0022343765,0.00058964535,0.00022346867,0.00031916372,0.94370747],"genre_scores_gemma":[0.0011477038,0.0047570365,0.018643053,0.00005541103,0.0018596685,0.000043751377,0.0005594583,0.000111667854,0.97282225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99659884,0.00008030296,0.000945207,0.001056357,0.00077682466,0.00054246804],"domain_scores_gemma":[0.99607396,0.0001624281,0.00093089335,0.0023166111,0.00024409752,0.00027202218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078820164,0.0006473067,0.0010362772,0.00032733628,0.00013362548,0.00013560831,0.0019525519,0.0003814221,0.000061572326],"category_scores_gemma":[0.00012904513,0.0005784358,0.00026517446,0.00012616065,0.000097014345,0.0006022257,0.000639944,0.00053516094,0.00040334527],"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.0000061219685,0.000043273758,0.000022643839,0.0004185449,0.00007238867,0.00015034147,0.00033844146,0.000009139525,0.000014365913,0.95879084,0.02455641,0.015577464],"study_design_scores_gemma":[0.00037663392,0.00013623406,0.000016772994,0.0017391542,0.000071775765,0.00012567207,0.00001786299,0.003076867,0.000025358531,0.0031680907,0.99037224,0.00087336375],"about_ca_topic_score_codex":0.000086504966,"about_ca_topic_score_gemma":0.000013797906,"teacher_disagreement_score":0.9658158,"about_ca_system_score_codex":0.00009748469,"about_ca_system_score_gemma":0.00030505788,"threshold_uncertainty_score":0.9996667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074750185,0.0005455117,0.8781242,0.00004837607,0.00078753935,0.00034663765,9.66758e-7,0.00026515216,0.045131445],"genre_scores_gemma":[0.9495741,0.000008177512,0.049583796,0.00019863658,0.00012122574,0.00007975856,0.0000134328575,0.000023014662,0.00039781633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738204,0.00022400521,0.00035322958,0.0011194026,0.00035230332,0.0005690102],"domain_scores_gemma":[0.99800205,0.00050749566,0.00015658894,0.0010510826,0.00009610999,0.00018666295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031495755,0.0004487629,0.0006580142,0.00023466922,0.00010096525,0.0005115698,0.0014882057,0.00029280092,0.000019383197],"category_scores_gemma":[0.00009213889,0.00034606658,0.00011669247,0.00038015217,0.00012728212,0.00016308707,0.0027203143,0.0008268617,0.000057606892],"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.00029566386,0.0027750893,0.10052594,0.007959158,0.0008502359,0.05967268,0.05405082,0.048169453,0.00048043134,0.2928916,0.003384644,0.4289443],"study_design_scores_gemma":[0.0046587833,0.0014798952,0.148652,0.007064555,0.000119285534,0.000944722,0.00053316087,0.80846095,0.00224012,0.017828243,0.0038541658,0.0041640997],"about_ca_topic_score_codex":0.00014344604,"about_ca_topic_score_gemma":0.00055849913,"teacher_disagreement_score":0.874824,"about_ca_system_score_codex":0.00018160135,"about_ca_system_score_gemma":0.00055184413,"threshold_uncertainty_score":0.99989915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016460113,0.000059162958,0.06921778,0.0014036256,0.0005461877,0.00012064943,6.740176e-7,0.0005133676,0.91167843],"genre_scores_gemma":[0.9715078,0.000041328985,0.020647686,0.002867239,0.0002373182,0.000010233628,0.0000028797144,0.0000076272554,0.004677905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875253,0.00003555369,0.00021946518,0.00024322236,0.00026883796,0.00048036262],"domain_scores_gemma":[0.9991137,0.00013421514,0.00009771195,0.00043626616,0.000049952014,0.00016818702],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025487985,0.00016098721,0.00015141544,0.0000945878,0.00018828701,0.00024488603,0.00058456213,0.00010826765,0.00014913768],"category_scores_gemma":[0.00029420026,0.00011969498,0.000081662554,0.0003706249,0.00004406469,0.0011913426,0.00028018572,0.00026952074,0.002098818],"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.000027468444,0.00007715598,0.004731292,0.00000387995,0.000008606277,0.00016614494,0.000417631,0.00006787718,0.000008045278,0.9736028,0.0041249413,0.016764186],"study_design_scores_gemma":[0.0017229948,0.0019922839,0.06272849,0.00008933349,0.000019646428,0.0021344342,0.00022937871,0.06446716,0.0011000173,0.020751888,0.84355134,0.0012130069],"about_ca_topic_score_codex":0.000009336686,"about_ca_topic_score_gemma":0.000003740314,"teacher_disagreement_score":0.95504767,"about_ca_system_score_codex":0.000029545146,"about_ca_system_score_gemma":0.00010130736,"threshold_uncertainty_score":0.99867815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014679371,0.0001056742,0.78673595,0.00029400882,0.0002404645,0.00010481141,5.0595247e-7,0.00014827395,0.21090236],"genre_scores_gemma":[0.7815206,0.000004308437,0.17991729,0.0019718101,0.0001688366,0.00004511501,0.0000013516236,0.000009783935,0.03636088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994228,0.000017929644,0.000081348604,0.00021422586,0.00006054895,0.00020312931],"domain_scores_gemma":[0.9994766,0.00010234076,0.00002188807,0.0002728323,0.000069553156,0.00005677669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028881407,0.00007442018,0.0000803136,0.00003104402,0.00008329602,0.00007451575,0.00044267508,0.00003915034,0.00022481452],"category_scores_gemma":[0.00006813805,0.000053242376,0.0000548883,0.000133475,0.000022959994,0.00018934369,0.000094016366,0.000041028557,0.00022605475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020997816,0.000031362222,0.000015517382,0.00000513621,0.000005611005,0.0000013631751,0.00056312315,0.000008172373,0.00008304174,0.9863536,0.0014486989,0.011482316],"study_design_scores_gemma":[0.00097858,0.0001315681,0.00038931385,0.000007071762,0.0000038159083,0.000016741427,0.00005234548,0.001989498,0.00578038,0.9013856,0.089050986,0.00021411311],"about_ca_topic_score_codex":0.0000039207566,"about_ca_topic_score_gemma":0.000044304816,"teacher_disagreement_score":0.78005266,"about_ca_system_score_codex":0.000020749016,"about_ca_system_score_gemma":0.000084763,"threshold_uncertainty_score":0.29055518},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.4478113e-7,0.00029779828,0.3668195,0.00010927052,0.00039046278,0.00011705307,2.0696905e-7,0.00036506957,0.6319005],"genre_scores_gemma":[0.0010491036,0.000035306006,0.044196513,0.0004631141,0.0003972885,0.000008602144,0.0000048839947,0.000023443938,0.9538217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986018,0.000012912068,0.0002233586,0.0005916394,0.00024588723,0.00032437916],"domain_scores_gemma":[0.9987743,0.000068269495,0.00014407533,0.0007758452,0.000105944484,0.00013155353],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002232523,0.0003089722,0.000328015,0.00010167332,0.0000987748,0.00022540592,0.0011953529,0.0003007579,0.00036347928],"category_scores_gemma":[0.000023232313,0.00022833912,0.00018735343,0.00003139031,0.000065237175,0.00008511587,0.00046892994,0.00027033215,0.0028423904],"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":[3.3687354e-7,0.0000048461193,0.0000027648582,0.000013778487,0.000011540866,0.000013841631,0.000043662796,2.3746021e-7,6.200613e-7,0.82046056,0.004768689,0.17467915],"study_design_scores_gemma":[0.00007960975,0.00008827303,0.0000042127303,0.000036721918,0.000008843807,0.000023242916,7.3128643e-7,0.0005715586,0.000009097199,0.14684986,0.85200685,0.000321007],"about_ca_topic_score_codex":0.0000057981188,"about_ca_topic_score_gemma":0.0000194744,"teacher_disagreement_score":0.8472382,"about_ca_system_score_codex":0.000040883322,"about_ca_system_score_gemma":0.00006522102,"threshold_uncertainty_score":0.997934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074750185,0.0005455117,0.8781242,0.00004837607,0.00078753935,0.00034663765,9.66758e-7,0.00026515216,0.045131445],"genre_scores_gemma":[0.9495741,0.000008177512,0.049583796,0.00019863658,0.00012122574,0.00007975856,0.0000134328575,0.000023014662,0.00039781633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738204,0.00022400521,0.00035322958,0.0011194026,0.00035230332,0.0005690102],"domain_scores_gemma":[0.99800205,0.00050749566,0.00015658894,0.0010510826,0.00009610999,0.00018666295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031495755,0.0004487629,0.0006580142,0.00023466922,0.00010096525,0.0005115698,0.0014882057,0.00029280092,0.000019383197],"category_scores_gemma":[0.00009213889,0.00034606658,0.00011669247,0.00038015217,0.00012728212,0.00016308707,0.0027203143,0.0008268617,0.000057606892],"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.00029566386,0.0027750893,0.10052594,0.007959158,0.0008502359,0.05967268,0.05405082,0.048169453,0.00048043134,0.2928916,0.003384644,0.4289443],"study_design_scores_gemma":[0.0046587833,0.0014798952,0.148652,0.007064555,0.000119285534,0.000944722,0.00053316087,0.80846095,0.00224012,0.017828243,0.0038541658,0.0041640997],"about_ca_topic_score_codex":0.00014344604,"about_ca_topic_score_gemma":0.00055849913,"teacher_disagreement_score":0.874824,"about_ca_system_score_codex":0.00018160135,"about_ca_system_score_gemma":0.00055184413,"threshold_uncertainty_score":0.99989915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0565416,0.000074995114,0.898641,0.0008040595,0.00031985142,0.0002441996,7.596959e-7,0.0005767294,0.04279684],"genre_scores_gemma":[0.748595,0.0000010064365,0.25026855,0.00022695704,0.00014229368,0.000014918749,0.0000018017106,0.0000055595533,0.0007438934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990904,0.00003729499,0.00012615396,0.00032789836,0.00014605769,0.00027221322],"domain_scores_gemma":[0.9993985,0.000031708743,0.0000547844,0.00034190188,0.00008305053,0.000089995796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017063593,0.000121794925,0.00011009512,0.00006622568,0.00011572034,0.00014982882,0.0003117303,0.000050289054,0.000094626856],"category_scores_gemma":[0.000010449329,0.000084481224,0.0000418502,0.00028442644,0.000049893086,0.0003937103,0.000030818526,0.00008510091,0.00013804152],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011690582,0.00010517202,0.00905796,0.000011184333,0.00001791143,0.000008364746,0.00078564585,0.00011697399,0.00034644382,0.022024427,0.0017029905,0.96581125],"study_design_scores_gemma":[0.004086616,0.0017581512,0.015745051,0.000121470875,0.000046603003,0.0006874671,0.0006722281,0.54686576,0.029693944,0.0018330469,0.39667612,0.0018135118],"about_ca_topic_score_codex":0.000019766989,"about_ca_topic_score_gemma":0.00021698522,"teacher_disagreement_score":0.9639977,"about_ca_system_score_codex":0.000036111822,"about_ca_system_score_gemma":0.00007848275,"threshold_uncertainty_score":0.34450445},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018234734,0.00044517175,0.010893755,0.0007668071,0.00079720904,0.00019366454,0.000008832122,0.00036395006,0.98651236],"genre_scores_gemma":[0.009942169,0.0004971556,0.009342761,0.0011924482,0.00039768068,0.000016303891,0.00015485035,0.000039890732,0.97841674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877024,0.000019216734,0.00025466547,0.0005005879,0.00025022757,0.00020503878],"domain_scores_gemma":[0.99848914,0.00008943786,0.0003595996,0.0009053525,0.00003258789,0.00012386119],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000059781134,0.00027247236,0.00023698753,0.0001314231,0.00024189606,0.0006838837,0.0014294402,0.00021144097,0.0011237839],"category_scores_gemma":[0.000010705496,0.00025357405,0.00012333434,0.000018314244,0.00008264578,0.0028859088,0.00049841957,0.00024111808,0.0022040512],"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.0000021244277,0.000010015652,0.0001924405,0.000016378852,0.000024724754,0.000023314582,0.00028580727,6.556727e-7,0.0000057223547,0.9427949,0.025704447,0.030939436],"study_design_scores_gemma":[0.00023809743,0.00006361625,0.0006462668,0.000098854725,0.000013363385,0.0000068491527,0.0000029429516,0.00032709754,0.00025935576,0.45737785,0.5405933,0.00037234882],"about_ca_topic_score_codex":0.0000025663687,"about_ca_topic_score_gemma":0.0000012678029,"teacher_disagreement_score":0.5148889,"about_ca_system_score_codex":0.000022652144,"about_ca_system_score_gemma":0.00019007381,"threshold_uncertainty_score":0.99999166},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007449765,0.015600631,0.05148594,0.00009285231,0.014611309,0.0011988669,0.0023619418,0.00024757223,0.91432637],"genre_scores_gemma":[0.01703118,0.014819259,0.001745627,0.00005444185,0.0054868343,0.00008433127,0.00034820754,0.00020807904,0.96022207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932786,0.00031704898,0.0019321367,0.0019544314,0.0014602115,0.0010575538],"domain_scores_gemma":[0.9921705,0.00081524375,0.0018051199,0.003895285,0.0006868314,0.00062702986],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015804787,0.0012450332,0.0018619887,0.0005395303,0.00029883432,0.00019510309,0.0032341264,0.0006989814,0.00076787145],"category_scores_gemma":[0.00036326307,0.0009517336,0.00058518216,0.00019185984,0.00048261383,0.0010641648,0.0017647631,0.00065357843,0.005502655],"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.000035430832,0.00015930747,0.00047330328,0.0016314118,0.0003553554,0.0003024782,0.001431403,0.0000037464695,0.00010910125,0.93959314,0.041268654,0.014636661],"study_design_scores_gemma":[0.0010337792,0.0003631703,0.00007763162,0.0055925082,0.00023048563,0.00015702264,0.00009431314,0.00095935893,0.000080114194,0.0020147876,0.9877533,0.0016435605],"about_ca_topic_score_codex":0.0002783921,"about_ca_topic_score_gemma":0.00003423724,"teacher_disagreement_score":0.9464846,"about_ca_system_score_codex":0.00017287787,"about_ca_system_score_gemma":0.0006640095,"threshold_uncertainty_score":0.9992933},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.258074e-7,0.0002681466,0.11982423,0.0010988124,0.0014539474,0.00007631321,3.8882197e-7,0.00029547702,0.87698233],"genre_scores_gemma":[0.00054142467,0.00008079091,0.008499914,0.00016863713,0.002300578,0.0000021964288,0.000006084396,0.000014838713,0.98838556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990246,0.0000044814838,0.00015026222,0.0004827758,0.0001763229,0.00016154084],"domain_scores_gemma":[0.99913806,0.000012388145,0.00008040735,0.0006156475,0.000085770786,0.00006774003],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000092651004,0.00019524184,0.00018313559,0.00009491235,0.000064261614,0.00009959748,0.0005705941,0.00019733362,0.0018852423],"category_scores_gemma":[0.000011529832,0.000157674,0.00010661624,0.000027389662,0.000038868442,0.00016812552,0.00020088702,0.00020943316,0.003798621],"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":[4.7661223e-7,0.0000055806663,3.404415e-7,0.000006422126,0.000010448082,0.000007260572,0.000055436154,0.000002828545,0.000003363544,0.9504062,0.03268744,0.016814228],"study_design_scores_gemma":[0.00007097821,0.000037112455,0.000005032252,0.000012105218,0.0000053870785,0.000021793012,4.730703e-7,0.00006495928,0.00006599267,0.3267485,0.6727881,0.00017956826],"about_ca_topic_score_codex":0.00000780949,"about_ca_topic_score_gemma":0.000010716332,"teacher_disagreement_score":0.64010066,"about_ca_system_score_codex":0.00010783015,"about_ca_system_score_gemma":0.00011358137,"threshold_uncertainty_score":0.9990272},"labels":[],"label_agreement":null},{"id":"W4253372947","doi":"10.1093/logcom/13.1.3","title":"Controlled Revision - An algorithmic approach for belief revision","year":2003,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Belief revision; Library science; Operations research; Artificial intelligence; Mathematics","score_opus":0.029376725856498156,"score_gpt":0.29151167373474673,"score_spread":0.2621349478782486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253372947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006230458,0.002255037,0.98940736,0.00010949706,0.00028282928,0.00030165966,3.1523814e-7,0.000020578045,0.0013922391],"genre_scores_gemma":[0.62800926,0.00019183154,0.37140608,0.00014975457,0.00017207098,0.0000022665554,0.000002543727,0.0000049092246,0.00006127894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987568,0.00022257623,0.00045344487,0.00020272536,0.00021207471,0.00015236695],"domain_scores_gemma":[0.99875116,0.00015791506,0.00048353587,0.00010982775,0.0003859119,0.000111628375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014491824,0.00012245415,0.00037190193,0.00011484335,0.00016808804,0.00016032587,0.00021908894,0.00007212426,0.0000023895282],"category_scores_gemma":[0.00020472148,0.0000817764,0.00012411199,0.000152199,0.00002400275,0.000490791,0.000026430165,0.00011662388,0.0000013646853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030295766,0.000704763,0.00023369872,0.00013461393,0.00008104654,0.00002098384,0.0018495703,0.004995193,0.00040281622,0.2641067,0.0027354988,0.7244322],"study_design_scores_gemma":[0.0096535,0.0031235723,0.000649463,0.00010294206,0.00007620282,0.00050135644,0.00025668702,0.88886476,0.00011176172,0.09077514,0.005563673,0.0003209617],"about_ca_topic_score_codex":6.03177e-7,"about_ca_topic_score_gemma":7.430184e-8,"teacher_disagreement_score":0.8838695,"about_ca_system_score_codex":0.000029000003,"about_ca_system_score_gemma":0.00006168733,"threshold_uncertainty_score":0.3334745},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025245618,0.0074822265,0.031597342,0.000025319676,0.0054026814,0.0006651189,0.0015952038,0.00025237876,0.9529545],"genre_scores_gemma":[0.0014361249,0.0048077446,0.012444742,0.00008093288,0.0035346944,0.00007154455,0.0017356123,0.0001370642,0.9757515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99626726,0.0001007321,0.0010831167,0.0011929378,0.0008566416,0.00049932936],"domain_scores_gemma":[0.9945899,0.00033883398,0.0009612141,0.003369791,0.0004284967,0.000311719],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007722855,0.00066887867,0.0010331922,0.0003709352,0.00014436094,0.00009990749,0.0020739494,0.00025116635,0.00042706556],"category_scores_gemma":[0.00020446643,0.0005786987,0.0002735651,0.00011881641,0.00028291534,0.00069514714,0.0017051954,0.0003958534,0.0017472495],"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.000009790919,0.00007599389,0.00008118212,0.0007220441,0.00017628993,0.00016471995,0.00039498636,0.0000013759794,0.000019110841,0.7665347,0.22968261,0.0021372281],"study_design_scores_gemma":[0.0002999227,0.00012453742,0.000012850345,0.0011693446,0.00008741874,0.000097496726,0.000029350913,0.00039486104,0.00003602455,0.00083807117,0.9962261,0.0006840209],"about_ca_topic_score_codex":0.00022986533,"about_ca_topic_score_gemma":0.000119337106,"teacher_disagreement_score":0.7665435,"about_ca_system_score_codex":0.00010075941,"about_ca_system_score_gemma":0.00051258574,"threshold_uncertainty_score":0.99966645},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.7788994e-7,0.00042289938,0.1601689,0.000095287825,0.0006489175,0.00016686464,4.816314e-7,0.0004809982,0.83801496],"genre_scores_gemma":[0.00031571102,0.000037865488,0.057116453,0.0003321356,0.00060295145,0.000007607166,0.0000045444904,0.00002246338,0.94156027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985724,0.000009493334,0.00021579427,0.0006191867,0.00024716326,0.00033596618],"domain_scores_gemma":[0.9987556,0.000043804153,0.00013591103,0.000777449,0.00016009287,0.00012714035],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018687184,0.00030487493,0.00028402594,0.000103461505,0.00011335953,0.00024087689,0.0012381054,0.0003067598,0.0016262592],"category_scores_gemma":[0.000019926349,0.00022454614,0.00017112753,0.00003919022,0.00011701893,0.00015211664,0.0005708007,0.00022230051,0.005865782],"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":[5.673087e-7,0.000009063317,0.0000024618712,0.000011465963,0.000016890928,0.000024560355,0.00014364732,3.6256203e-8,8.250211e-7,0.9160399,0.015538516,0.0682121],"study_design_scores_gemma":[0.000068610745,0.00012698147,0.0000032716862,0.00003737966,0.000008533227,0.000026094407,0.0000019416987,0.000221432,0.000017195593,0.21112956,0.7880579,0.00030108163],"about_ca_topic_score_codex":0.000004846671,"about_ca_topic_score_gemma":0.00002587243,"teacher_disagreement_score":0.7725194,"about_ca_system_score_codex":0.000048197555,"about_ca_system_score_gemma":0.00009113203,"threshold_uncertainty_score":0.9992864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01387184,0.00010836016,0.07481862,0.000062184525,0.00047024456,0.000090699854,7.270501e-7,0.00029505396,0.91028225],"genre_scores_gemma":[0.9794003,0.000009790702,0.017163374,0.0011984913,0.00005156567,0.0000106391635,7.6643346e-7,0.000003756844,0.0021613305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991999,0.000018308569,0.00017336276,0.00015914068,0.0001258904,0.0003233731],"domain_scores_gemma":[0.99936795,0.000022965201,0.000070839385,0.00036938913,0.00006886789,0.00009997986],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018917203,0.00011627319,0.0001129366,0.000056905188,0.000093485636,0.000067639965,0.00083226676,0.00007356353,0.00035864554],"category_scores_gemma":[0.00004109043,0.000082883875,0.0000583788,0.00018428867,0.00009397252,0.00073388434,0.00022503166,0.00011039966,0.0019782588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072445146,0.000039892533,0.0031401068,0.0000069825965,0.000010072016,0.000100058875,0.0037726695,0.0000025147463,0.00004967604,0.97312105,0.0010117699,0.018737955],"study_design_scores_gemma":[0.0030920405,0.0025693711,0.210837,0.00009271377,0.00003949276,0.0029389474,0.0006885529,0.017910236,0.018122004,0.48225537,0.25847653,0.0029777426],"about_ca_topic_score_codex":0.000035874105,"about_ca_topic_score_gemma":0.00001008565,"teacher_disagreement_score":0.9655284,"about_ca_system_score_codex":0.000014192411,"about_ca_system_score_gemma":0.000073272444,"threshold_uncertainty_score":0.9987988},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20169944,0.0008093997,0.6632616,0.00043363252,0.0026324817,0.00050598406,0.000010374638,0.00026436255,0.13038273],"genre_scores_gemma":[0.9668873,0.00037040043,0.028450113,0.00019364327,0.00005060236,0.000054321266,0.00019442238,0.0000123813725,0.0037868128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986016,0.00009513745,0.00022187455,0.0006691488,0.0001762718,0.00023597744],"domain_scores_gemma":[0.9992077,0.00003979083,0.00008620017,0.0005899746,0.000012130345,0.00006425075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019049602,0.00018680168,0.00021994796,0.000114418996,0.00003114396,0.00019280665,0.0007240413,0.00023141752,0.00017332184],"category_scores_gemma":[0.000027495342,0.00017704933,0.00008228449,0.00010453912,0.000019897678,0.00015223854,0.0015373874,0.00040544439,0.0003066621],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002064563,0.0019284429,0.016233455,0.00045658238,0.00020281186,0.0011410387,0.012422433,0.000794644,0.0017371493,0.00906023,0.002159851,0.9538427],"study_design_scores_gemma":[0.002912263,0.00024557993,0.23895933,0.0015210898,0.00006344281,0.00015752776,0.00071837794,0.592412,0.0057463045,0.14127819,0.011884582,0.0041013393],"about_ca_topic_score_codex":0.0000996309,"about_ca_topic_score_gemma":0.00038804283,"teacher_disagreement_score":0.94974136,"about_ca_system_score_codex":0.00015856924,"about_ca_system_score_gemma":0.000084316285,"threshold_uncertainty_score":0.7219862},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009935125,0.023260415,0.021181062,0.00008226847,0.009884175,0.001344981,0.0011648791,0.0002868308,0.94269603],"genre_scores_gemma":[0.0182393,0.020128518,0.0042994143,0.0001284572,0.005530543,0.00005962805,0.0010391145,0.00020444504,0.95037055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.993118,0.000306161,0.0020322176,0.001952211,0.0015434216,0.0010479736],"domain_scores_gemma":[0.9927356,0.00050076336,0.0017563036,0.00374399,0.0006380052,0.000625313],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0015481994,0.0013065414,0.002011592,0.00058553356,0.00031830723,0.00025782676,0.0032008127,0.0007376728,0.00039989475],"category_scores_gemma":[0.000295659,0.0011914058,0.0006151454,0.00028084285,0.00033908035,0.0009767811,0.0011174359,0.0009497521,0.0025880367],"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.000052442498,0.00041988379,0.00037831755,0.0020913337,0.0004174768,0.00068504014,0.00299073,0.000048833303,0.000075935815,0.86935765,0.074635476,0.048846863],"study_design_scores_gemma":[0.00087364664,0.00058848213,0.00016997757,0.0035960157,0.0002860114,0.00020224438,0.00013249867,0.0036814453,0.000052926847,0.0017470291,0.9869386,0.0017311395],"about_ca_topic_score_codex":0.0005194406,"about_ca_topic_score_gemma":0.00004632745,"teacher_disagreement_score":0.9123031,"about_ca_system_score_codex":0.0001618238,"about_ca_system_score_gemma":0.0006267838,"threshold_uncertainty_score":0.9999686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16268533,0.00021728214,0.8025934,0.00453555,0.0027084548,0.002421633,0.00008885423,0.00030917663,0.024440289],"genre_scores_gemma":[0.9912483,0.0000110185565,0.008017979,0.00027559884,0.00009587544,0.00005945162,0.0000017740815,0.000011262125,0.00027875765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787235,0.000028533275,0.00046634767,0.0005465723,0.00073391816,0.0003522766],"domain_scores_gemma":[0.9982991,0.0001487153,0.0004412875,0.00026776324,0.0007637439,0.00007936427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094217365,0.00019508682,0.00024112975,0.00013291904,0.0008209592,0.00019305517,0.0023908739,0.000064521286,0.00017229615],"category_scores_gemma":[0.00045865527,0.00015770075,0.00016606304,0.00062104204,0.00018074624,0.00039585485,0.0009280055,0.00036259115,0.000023005578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043756907,0.00013827285,0.00011089396,0.000028836852,0.000009102943,3.8501398e-7,0.00079897145,0.00029173287,0.017500175,0.96482396,0.00033392408,0.015919983],"study_design_scores_gemma":[0.00005911311,0.00042382945,0.00008620892,0.00009864455,0.000016178346,0.000025429477,0.00061564764,0.23148893,0.17732571,0.5880101,0.0015445035,0.0003057377],"about_ca_topic_score_codex":0.000020935191,"about_ca_topic_score_gemma":0.000002609509,"teacher_disagreement_score":0.8285629,"about_ca_system_score_codex":0.000113200374,"about_ca_system_score_gemma":0.00023302094,"threshold_uncertainty_score":0.643085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63177305,0.00022980012,0.12274087,0.010773825,0.004643054,0.0023173995,0.000011337748,0.0007015337,0.2268091],"genre_scores_gemma":[0.99630266,0.0000035000328,0.0020866825,0.0007075074,0.00008476611,0.00010704305,2.741948e-7,0.0000131111765,0.0006944222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979076,0.00003997348,0.0003916665,0.00058173225,0.0006266989,0.000452331],"domain_scores_gemma":[0.998745,0.00019338848,0.0002596101,0.00034464383,0.00031250782,0.0001448366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068339554,0.00022676338,0.00027013832,0.00017735579,0.0005987402,0.00023295255,0.0031192403,0.000046700872,0.000056564397],"category_scores_gemma":[0.00064518384,0.00017921497,0.00012786608,0.0010114138,0.00010324439,0.0002529581,0.0015691064,0.0004418939,0.00015695045],"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.00004954798,0.000144568,0.00026731336,0.000043585682,0.000012436708,0.0000030509448,0.0056384187,0.0004174586,0.045787506,0.9047647,0.00072834536,0.042143054],"study_design_scores_gemma":[0.000048375066,0.0008663458,0.0005646265,0.00022199776,0.000014391727,0.000020529404,0.0012329353,0.03464479,0.73844904,0.2218897,0.0015781836,0.00046910837],"about_ca_topic_score_codex":0.000028734825,"about_ca_topic_score_gemma":0.000003361897,"teacher_disagreement_score":0.6926615,"about_ca_system_score_codex":0.00009417702,"about_ca_system_score_gemma":0.00011851659,"threshold_uncertainty_score":0.7308175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92858106,0.000031364696,0.005890096,0.0064920126,0.0018772071,0.00096827437,0.000022978826,0.0003476635,0.05578935],"genre_scores_gemma":[0.9972267,0.000007678128,0.0013609645,0.00033078497,0.00014536554,0.00013986189,0.000001528491,0.00001325819,0.00077384873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978907,0.00001921246,0.000419085,0.00061514834,0.00064871623,0.00040712798],"domain_scores_gemma":[0.99865836,0.00011619123,0.00028748746,0.00037499538,0.00039957173,0.00016340724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036545482,0.00022921486,0.0002419263,0.00013258254,0.00059026165,0.00038032612,0.0028188252,0.00005736062,0.00053919497],"category_scores_gemma":[0.00038432959,0.00018081997,0.00014290844,0.0008701241,0.0001420543,0.00036440074,0.001081023,0.00044338903,0.0003947094],"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.00007565834,0.00051312806,0.00023898693,0.00001047575,0.000031436382,0.0000021281774,0.01016008,0.000072322146,0.034314293,0.8007307,0.00091347075,0.15293731],"study_design_scores_gemma":[0.000059672024,0.0011820643,0.0011334353,0.00013424037,0.000032691387,0.000020746613,0.008533794,0.007564588,0.5932378,0.376804,0.01061069,0.0006862626],"about_ca_topic_score_codex":0.00045073158,"about_ca_topic_score_gemma":0.00005350577,"teacher_disagreement_score":0.55892354,"about_ca_system_score_codex":0.00010424261,"about_ca_system_score_gemma":0.00020293755,"threshold_uncertainty_score":0.73736244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8170314,0.00019842053,0.003994198,0.033487804,0.0039771833,0.0010517391,0.000035484758,0.00014362286,0.14008017],"genre_scores_gemma":[0.9989683,0.000081187085,0.0003758703,0.00011071526,0.000055869867,0.000060741797,7.833879e-7,0.000007969677,0.0003385673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752367,0.000052371917,0.0007871802,0.0004308652,0.0009056237,0.00030030232],"domain_scores_gemma":[0.9980542,0.00022334387,0.0006678836,0.00030584814,0.0006942401,0.00005446096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348851,0.00019721872,0.00025660993,0.00016978414,0.0003693053,0.00021187878,0.0035728998,0.00004951712,0.00010148501],"category_scores_gemma":[0.0004602357,0.00013123706,0.0001716224,0.00063889317,0.00032908804,0.00028046442,0.0009523003,0.0004936241,0.000019093592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006979855,0.00023874997,0.00088324025,0.000016521577,0.000019967809,9.760817e-7,0.0016222491,0.00040120078,0.0031789453,0.98702514,0.000087496664,0.006455701],"study_design_scores_gemma":[0.00007892691,0.00031504562,0.0029667118,0.00015865838,0.000007977921,0.000015339754,0.0034924487,0.10089709,0.12314298,0.7679569,0.00070234697,0.00026557143],"about_ca_topic_score_codex":0.00014132114,"about_ca_topic_score_gemma":0.00012278683,"teacher_disagreement_score":0.21906824,"about_ca_system_score_codex":0.0001500947,"about_ca_system_score_gemma":0.00017216896,"threshold_uncertainty_score":0.66393965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.663126,0.0005853973,0.066825025,0.060105637,0.00714195,0.0019800193,0.00011136262,0.00044326545,0.19968136],"genre_scores_gemma":[0.997519,0.00008788887,0.001717169,0.00024926534,0.00006973682,0.00004209221,0.0000011644091,0.000009902855,0.0003037674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977382,0.00002901946,0.0006730154,0.0005000567,0.00078380835,0.0002758934],"domain_scores_gemma":[0.9981763,0.00012198706,0.0006588581,0.00024646637,0.0007143735,0.000082062405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007980685,0.00021430076,0.00029872995,0.00021662026,0.00032575135,0.0001330609,0.0023477147,0.000057602832,0.00018612166],"category_scores_gemma":[0.00040188152,0.0001667285,0.00015301215,0.00043086868,0.00028843665,0.00028759756,0.0015967484,0.00039342578,0.000023315399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004716549,0.00024124044,0.00066479354,0.000036993333,0.000030091924,0.0000010043507,0.001923107,0.00006697294,0.010243041,0.97528636,0.00014721535,0.011311992],"study_design_scores_gemma":[0.00008775125,0.00052140834,0.0011917189,0.00020005216,0.000016393415,0.000056735014,0.0013883131,0.045190625,0.13966726,0.81076515,0.0006096979,0.00030488014],"about_ca_topic_score_codex":0.00006763719,"about_ca_topic_score_gemma":0.000016271712,"teacher_disagreement_score":0.33439302,"about_ca_system_score_codex":0.000108818684,"about_ca_system_score_gemma":0.00011071397,"threshold_uncertainty_score":0.6798991},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7424469,0.0001403842,0.17366304,0.0004778161,0.00041930637,0.0004907159,0.0000027678423,0.00006332268,0.08229574],"genre_scores_gemma":[0.99561876,0.0000045318975,0.003984265,0.000024790776,0.000008024421,0.000005290374,2.2890752e-7,0.0000013513371,0.00035274337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947494,0.00009178708,0.0001086743,0.000120860605,0.0001274598,0.00007630513],"domain_scores_gemma":[0.9995678,0.00016268449,0.00005570404,0.00017877255,0.000025358555,0.000009658249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002825159,0.000037092825,0.00006835168,0.000068971676,0.00010331105,0.000017500422,0.00020908374,0.000010613276,0.0000066089265],"category_scores_gemma":[0.00004501973,0.000026176025,0.000016731863,0.00035526528,0.000037093843,0.00010190876,0.00017856338,0.00007471992,4.0617874e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005677591,0.0013934488,0.027988123,0.0003138783,0.000048243604,0.000052786185,0.097881384,0.0017176234,0.0392243,0.62010336,0.00244122,0.20877883],"study_design_scores_gemma":[0.0009264341,0.0013719953,0.057884946,0.000052904183,0.000024592266,0.0004507991,0.007564084,0.8933877,0.013323616,0.017906303,0.006742114,0.0003645352],"about_ca_topic_score_codex":0.0002016692,"about_ca_topic_score_gemma":0.00010696994,"teacher_disagreement_score":0.89167005,"about_ca_system_score_codex":0.000010776487,"about_ca_system_score_gemma":0.000045402412,"threshold_uncertainty_score":0.10674273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6678895,0.019419884,0.054866277,0.1982347,0.006875751,0.0078014596,0.00013371151,0.0006996218,0.04407913],"genre_scores_gemma":[0.99704814,0.00006595418,0.00043475974,0.0016965214,0.00015854929,0.000090334084,0.0000023304463,0.00001368925,0.0004897368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806935,0.00043064333,0.00031615506,0.00041640305,0.0004197562,0.00034768137],"domain_scores_gemma":[0.99871594,0.00021021474,0.00013362494,0.0007620534,0.00007730205,0.000100882644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011296631,0.00018067172,0.00028488607,0.00013423347,0.00036956198,0.00016498762,0.0014729206,0.00004020608,0.000014824561],"category_scores_gemma":[0.000039400074,0.000113894675,0.000059014976,0.0006472926,0.00013619439,0.00019973873,0.001423259,0.00030450348,0.0000096701515],"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.0000906838,0.0007000069,0.005376611,0.00018728088,0.00010766155,0.00003393424,0.04079444,0.06765337,0.00043410313,0.86166507,0.019486455,0.0034703647],"study_design_scores_gemma":[0.0016931053,0.0020860957,0.0056531853,0.00021033385,0.000072181436,0.00027668386,0.005744066,0.43781233,0.001545183,0.06286904,0.4807935,0.0012442822],"about_ca_topic_score_codex":0.00033806486,"about_ca_topic_score_gemma":0.00013252915,"teacher_disagreement_score":0.79879606,"about_ca_system_score_codex":0.00008645507,"about_ca_system_score_gemma":0.00007186206,"threshold_uncertainty_score":0.46444902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35115376,0.0007512361,0.49812925,0.011139256,0.00045147983,0.00030839906,0.0000031213162,0.0005609719,0.1375025],"genre_scores_gemma":[0.8653978,0.00011168542,0.13142996,0.00009160189,0.00002189745,0.000016283475,0.000008977159,0.000013868442,0.0029079143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977379,0.000922263,0.00023820612,0.00052695355,0.00025192733,0.00032277298],"domain_scores_gemma":[0.9970027,0.0006531317,0.0001622534,0.0013087608,0.00066096603,0.00021213952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025622705,0.00015231819,0.00019014366,0.00011120323,0.00041918425,0.00050667685,0.001139765,0.00012328755,0.000043090622],"category_scores_gemma":[0.00084596855,0.0001660266,0.00006823569,0.00040754344,0.00018547822,0.00037645886,0.0006580108,0.000351787,0.00006382975],"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.0000029043827,0.00033712835,0.002455117,0.000028765964,0.000024094568,0.000004104941,0.011471712,6.8554044e-7,0.04045504,0.763387,0.0003202031,0.18151323],"study_design_scores_gemma":[0.0039082277,0.000004857577,0.12679046,0.0010256032,0.00007847542,0.00017381045,0.00031212662,0.13190283,0.51381546,0.03600046,0.18380815,0.0021795616],"about_ca_topic_score_codex":0.0002267859,"about_ca_topic_score_gemma":0.00097395695,"teacher_disagreement_score":0.72738653,"about_ca_system_score_codex":0.00002373861,"about_ca_system_score_gemma":0.000106219704,"threshold_uncertainty_score":0.6770368},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010509237,0.0007089582,0.43921,0.00047651178,0.0010627834,0.00025774224,0.000009329116,0.00035794472,0.5568658],"genre_scores_gemma":[0.87461364,0.00041346007,0.09093197,0.0005899745,0.00023650311,0.00014272152,0.000052462063,0.00002150926,0.032997753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987786,0.00010555195,0.0002472016,0.00047794188,0.0002199751,0.00017074712],"domain_scores_gemma":[0.998489,0.00008422772,0.0001996379,0.0010600128,0.000108033135,0.000059046954],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002716822,0.00015207,0.00028779538,0.00014958551,0.00009647668,0.000070928385,0.0015117275,0.00011137879,0.0014680513],"category_scores_gemma":[0.000078817895,0.00012595058,0.00019601043,0.0003387355,0.000030523068,0.00007302559,0.0036024495,0.00044000175,0.00006081566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024845767,0.00016198456,0.0006075882,0.00013803484,0.00005738581,0.0000132487485,0.00071615,0.0002747008,0.00009965361,0.97797376,0.014209559,0.005745443],"study_design_scores_gemma":[0.0008895072,0.00051668694,0.015288494,0.0002668757,0.00014227106,0.000087149165,0.0003355417,0.075527675,0.0017821837,0.48056924,0.4225984,0.0019959852],"about_ca_topic_score_codex":0.00007087767,"about_ca_topic_score_gemma":0.000007976215,"teacher_disagreement_score":0.87356275,"about_ca_system_score_codex":0.00006766398,"about_ca_system_score_gemma":0.00017222016,"threshold_uncertainty_score":0.9994447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035989285,0.00036090473,0.9588083,0.0063114497,0.00044371813,0.0015400916,0.000080091566,0.0004942466,0.02836228],"genre_scores_gemma":[0.7030237,0.000059552443,0.29067922,0.00021584045,0.000112716756,0.0006872157,0.0005629659,0.00005021248,0.0046086083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934307,0.0035622537,0.00058662787,0.0014148001,0.00044791523,0.0005577345],"domain_scores_gemma":[0.986097,0.0037582475,0.000542554,0.0028394905,0.0065081855,0.0002545513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0056434376,0.00043869528,0.0004995996,0.00026381342,0.0009178503,0.00064496044,0.0028462617,0.00041074769,0.0001329888],"category_scores_gemma":[0.0029148464,0.0004305774,0.0003146592,0.00057423074,0.0004829922,0.00015944456,0.0018245785,0.00064973615,0.0001355636],"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.000063467116,0.0022010396,0.0009216107,0.0007572697,0.00020564387,0.000005743198,0.013211695,0.0007970901,0.001428925,0.94090414,0.0031777006,0.036325652],"study_design_scores_gemma":[0.0014892842,0.00000587341,0.00052649365,0.0010472764,0.000048500933,0.000006329919,0.000051589577,0.83218795,0.109420985,0.04634039,0.008130192,0.00074513315],"about_ca_topic_score_codex":0.00032591028,"about_ca_topic_score_gemma":0.00047015745,"teacher_disagreement_score":0.8945638,"about_ca_system_score_codex":0.00024786268,"about_ca_system_score_gemma":0.00089110446,"threshold_uncertainty_score":0.9998146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00754662,0.00016584442,0.98241055,0.0016408735,0.00027238124,0.00016574917,0.000004776968,0.0000664785,0.007726742],"genre_scores_gemma":[0.9543398,0.000014760455,0.044926737,0.000072574374,0.00002190373,0.000025729008,0.000005108141,0.0000044159656,0.0005889857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988448,0.000092920316,0.00031766517,0.00026368408,0.00028984115,0.00019105902],"domain_scores_gemma":[0.99850816,0.0008752069,0.00009262492,0.00039429028,0.00009993329,0.0000297862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028119894,0.00011301426,0.00012422982,0.00012743364,0.00021190857,0.000058238962,0.0006410816,0.000042950505,0.000022502058],"category_scores_gemma":[0.000034388562,0.00008175294,0.00007792981,0.0004524866,0.00007702945,0.00011039649,0.000016618682,0.00014661443,0.00003390768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037264344,0.00078633474,0.00057240156,0.000012380728,0.000027514972,0.0000054073025,0.00018510697,0.29392606,0.000030618623,0.6481654,0.0004612994,0.055790238],"study_design_scores_gemma":[0.0012226342,0.000458792,0.043043263,0.000034012737,0.000012923284,0.000026071424,0.00008638153,0.23917472,0.00055630447,0.7113269,0.0037862253,0.0002717683],"about_ca_topic_score_codex":0.00007531668,"about_ca_topic_score_gemma":0.00015441688,"teacher_disagreement_score":0.94679314,"about_ca_system_score_codex":0.00006579572,"about_ca_system_score_gemma":0.00008218735,"threshold_uncertainty_score":0.33337882},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055273417,0.0006588837,0.1936232,0.0013170091,0.0011319986,0.000291492,0.0000059576323,0.00024060001,0.74745744],"genre_scores_gemma":[0.9888975,0.000030671028,0.0075836997,0.0002571716,0.00009885527,0.000017590492,0.0000024106794,0.000005245576,0.0031068546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987102,0.00012543146,0.00020077227,0.00039211495,0.0003798149,0.00019163491],"domain_scores_gemma":[0.9982524,0.0003586516,0.00013496417,0.0009820586,0.00020029221,0.00007163371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799348,0.00018194727,0.0002578211,0.00004846182,0.00005381013,0.00012468547,0.0022964953,0.00019629224,0.00013533104],"category_scores_gemma":[0.0003526687,0.00008676465,0.00013670305,0.00007340622,0.00010823356,0.000047953024,0.0024735837,0.00037775078,0.00029544524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002370781,0.000056583904,0.000084797975,0.000013240715,0.000014839683,0.0000046438836,0.00053491036,0.00006535738,0.0000085237525,0.98344123,0.013777178,0.0019963377],"study_design_scores_gemma":[0.000112229274,0.00013051204,0.001370258,0.00006161921,0.000009251331,0.000008737001,0.00007202292,0.012803612,0.0010644534,0.9814034,0.0027024942,0.0002614173],"about_ca_topic_score_codex":0.000053987715,"about_ca_topic_score_gemma":0.00002482249,"teacher_disagreement_score":0.9336241,"about_ca_system_score_codex":0.00003479505,"about_ca_system_score_gemma":0.00020457542,"threshold_uncertainty_score":0.4267498},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18231261,0.0001642664,0.814541,0.00013608228,0.00043589473,0.00030139723,0.0000039615334,0.00013150375,0.0019733333],"genre_scores_gemma":[0.8698433,0.000001128761,0.1298088,0.0002531869,0.000045110413,0.0000084504,0.000004488673,0.0000044118533,0.000031133906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991582,0.00007006018,0.00018525861,0.00022091233,0.0001844543,0.00018108293],"domain_scores_gemma":[0.99921256,0.000018716488,0.000100660836,0.0003294719,0.00020291336,0.0001356932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032983784,0.00009027912,0.000121216486,0.00007680339,0.000056053053,0.000045538312,0.0003193293,0.00003367189,0.00003827646],"category_scores_gemma":[0.000014829141,0.00007455129,0.00003990447,0.00018072952,0.00003195802,0.00035123425,0.00007295149,0.000031486918,0.00001917153],"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.00004429878,0.0031756195,0.27262896,0.00022752071,0.00014785312,0.00007620646,0.064991914,0.0007711741,0.044478416,0.3044199,0.0023106863,0.30672744],"study_design_scores_gemma":[0.0038735587,0.00094199233,0.04305657,0.000033052398,0.000035500532,0.000013128189,0.0024650285,0.88545626,0.060905892,0.000923686,0.0017589225,0.0005364282],"about_ca_topic_score_codex":0.0009345109,"about_ca_topic_score_gemma":0.0005021975,"teacher_disagreement_score":0.88468504,"about_ca_system_score_codex":0.00005426805,"about_ca_system_score_gemma":0.00019575557,"threshold_uncertainty_score":0.30401134},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049618233,0.0063868035,0.02884225,0.0000185739,0.005894562,0.00052898104,0.0003370059,0.00022703638,0.95771515],"genre_scores_gemma":[0.0037177564,0.0036429693,0.0071228975,0.000061487786,0.003251686,0.00005633298,0.0003795705,0.00012505299,0.98164225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702275,0.00006899348,0.0008950214,0.0009316089,0.00064383243,0.00043779844],"domain_scores_gemma":[0.9963163,0.00021457257,0.0007319429,0.0021548562,0.00033383793,0.00024849264],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006458563,0.0005386755,0.0008750574,0.00027553734,0.00011495161,0.000104933344,0.0015133584,0.00031379698,0.00021288038],"category_scores_gemma":[0.0001076624,0.00048004196,0.00025230923,0.00008356315,0.00020708691,0.0004444258,0.0009184282,0.00034805876,0.00096943637],"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.000011688343,0.000069932685,0.00011420178,0.001252978,0.00025337795,0.00026790434,0.0011598397,0.0000048760226,0.00006170942,0.86096257,0.13245581,0.0033851063],"study_design_scores_gemma":[0.00026267988,0.00012229908,0.000014208922,0.0012861472,0.000059495906,0.000097143784,0.000036071968,0.0006118202,0.00003820377,0.00086565875,0.99597144,0.0006348388],"about_ca_topic_score_codex":0.00013880122,"about_ca_topic_score_gemma":0.000058621034,"teacher_disagreement_score":0.8635156,"about_ca_system_score_codex":0.00009840687,"about_ca_system_score_gemma":0.00036745158,"threshold_uncertainty_score":0.99980843},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09210356,0.0018577187,0.3478852,0.004984406,0.0033701402,0.002334373,0.004312583,0.007185053,0.53596693],"genre_scores_gemma":[0.98338854,0.000024754718,0.013165028,0.00038612436,0.0005676973,0.00013033349,0.00035631467,0.00010925771,0.0018719718],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951533,0.00025619776,0.0009615714,0.0018535366,0.0006927839,0.0010826283],"domain_scores_gemma":[0.99571586,0.00038440764,0.0004930791,0.0025418433,0.00013537494,0.00072945136],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046227218,0.00088438526,0.00089000724,0.00029156162,0.00028354852,0.006278086,0.0046718926,0.0006908055,0.00021902632],"category_scores_gemma":[0.0006392815,0.0006876106,0.0006095294,0.00047569047,0.00024181172,0.0057065412,0.009575455,0.0017567015,0.00528739],"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.00007681519,0.0011433696,0.5735591,0.0008306324,0.00028509126,0.0001482298,0.00021478295,0.000051394454,0.000048899077,0.34916607,0.032082822,0.04239279],"study_design_scores_gemma":[0.0006273896,0.00008917969,0.013563421,0.0006594101,0.000025621293,0.00002468885,0.0000047314584,0.001459652,0.0011721624,0.6061916,0.3745558,0.0016263459],"about_ca_topic_score_codex":0.0000031245895,"about_ca_topic_score_gemma":0.000002207955,"teacher_disagreement_score":0.89128494,"about_ca_system_score_codex":0.00016341641,"about_ca_system_score_gemma":0.00072999275,"threshold_uncertainty_score":0.9995575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010818743,0.00048221572,0.7127786,0.00905676,0.000505511,0.0005101395,0.000027032274,0.0009576043,0.26486334],"genre_scores_gemma":[0.898889,0.000077895624,0.092389256,0.0008185853,0.00011638553,0.00007578656,0.00032400727,0.00006235913,0.007246699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989014,0.0074391193,0.00059211586,0.0016737387,0.0006650003,0.0006159829],"domain_scores_gemma":[0.98947966,0.0013927281,0.00065496366,0.006336621,0.0017346262,0.0004013958],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00722924,0.0005372024,0.000501766,0.00036042917,0.00059699366,0.0010871119,0.005603761,0.0004776519,0.00014864471],"category_scores_gemma":[0.0012795661,0.0005166586,0.00030140576,0.00057126523,0.0003829097,0.00022633112,0.0020628916,0.00090256904,0.00032092194],"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.000049816994,0.002988734,0.003142704,0.00037825268,0.00009935698,0.000049149,0.016120626,0.001005732,0.0015361323,0.8401941,0.0138331195,0.12060229],"study_design_scores_gemma":[0.0012837618,0.000010477803,0.006009928,0.0034967994,0.000058525453,0.000026277485,0.00008577963,0.8418688,0.028354894,0.051506918,0.06548536,0.0018124548],"about_ca_topic_score_codex":0.00034207382,"about_ca_topic_score_gemma":0.0004341332,"teacher_disagreement_score":0.8880703,"about_ca_system_score_codex":0.00022824702,"about_ca_system_score_gemma":0.0004825534,"threshold_uncertainty_score":0.9999499},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004717962,0.0065088924,0.8277452,0.00024137154,0.00007522954,0.00021667137,0.000005032824,0.000074196534,0.16041547],"genre_scores_gemma":[0.89746225,0.0014966606,0.0774197,0.000043490923,0.000022083144,0.000017075656,0.00004550822,0.000033897817,0.02345933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971034,0.0008116752,0.0006005714,0.0007898996,0.00038644508,0.00030800686],"domain_scores_gemma":[0.9956481,0.0007529589,0.00042185557,0.0018856119,0.0010921725,0.00019931106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030876247,0.00031356356,0.0006745581,0.0004999473,0.00011170533,0.00015944481,0.0012932388,0.0005035621,0.00004601357],"category_scores_gemma":[0.0003435756,0.00030889484,0.00022953955,0.0005145826,0.00019932512,0.00012451343,0.0008939174,0.00055396114,0.000007321732],"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.000007751286,0.00013185575,0.0010028005,0.00003684079,0.00023812134,0.000011315871,0.004154274,0.0120504135,0.000018747129,0.93156004,0.00007986373,0.05070798],"study_design_scores_gemma":[0.00019554074,9.3166386e-7,0.0022974466,0.00062212243,0.00014083611,0.0000039288507,0.000008874363,0.95766735,0.000030299867,0.0379705,0.00075325364,0.00030889822],"about_ca_topic_score_codex":0.00015734765,"about_ca_topic_score_gemma":0.0005861094,"teacher_disagreement_score":0.94561696,"about_ca_system_score_codex":0.00011337929,"about_ca_system_score_gemma":0.00015670113,"threshold_uncertainty_score":0.99993634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5158053,0.016541373,0.24457687,0.009056116,0.0060460763,0.0039312206,0.0001369627,0.0029646046,0.20094147],"genre_scores_gemma":[0.9912484,0.00019258732,0.0037728664,0.00043801463,0.00078946137,0.00011698455,0.0001398977,0.00006611536,0.0032356468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944921,0.0006079987,0.00061789085,0.0018707243,0.0005779826,0.0018333186],"domain_scores_gemma":[0.9947159,0.00027778067,0.0008114701,0.003763918,0.00012837445,0.00030251083],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00084551173,0.0008485142,0.0009123173,0.00024849805,0.00074360974,0.0007247924,0.007143488,0.00048789717,0.00006197508],"category_scores_gemma":[0.00026857888,0.00073398766,0.000637268,0.00011674659,0.00031309391,0.00033975576,0.005790158,0.0031819814,0.00032938595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006695468,0.000077187135,0.00047764037,0.00018251926,0.00027174107,0.00011079694,0.0026527746,0.00025389864,0.00023694741,0.9807861,0.005942256,0.008941183],"study_design_scores_gemma":[0.00092703133,0.00026833673,0.0052598645,0.00026443874,0.00007431306,0.00023757451,0.000017590155,0.015721682,0.00024074153,0.9055118,0.070246935,0.0012296815],"about_ca_topic_score_codex":0.00023969283,"about_ca_topic_score_gemma":0.0015865,"teacher_disagreement_score":0.47544312,"about_ca_system_score_codex":0.0005273087,"about_ca_system_score_gemma":0.001313901,"threshold_uncertainty_score":0.9995111},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9431245,0.0058113732,0.02893039,0.0008922256,0.00030247457,0.00015271938,0.0000023948771,0.00002115816,0.020762764],"genre_scores_gemma":[0.99665684,0.00029432686,0.0022287967,0.0007103129,0.000034564117,0.0000017296392,0.0000017310861,0.0000013104928,0.00007038063],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993089,0.00007218778,0.00029569087,0.00005257859,0.0001569813,0.00011369946],"domain_scores_gemma":[0.99952245,0.000053989126,0.00025527424,0.00008346636,0.000040637817,0.000044211316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006143623,0.00006768891,0.0001342543,0.00014573289,0.00008384165,0.00011204168,0.00021382773,0.000028635788,0.000057573652],"category_scores_gemma":[0.00006502428,0.00004641759,0.000029319868,0.00016275239,0.000018756085,0.0017007587,0.00014450432,0.00017621895,0.000009090756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019526774,0.00026687537,0.024905076,0.00024016756,0.00007061844,0.0004785451,0.16862904,0.0013666746,0.00048599616,0.1325543,0.005075657,0.6657318],"study_design_scores_gemma":[0.016820801,0.008216782,0.41808283,0.00041707445,0.00010495236,0.010562958,0.11265585,0.17005545,0.0011098012,0.11982392,0.13978925,0.0023603344],"about_ca_topic_score_codex":0.00001207556,"about_ca_topic_score_gemma":0.0000043678997,"teacher_disagreement_score":0.66337144,"about_ca_system_score_codex":0.00003314072,"about_ca_system_score_gemma":0.00003162086,"threshold_uncertainty_score":0.18928544},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.756433,0.000070154514,0.0004950672,0.014574803,0.01001284,0.0003740815,0.00001778512,0.00015089479,0.21787138],"genre_scores_gemma":[0.99569553,0.00004031737,0.00031572007,0.00015422789,0.000356598,0.000012662814,0.0000025498261,0.000014273682,0.0034080972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997375,0.000039685452,0.00028769576,0.0004718333,0.0014755536,0.00035021082],"domain_scores_gemma":[0.99768144,0.00020167507,0.000102035265,0.00025158544,0.0016458919,0.00011737196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094264984,0.00015851737,0.00018749287,0.00008527629,0.00018735274,0.00039947787,0.002850848,0.00007732123,0.000054310065],"category_scores_gemma":[0.00029357808,0.000121356534,0.00016005487,0.0005634923,0.0001231872,0.00036387538,0.0015807528,0.0003890314,0.00007990487],"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.0000566457,0.00030335228,0.0043761386,0.000030745206,0.00006614088,0.0000052880328,0.000988423,0.000036053327,0.049848963,0.9397916,0.003376845,0.0011197802],"study_design_scores_gemma":[0.0014433716,0.00022769107,0.002568924,0.00012270325,0.000008158295,0.000037181944,0.00012781333,0.0049797604,0.9029542,0.06678495,0.020446768,0.0002984754],"about_ca_topic_score_codex":0.00006579721,"about_ca_topic_score_gemma":0.0000022210018,"teacher_disagreement_score":0.8730067,"about_ca_system_score_codex":0.00022000611,"about_ca_system_score_gemma":0.00022158177,"threshold_uncertainty_score":0.5297633},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035738005,0.00015683945,0.5258847,0.00029134826,0.0013813839,0.00039227534,0.000004977489,0.0005615665,0.47129118],"genre_scores_gemma":[0.18111238,0.0008610533,0.30082837,0.0028052274,0.002799618,0.00024405039,0.00014891037,0.00018224202,0.51101816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970388,0.0000124376575,0.00039045454,0.0014375318,0.0005631028,0.00055766274],"domain_scores_gemma":[0.99803066,0.00020258794,0.00025416302,0.0010183639,0.0002180686,0.00027615327],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00059912447,0.0004387907,0.0004195995,0.00046161423,0.0010993918,0.0011384127,0.002147013,0.00021392266,0.000054863],"category_scores_gemma":[0.00001849758,0.00037987053,0.000105402665,0.0004580905,0.0013572543,0.00048728898,0.0021127556,0.0003607099,0.0011423563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014312001,0.000015245195,0.0000018071767,0.000014799236,0.000009519519,0.000010539775,0.00028685658,0.00005708438,0.000017823359,0.90267605,0.0012877132,0.095621124],"study_design_scores_gemma":[0.00044818173,0.00044054884,0.00069651497,0.00012303743,0.00003658894,0.00009392058,0.000015403642,0.049570795,0.00004568375,0.8535854,0.09373492,0.0012089913],"about_ca_topic_score_codex":0.0000021628255,"about_ca_topic_score_gemma":0.0000029318157,"teacher_disagreement_score":0.2250563,"about_ca_system_score_codex":0.00009481144,"about_ca_system_score_gemma":0.00041855365,"threshold_uncertainty_score":0.9998985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019311663,0.0035842312,0.8545278,0.0045414944,0.00043591054,0.0003716813,0.000038249986,0.00011288417,0.1170761],"genre_scores_gemma":[0.754055,0.0022115035,0.22359276,0.000087636196,0.00004909934,0.000015949925,0.00024430553,0.000029572951,0.01971418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933316,0.0035424065,0.00096489955,0.0010158181,0.00066803896,0.00047720602],"domain_scores_gemma":[0.9893256,0.0033548472,0.0008946628,0.0018475482,0.004315823,0.00026154812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008252602,0.0004424022,0.0005472736,0.00026237103,0.00045960935,0.00041042006,0.0013219487,0.0005989363,0.00007942802],"category_scores_gemma":[0.0016943276,0.00047846066,0.00023226127,0.0006352631,0.0006271479,0.00058810617,0.00202498,0.0007558752,0.00004761704],"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.000009144687,0.00040931665,0.0018218512,0.00016921585,0.00005738772,0.00000515108,0.01507036,0.0055918265,0.00025432132,0.95450395,0.00020168876,0.021905772],"study_design_scores_gemma":[0.00049544737,0.0000014897513,0.0082463585,0.0012629838,0.000063576466,0.000028638922,0.000059794078,0.8713607,0.0052075,0.103833124,0.008950579,0.0004898134],"about_ca_topic_score_codex":0.000659525,"about_ca_topic_score_gemma":0.0011181891,"teacher_disagreement_score":0.86576885,"about_ca_system_score_codex":0.00012429035,"about_ca_system_score_gemma":0.0005025829,"threshold_uncertainty_score":0.9997667},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44160286,0.00041483235,0.54923236,0.0043177153,0.0023451361,0.00025948865,0.0000021598494,0.0001466783,0.0016787602],"genre_scores_gemma":[0.9972255,0.00013954558,0.0015016984,0.00041032818,0.00028317576,0.000007829552,5.600923e-7,0.000011035596,0.0004202816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981568,0.00010408133,0.00066555216,0.00029507978,0.0004145249,0.00036399887],"domain_scores_gemma":[0.9982097,0.00035608062,0.0002863726,0.0002516701,0.00060357247,0.00029256198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010833499,0.00017816252,0.00034928098,0.0004977828,0.0002460232,0.0003495696,0.0007005631,0.00009303066,0.000028368893],"category_scores_gemma":[0.00048106688,0.0001450648,0.00012102509,0.00127336,0.00013037262,0.00053273747,0.00017466309,0.00020807693,0.0005159847],"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.0001466077,0.00015995538,0.0004038314,0.000029140474,0.00006381001,0.0003977967,0.017555052,0.0017118403,0.0030038257,0.29687473,0.0022383567,0.6774151],"study_design_scores_gemma":[0.0005568044,0.0030227813,0.0025786534,0.0005125598,0.00013975716,0.0016176235,0.023868287,0.11617761,0.061629813,0.76029205,0.027901392,0.0017026407],"about_ca_topic_score_codex":0.000055736167,"about_ca_topic_score_gemma":0.00013023453,"teacher_disagreement_score":0.6757124,"about_ca_system_score_codex":0.000036069134,"about_ca_system_score_gemma":0.0003151634,"threshold_uncertainty_score":0.66321117},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008182356,0.00018092965,0.9842626,0.00051320967,0.0015916975,0.0006681683,0.000054120093,0.0004628351,0.0040841065],"genre_scores_gemma":[0.98735464,0.00017372603,0.0017451729,0.0001684808,0.00023845347,0.0000073067386,0.000037638725,0.000018750268,0.0102558425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985162,0.000071297756,0.00013462054,0.00084625755,0.00009197807,0.00033962022],"domain_scores_gemma":[0.9981905,0.00043235827,0.0001630758,0.00091540394,0.00020599634,0.00009266743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030783276,0.00024025083,0.00021639942,0.00009566865,0.00043146344,0.00016958182,0.0022308307,0.00023389862,0.000026860502],"category_scores_gemma":[0.000059679118,0.0001918885,0.00029799022,0.00036481302,0.00015220845,0.00018131307,0.0019196426,0.00037688998,0.00025987686],"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.000018370843,0.00006795214,0.0006474833,0.00006538175,0.00008701258,0.00008042096,0.00018850216,0.025366621,0.000006297366,0.96865267,0.004547906,0.00027137407],"study_design_scores_gemma":[0.00045659047,0.00009424113,0.0022687633,0.000061620834,0.000086308224,0.000008917125,0.00010421341,0.6356273,0.00007082243,0.35514265,0.0056342683,0.00044430446],"about_ca_topic_score_codex":0.00006263007,"about_ca_topic_score_gemma":0.00008331491,"teacher_disagreement_score":0.9825174,"about_ca_system_score_codex":0.00013893704,"about_ca_system_score_gemma":0.00024593496,"threshold_uncertainty_score":0.7824986},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032816935,0.0046439734,0.6462537,0.004534363,0.0029815582,0.0018067779,0.000044865857,0.0032027424,0.33620387],"genre_scores_gemma":[0.36928895,0.0046780775,0.0149594005,0.0018760136,0.0034238992,0.00048709693,0.0002552757,0.0005229419,0.60450834],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953602,0.0005807557,0.000671502,0.0017597228,0.0007336675,0.0008941349],"domain_scores_gemma":[0.99584603,0.0022533436,0.00047220927,0.000957564,0.00016574943,0.00030508393],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001422439,0.00088771066,0.0010127561,0.00039293122,0.0007254836,0.00070531724,0.0013839048,0.0007155298,0.00033146274],"category_scores_gemma":[0.002796005,0.0007133692,0.0003873871,0.00036453965,0.00032863356,0.00022414309,0.00068469706,0.0019143863,0.0016715325],"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.00013448608,0.00017832596,0.00011404844,0.00033066573,0.00019129607,0.00015104261,0.0029403358,0.0072765,0.000089819885,0.36756933,0.00400448,0.61701965],"study_design_scores_gemma":[0.0000548199,0.0005644685,0.00014601319,0.0007809849,0.00015786264,0.000087407076,0.00006512007,0.016395003,0.0059140385,0.8358594,0.13795519,0.0020196757],"about_ca_topic_score_codex":0.00019729533,"about_ca_topic_score_gemma":0.0013191544,"teacher_disagreement_score":0.6312943,"about_ca_system_score_codex":0.00022850285,"about_ca_system_score_gemma":0.00031817835,"threshold_uncertainty_score":0.99953175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013191683,0.00007276101,0.98780024,0.0047199847,0.00012383467,0.00024319794,0.0000031224952,0.00013365711,0.00558403],"genre_scores_gemma":[0.9248987,0.000008200311,0.07421343,0.00059410016,0.000017796607,0.00004392629,0.0000010540258,0.0000042270144,0.00021859007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923265,0.000056777484,0.00020971481,0.00017205499,0.0001708326,0.00015797686],"domain_scores_gemma":[0.9971679,0.002178385,0.0000767969,0.00034057337,0.00020150273,0.000034830948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070540945,0.000068540656,0.000135944,0.000049795533,0.00013171567,0.000030239913,0.00030658423,0.000078217185,0.000017924338],"category_scores_gemma":[0.0005051598,0.000040961095,0.0000928707,0.00024149158,0.00007968449,0.000065697095,0.00010781724,0.00009877257,0.0000063295724],"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.0000029720659,0.000025875295,0.000057534005,0.000012950963,0.000012609854,6.981236e-7,0.00048484196,0.015168032,0.00034098793,0.9795159,0.0037690531,0.0006085285],"study_design_scores_gemma":[0.0002368388,0.00007100471,0.00018614979,0.000013432976,0.0000080557265,0.0000011402474,0.000050324365,0.84007746,0.007834127,0.15129952,0.00017033539,0.0000515945],"about_ca_topic_score_codex":0.000034308592,"about_ca_topic_score_gemma":0.000046047026,"teacher_disagreement_score":0.9235795,"about_ca_system_score_codex":0.00001015151,"about_ca_system_score_gemma":0.00015034935,"threshold_uncertainty_score":0.16703449},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18981612,0.00048178644,0.69743633,0.00060574454,0.0010323849,0.00073706533,0.0000023309567,0.0019250362,0.10796318],"genre_scores_gemma":[0.9689363,0.000020280764,0.028497007,0.000047920978,0.00012624991,0.00001596826,0.0000023536481,0.0000068865324,0.0023469827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992902,0.000016170305,0.00013632994,0.00025491303,0.00009028264,0.00021205626],"domain_scores_gemma":[0.9995282,0.00012762407,0.00004159359,0.0001967036,0.000048249905,0.00005758116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054098346,0.00007543879,0.000114812574,0.00006443329,0.00025956472,0.00014605671,0.0002394922,0.000035144138,0.0000039993147],"category_scores_gemma":[0.00008820275,0.000055362423,0.000035321133,0.0002563275,0.000010076249,0.00023759979,0.0002312754,0.000038987328,0.00006955901],"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.000003654812,0.000011575141,0.0016758321,0.00046039707,0.000010242341,0.0000076578,0.002219077,0.000011111787,0.00046507423,0.67284817,0.004563408,0.31772384],"study_design_scores_gemma":[0.00058031705,0.00016124608,0.0014179669,0.00025042437,0.000008835576,0.000044397766,0.0013612179,0.96965593,0.0019318264,0.0009402908,0.02338093,0.00026664362],"about_ca_topic_score_codex":0.000006991591,"about_ca_topic_score_gemma":0.0000019399731,"teacher_disagreement_score":0.9696448,"about_ca_system_score_codex":0.000021313954,"about_ca_system_score_gemma":0.000019132129,"threshold_uncertainty_score":0.22576141},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027452526,0.00026001933,0.9911898,0.00031798257,0.0017801836,0.00043773762,0.000018749777,0.00019058432,0.00577753],"genre_scores_gemma":[0.0038193008,0.000016846248,0.9886621,0.00020221947,0.00032760313,0.000023778111,0.000016002432,0.000041459985,0.006890685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968231,0.000053358468,0.00056252035,0.0013659672,0.0006134973,0.0005816039],"domain_scores_gemma":[0.99648374,0.0015611544,0.00041511154,0.0010834535,0.00032966924,0.00012684858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014854809,0.0003696561,0.00053541723,0.00051749527,0.0003280031,0.00028153267,0.0023698353,0.00030279253,0.000009282109],"category_scores_gemma":[0.0004929193,0.00033397612,0.00022926215,0.0007753431,0.00030903402,0.00033974578,0.0011243286,0.00044863045,0.000017650005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009130148,0.00006387856,0.000249814,0.00014560406,0.00006558989,0.000031814587,0.0027485192,0.03461026,0.0013735499,0.17640503,0.0031900506,0.78110677],"study_design_scores_gemma":[0.00022197161,0.00010999479,0.00007972822,0.00017145839,0.000013181934,0.000017247436,1.7926135e-7,0.74601865,0.0025754445,0.24733157,0.0030426204,0.00041795062],"about_ca_topic_score_codex":0.00007037725,"about_ca_topic_score_gemma":0.00006457436,"teacher_disagreement_score":0.7806888,"about_ca_system_score_codex":0.00013328846,"about_ca_system_score_gemma":0.00038187925,"threshold_uncertainty_score":0.99991125},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004585737,0.00010775525,0.13748123,0.0016925713,0.00057629606,0.00014674611,9.037623e-7,0.00039073362,0.8595992],"genre_scores_gemma":[0.0012203599,0.00008148927,0.007830538,0.000038533526,0.00021435834,0.000008952832,0.0000031719974,0.000026694706,0.9905759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988296,0.000012690862,0.00016851518,0.00047527457,0.00027359903,0.00024029586],"domain_scores_gemma":[0.99916476,0.00010495266,0.000081264705,0.0005189559,0.000056118333,0.0000739687],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001952831,0.0002349896,0.0003010394,0.00021655456,0.000043227956,0.00025538093,0.0005834972,0.00027150815,0.00012672016],"category_scores_gemma":[0.000065467546,0.00018463288,0.000113578426,0.00007676705,0.000050063434,0.00020132326,0.00032764513,0.00028299083,0.0016962511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.421e-7,0.0000092108985,0.0000029901487,0.00003441153,0.000008743736,0.000037469017,0.00020862262,8.808047e-7,0.0000041103403,0.9890658,0.0053253593,0.0053017396],"study_design_scores_gemma":[0.00013171569,0.000049801944,0.0000414901,0.00014925393,0.000007530636,0.000032673448,0.000029101773,0.002960044,0.00005455861,0.89641076,0.09976156,0.00037150297],"about_ca_topic_score_codex":0.000007516044,"about_ca_topic_score_gemma":0.000087736,"teacher_disagreement_score":0.13097672,"about_ca_system_score_codex":0.000063293584,"about_ca_system_score_gemma":0.000050600655,"threshold_uncertainty_score":0.999081},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69705015,0.00041131,0.29639065,0.0014561424,0.00069285964,0.0010266673,0.00008686296,0.0006147222,0.0022706366],"genre_scores_gemma":[0.98808175,0.000032763393,0.011486467,0.000018730772,0.000050135404,0.000019513134,0.0000074895393,0.0000072281655,0.000295936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993148,0.000033152584,0.00013247425,0.00021326996,0.000106714135,0.00019958327],"domain_scores_gemma":[0.9992078,0.00027018355,0.00006772118,0.000265656,0.00013151397,0.000057157682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014068272,0.00009254265,0.00014468288,0.000100038254,0.000110265864,0.00006161806,0.00029887146,0.000070696624,0.00000302756],"category_scores_gemma":[0.00032020753,0.000070591195,0.00004275172,0.0005883551,0.000068627625,0.000115579416,0.00014879266,0.000055993616,0.0000063868215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036313122,0.00017741963,0.0037976399,0.0004604329,0.00013202665,0.000046669098,0.0064825173,0.00010109069,0.020268101,0.92074805,0.0037859976,0.043963723],"study_design_scores_gemma":[0.0021223314,0.0012042286,0.12491813,0.00027468803,0.00017278311,0.00016927731,0.0011227974,0.3109475,0.027101183,0.5213332,0.009436672,0.001197186],"about_ca_topic_score_codex":0.000014088347,"about_ca_topic_score_gemma":0.000017925771,"teacher_disagreement_score":0.39941487,"about_ca_system_score_codex":0.000011478136,"about_ca_system_score_gemma":0.0000571008,"threshold_uncertainty_score":0.28786254},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006971717,0.0019196963,0.051345315,0.00014275979,0.0022535212,0.000448345,0.00003858558,0.0010437551,0.9427383],"genre_scores_gemma":[0.0026332368,0.00045152818,0.004533927,0.00033794806,0.00059896783,0.000015429778,0.00007948042,0.00007523231,0.99127424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960022,0.00012154869,0.0007021964,0.0013855349,0.0009522071,0.00083630584],"domain_scores_gemma":[0.9966144,0.0003877903,0.00053368625,0.0017128839,0.00044117856,0.00031005882],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064632273,0.0007391782,0.001079862,0.0006219221,0.000196251,0.00021463189,0.003426442,0.0007730943,0.00071636774],"category_scores_gemma":[0.000131214,0.00061085314,0.00059364684,0.0007102465,0.0002220706,0.00043378305,0.0018266626,0.0005495733,0.0037945977],"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.000011516758,0.00011112939,0.000013988031,0.00019321992,0.00016079245,0.0003433849,0.001547331,0.00001820013,0.0000772798,0.59097254,0.3940048,0.012545798],"study_design_scores_gemma":[0.0015731567,0.001154236,0.0011065999,0.00068911165,0.00020422699,0.00012505849,0.00019317525,0.009512548,0.00032507922,0.15992036,0.8224443,0.0027521318],"about_ca_topic_score_codex":0.00001983963,"about_ca_topic_score_gemma":0.00020286717,"teacher_disagreement_score":0.4310522,"about_ca_system_score_codex":0.0002751638,"about_ca_system_score_gemma":0.0009560015,"threshold_uncertainty_score":0.99963427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15233,0.00033535753,0.82817,0.00045404473,0.0015402357,0.0013734341,0.00002711375,0.00039329904,0.015376538],"genre_scores_gemma":[0.9682497,0.00010345826,0.03125191,0.000014259398,0.000019670491,0.000060348502,0.0000063736466,0.000009172473,0.00028510974],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978494,0.0001348364,0.0007337462,0.0007451184,0.00027995085,0.00025693924],"domain_scores_gemma":[0.9976939,0.00031831118,0.0004153124,0.0011187282,0.00038679776,0.000066976296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007563179,0.00022930575,0.0005527006,0.00022259739,0.00004148798,0.000032520013,0.00068575586,0.00030502529,0.000088545996],"category_scores_gemma":[0.00045266096,0.00018266063,0.00015262862,0.00041135447,0.00019614666,0.00011144517,0.0016177335,0.0004082926,0.000017655244],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025685378,0.0014496627,0.66537446,0.0042023514,0.00018480892,0.000039966708,0.01279547,0.041330747,0.004479835,0.24023096,0.0025753577,0.027310697],"study_design_scores_gemma":[0.000666693,0.00015062632,0.59372777,0.0010561238,0.000021016753,0.000009032944,0.00027529008,0.11112794,0.0018885499,0.2904431,0.00007315979,0.00056071574],"about_ca_topic_score_codex":0.00237471,"about_ca_topic_score_gemma":0.004310548,"teacher_disagreement_score":0.8159197,"about_ca_system_score_codex":0.0000706426,"about_ca_system_score_gemma":0.00024862567,"threshold_uncertainty_score":0.74486846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15233,0.00033535753,0.82817,0.00045404473,0.0015402357,0.0013734341,0.00002711375,0.00039329904,0.015376538],"genre_scores_gemma":[0.9682497,0.00010345826,0.03125191,0.000014259398,0.000019670491,0.000060348502,0.0000063736466,0.000009172473,0.00028510974],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978494,0.0001348364,0.0007337462,0.0007451184,0.00027995085,0.00025693924],"domain_scores_gemma":[0.9976939,0.00031831118,0.0004153124,0.0011187282,0.00038679776,0.000066976296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007563179,0.00022930575,0.0005527006,0.00022259739,0.00004148798,0.000032520013,0.00068575586,0.00030502529,0.000088545996],"category_scores_gemma":[0.00045266096,0.00018266063,0.00015262862,0.00041135447,0.00019614666,0.00011144517,0.0016177335,0.0004082926,0.000017655244],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025685378,0.0014496627,0.66537446,0.0042023514,0.00018480892,0.000039966708,0.01279547,0.041330747,0.004479835,0.24023096,0.0025753577,0.027310697],"study_design_scores_gemma":[0.000666693,0.00015062632,0.59372777,0.0010561238,0.000021016753,0.000009032944,0.00027529008,0.11112794,0.0018885499,0.2904431,0.00007315979,0.00056071574],"about_ca_topic_score_codex":0.00237471,"about_ca_topic_score_gemma":0.004310548,"teacher_disagreement_score":0.8159197,"about_ca_system_score_codex":0.0000706426,"about_ca_system_score_gemma":0.00024862567,"threshold_uncertainty_score":0.74486846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847578,0.000101938414,0.0028802739,0.0025744056,0.0006012968,0.00033570727,0.000010471283,0.00083730766,0.007900796],"genre_scores_gemma":[0.9869102,0.000007067542,0.012517181,0.00013201886,0.00009456112,0.0000359023,0.0000106482885,0.00001252984,0.00027988775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984954,0.000012152565,0.00039510094,0.00042907186,0.00035624375,0.00031201376],"domain_scores_gemma":[0.9990024,0.00015128817,0.00031981527,0.000103422004,0.00035693895,0.00006614791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083064404,0.00019906057,0.00025642556,0.00032914078,0.00016505003,0.00026675707,0.0011234005,0.00011707979,0.0000034502575],"category_scores_gemma":[0.0004450117,0.00015002121,0.00007452283,0.0004309304,0.00005907176,0.0003345393,0.00029986392,0.0002528259,0.0000072207527],"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.00031739983,0.0002233918,0.25148016,0.00031813412,0.0001755192,0.000035341378,0.009053939,0.010149341,0.03728925,0.6855271,0.0031682674,0.002262184],"study_design_scores_gemma":[0.00061318895,0.00011965323,0.017834233,0.00084404333,0.000005655933,0.000016314983,0.00071632955,0.95864075,0.0031089645,0.017764451,0.00012461831,0.00021181355],"about_ca_topic_score_codex":0.00000982372,"about_ca_topic_score_gemma":9.2554956e-7,"teacher_disagreement_score":0.9484914,"about_ca_system_score_codex":0.000039243783,"about_ca_system_score_gemma":0.000080941354,"threshold_uncertainty_score":0.6117687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01250425,0.00021958761,0.9672605,0.00015569058,0.0028245877,0.00049156754,0.0000018135054,0.0008724318,0.01566957],"genre_scores_gemma":[0.98514295,0.00006206299,0.0130300885,0.00001740736,0.0001349139,0.00007384019,0.0000150627575,0.000017945607,0.0015057122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983565,0.00021521536,0.00028409224,0.00057698396,0.0003239075,0.00024329858],"domain_scores_gemma":[0.9983703,0.00033991275,0.0002500848,0.0008309962,0.00013510016,0.000073596246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229876,0.00024856385,0.00038939985,0.00014880893,0.000083503845,0.00012722283,0.0010781373,0.00027463344,0.00002465629],"category_scores_gemma":[0.00010646536,0.00016797848,0.00019099971,0.00024943912,0.00010848944,0.00013789744,0.0019462433,0.00033470287,0.00013895301],"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.0000694088,0.00020312572,0.0035595587,0.0011420429,0.00013232515,0.000028995553,0.0016098865,0.0006300427,0.0012253132,0.30350825,0.0033114697,0.6845796],"study_design_scores_gemma":[0.0012950855,0.0014165817,0.01706744,0.001597371,0.00009242669,0.00002451417,0.00015560235,0.22678822,0.31942144,0.42770982,0.0029951832,0.0014363026],"about_ca_topic_score_codex":0.00006242284,"about_ca_topic_score_gemma":0.000041333155,"teacher_disagreement_score":0.9726387,"about_ca_system_score_codex":0.000059579143,"about_ca_system_score_gemma":0.00013619462,"threshold_uncertainty_score":0.6849963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004257747,0.00011372193,0.94258726,0.00096915575,0.0033036636,0.00025649514,0.0000045446677,0.0013915849,0.047115836],"genre_scores_gemma":[0.940695,0.000038021684,0.024050081,0.00021449666,0.0005167628,0.000060429986,0.000087740715,0.000025199033,0.034312263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832517,0.00006817179,0.00026290084,0.00073396304,0.00031085228,0.0002989535],"domain_scores_gemma":[0.99861234,0.000067782945,0.00013573817,0.000935222,0.00013494473,0.00011395423],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041188108,0.00022884284,0.00025475063,0.00013851062,0.00009630343,0.00034507515,0.0013309023,0.00014748274,0.000052350162],"category_scores_gemma":[0.000099937475,0.00019114342,0.00016233267,0.00015026382,0.000029289786,0.00015619125,0.0025433232,0.00035050997,0.0019565448],"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.000007918188,0.00026346245,0.0036423614,0.00030153687,0.00016963333,0.00040078227,0.0034767825,0.0015217217,0.00009785502,0.6482861,0.25066492,0.09116694],"study_design_scores_gemma":[0.00042997947,0.00008814281,0.0077655045,0.000121635654,0.000027971771,0.000031331318,0.00003330861,0.7322474,0.0020379815,0.23663332,0.019457195,0.0011262001],"about_ca_topic_score_codex":0.0004890679,"about_ca_topic_score_gemma":0.00013873952,"teacher_disagreement_score":0.93643725,"about_ca_system_score_codex":0.00008924917,"about_ca_system_score_gemma":0.00024941072,"threshold_uncertainty_score":0.99882054},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14722005,0.000011257612,0.78593886,0.00019052156,0.001127142,0.00010559947,8.798571e-7,0.00048940966,0.06491632],"genre_scores_gemma":[0.99610335,0.0000119822935,0.0009877993,0.000016746659,0.000063047555,0.000006246588,0.000004057628,0.0000030726483,0.0028037282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994257,0.000026302236,0.00013381167,0.00015536528,0.00014165635,0.000117137635],"domain_scores_gemma":[0.9995105,0.000113090275,0.000074597105,0.00019817022,0.00007444166,0.000029176297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002175631,0.000060001064,0.00007797037,0.00008984396,0.00007488767,0.00004356022,0.00017419668,0.00004381514,0.000034994144],"category_scores_gemma":[0.00008822056,0.000048430265,0.000038763243,0.0003497745,0.000027008084,0.00032803006,0.00005538223,0.000045374676,0.00033081544],"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.000010076424,0.00006350601,0.00054625486,0.00004390664,0.0000147865,0.000008059871,0.00217764,0.00018483419,0.014616842,0.82306975,0.0012371673,0.15802717],"study_design_scores_gemma":[0.000781263,0.00045187457,0.18588865,0.000041893683,0.00003267458,0.0000452123,0.0010859357,0.49228564,0.13693427,0.17726521,0.004641862,0.00054551807],"about_ca_topic_score_codex":0.000033848788,"about_ca_topic_score_gemma":0.00004122244,"teacher_disagreement_score":0.8488833,"about_ca_system_score_codex":0.000021743288,"about_ca_system_score_gemma":0.000036293455,"threshold_uncertainty_score":0.42520735},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2620559,0.00011777198,0.3515406,0.017157968,0.003712913,0.0020764992,0.0000021374337,0.004833409,0.3585028],"genre_scores_gemma":[0.9853653,0.000048193677,0.01368464,0.00043891033,0.00025707867,0.00008100602,0.0000012166043,0.000016939726,0.000106768755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504775,0.000015228255,0.00041992337,0.0014979987,0.0011750398,0.0018440642],"domain_scores_gemma":[0.99864656,0.00009711304,0.00015199526,0.0002625715,0.00056665693,0.00027509945],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028370304,0.00035756582,0.000314398,0.0008024261,0.00041428997,0.0013663841,0.0048454,0.00012554,0.000035478588],"category_scores_gemma":[0.00039006316,0.00029745605,0.00009107814,0.0043183807,0.0013826943,0.0013204726,0.0015352421,0.0007551964,0.0002635911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015640451,0.00010414164,0.00042346268,0.000013977875,0.0000056660165,0.000010254254,0.0010853035,0.000008082814,0.00059869135,0.9716058,0.0002117156,0.02591726],"study_design_scores_gemma":[0.00039919626,0.0006550623,0.0008931112,0.0000969954,0.000002716621,0.0000620717,0.00006655706,0.4526512,0.00215576,0.5415173,0.0010970597,0.00040296259],"about_ca_topic_score_codex":0.0000018279721,"about_ca_topic_score_gemma":0.000001026011,"teacher_disagreement_score":0.72330934,"about_ca_system_score_codex":0.0004825909,"about_ca_system_score_gemma":0.00036678408,"threshold_uncertainty_score":0.9999477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011619962,0.0006480328,0.97773844,0.0011850907,0.0027763345,0.000499518,0.0000025271204,0.00073660136,0.01629728],"genre_scores_gemma":[0.7486246,0.00031876093,0.23841456,0.0054726447,0.002509675,0.00005061506,0.0000058734104,0.00017479238,0.004428428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937785,0.00008689476,0.0005311402,0.003041497,0.0014207714,0.0011411574],"domain_scores_gemma":[0.9950013,0.0013643953,0.00038693353,0.0022384971,0.00064178987,0.0003670806],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017434502,0.0008156525,0.000726656,0.0012879687,0.00062216795,0.0012774655,0.0061784093,0.00047766994,0.000023967998],"category_scores_gemma":[0.0007387605,0.0006952263,0.00023227374,0.0012791704,0.000850805,0.0015975557,0.0015090611,0.0015029181,0.00044649176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021386997,0.00007106086,0.00011334288,0.000053128595,0.000022081807,0.00043332536,0.0065010376,0.026726518,0.0003100224,0.75877106,0.000085655905,0.20689136],"study_design_scores_gemma":[0.00025369678,0.0010496713,0.00038492586,0.0015282555,0.0000127662815,0.00007588049,0.0000032549437,0.3654046,0.0008726864,0.628997,0.00027517093,0.0011420688],"about_ca_topic_score_codex":0.00009669889,"about_ca_topic_score_gemma":0.00016236703,"teacher_disagreement_score":0.74850845,"about_ca_system_score_codex":0.001035691,"about_ca_system_score_gemma":0.0008190816,"threshold_uncertainty_score":0.9997593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021221764,0.0003985501,0.972125,0.00045794176,0.0025199924,0.000410833,0.000005717716,0.00034316524,0.023526575],"genre_scores_gemma":[0.5025165,0.00036200776,0.47809917,0.0029243007,0.0018490823,0.000089454195,0.000043506938,0.00022906583,0.013886911],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481326,0.00016283696,0.000705221,0.0021142599,0.0011209043,0.0010835129],"domain_scores_gemma":[0.9963639,0.0013952842,0.00035366113,0.0013858163,0.00027139272,0.00022994628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002793113,0.000663517,0.0007670742,0.0013257241,0.00026466785,0.00055597216,0.0040925005,0.00041237063,0.000024734722],"category_scores_gemma":[0.0006139093,0.00059477816,0.0001884907,0.0016474909,0.000740953,0.0006197197,0.002055988,0.0012085672,0.00030018456],"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.000014999322,0.00007368309,0.00018924901,0.00009040298,0.000029754256,0.0006962023,0.05124705,0.043915633,0.00004317295,0.4185114,0.00015561243,0.48503286],"study_design_scores_gemma":[0.0005576738,0.0002094428,0.00050050433,0.0010878056,0.000007361575,0.000043183012,0.000009409561,0.4881972,0.00015035478,0.5064574,0.0015742292,0.0012054084],"about_ca_topic_score_codex":0.000171916,"about_ca_topic_score_gemma":0.0010022015,"teacher_disagreement_score":0.50230426,"about_ca_system_score_codex":0.00065661536,"about_ca_system_score_gemma":0.00076018437,"threshold_uncertainty_score":0.99965036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022996062,0.0021625315,0.9738502,0.000447863,0.00012817522,0.0002514274,1.9992503e-7,0.000058864218,0.00010469205],"genre_scores_gemma":[0.12980303,0.0003695154,0.86947703,0.000128654,0.00013709805,0.000056248344,2.329615e-7,0.00000671896,0.000021475986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831563,0.0004626008,0.00043905003,0.00028777026,0.000181235,0.00031373996],"domain_scores_gemma":[0.99825627,0.0010914691,0.00019231289,0.00015139197,0.000084518826,0.00022405085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032260865,0.00014448784,0.00034109782,0.0004130732,0.00017188542,0.00024713544,0.00044402026,0.00008045086,0.0000025738634],"category_scores_gemma":[0.0005386663,0.00009848414,0.00007338986,0.0012870969,0.00009828621,0.0002915507,0.0003111737,0.00026972487,0.0000016759873],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011629973,0.000048745766,0.0022027856,0.000031700092,0.000014794267,0.000050569557,0.0010186892,0.000037264857,0.0016481546,0.025017772,0.00002529014,0.9698926],"study_design_scores_gemma":[0.0021176683,0.0016633553,0.06631757,0.0007033553,0.00006528342,0.0012598104,0.0015093208,0.0064044297,0.005006077,0.8461437,0.06769445,0.0011149339],"about_ca_topic_score_codex":0.0000023525029,"about_ca_topic_score_gemma":0.000001014552,"teacher_disagreement_score":0.96877766,"about_ca_system_score_codex":0.000011155712,"about_ca_system_score_gemma":0.000024124314,"threshold_uncertainty_score":0.40160665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09041753,0.000094153,0.9065384,0.0005196243,0.0010378694,0.00042921974,0.0000031929742,0.00035899525,0.0006010203],"genre_scores_gemma":[0.9095901,0.000027839764,0.089554094,0.00010952594,0.00028228693,0.00019469969,0.0000067072824,0.000010932812,0.00022381656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834293,0.00005612061,0.0003403525,0.0005115112,0.000188481,0.00056057394],"domain_scores_gemma":[0.9989953,0.00038838031,0.00007207616,0.00036166035,0.00009417102,0.00008841437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058070186,0.00015327761,0.00017893103,0.0001741348,0.00014831594,0.00025943413,0.00086826476,0.000117474694,0.000020426913],"category_scores_gemma":[0.00046291883,0.00013551679,0.00008219485,0.0012871759,0.00007531119,0.00028471157,0.00019025398,0.00017102041,0.00036298065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008197643,0.000045226898,0.0009198028,0.00001280876,0.0000048876027,0.000008837077,0.0035313328,0.00027138824,0.00009827082,0.6410975,0.00017732687,0.35382444],"study_design_scores_gemma":[0.000020522202,0.00015681869,0.0007466112,0.0000512963,0.000003192219,0.0000023146606,0.00045875483,0.1538136,0.010537852,0.82905525,0.004888696,0.00026510918],"about_ca_topic_score_codex":0.00008290018,"about_ca_topic_score_gemma":0.00036808412,"teacher_disagreement_score":0.81917256,"about_ca_system_score_codex":0.000030410516,"about_ca_system_score_gemma":0.00008091527,"threshold_uncertainty_score":0.5526214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001101644,0.0003444787,0.9797554,0.000041512652,0.00026597094,0.00053828646,0.000018470279,0.00003966197,0.017894557],"genre_scores_gemma":[0.98229015,0.00037899442,0.0058660842,0.000050780618,0.000114395574,0.00044336327,0.000077840305,0.000040595067,0.01073782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802554,0.000037407022,0.00071237737,0.00064262515,0.0002530752,0.0003289539],"domain_scores_gemma":[0.998801,0.0001547092,0.0002923036,0.0005900664,0.000077359524,0.000084587664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006535559,0.00027308235,0.00049253384,0.0010198246,0.00012928799,0.000091044814,0.000676587,0.0002443176,0.000023341225],"category_scores_gemma":[0.000024590036,0.00027126126,0.0001637768,0.0006232431,0.0002032918,0.00020106684,0.00020634774,0.00036214048,0.000056958634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017827628,0.000086754735,0.0004838368,0.00001146093,0.00008923185,0.000010459602,0.0015804286,0.00042781062,0.0000034325994,0.81248665,0.00005287215,0.18474926],"study_design_scores_gemma":[0.000045358353,0.00008917273,0.0008731676,0.000109930406,0.00018010804,0.0000019671063,0.0006821946,0.024375089,0.00030910358,0.9722288,0.00069753116,0.0004075644],"about_ca_topic_score_codex":0.000060576767,"about_ca_topic_score_gemma":0.0011729684,"teacher_disagreement_score":0.9811885,"about_ca_system_score_codex":0.00011621737,"about_ca_system_score_gemma":0.000074366566,"threshold_uncertainty_score":0.99997395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044513713,0.00081314944,0.94453096,0.00036512956,0.0006387745,0.0010030412,0.00004300509,0.00018338002,0.052418098],"genre_scores_gemma":[0.03273451,0.0045040254,0.5371709,0.0012116448,0.008214662,0.0055424976,0.0009512787,0.00043367402,0.4092368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980984,0.000013907627,0.0005571395,0.00078404334,0.00017218526,0.0003743728],"domain_scores_gemma":[0.9988575,0.00015445074,0.00022820492,0.0005142902,0.000120838115,0.00012470948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034049634,0.00031259292,0.00042175723,0.0003266868,0.0002948988,0.00016873228,0.0008173099,0.00033064,0.000008311007],"category_scores_gemma":[0.000036743553,0.00030814475,0.0001369093,0.00021444247,0.00019955033,0.00014795415,0.00021019725,0.00032837898,0.00015683853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007045984,0.000027099437,0.0000891499,0.00003433265,0.000020315152,0.0000046605574,0.00031678707,0.0001700695,0.0000063025445,0.8387968,0.0050395713,0.1554879],"study_design_scores_gemma":[0.000025034722,0.00006167886,0.000007227269,0.000073745774,0.000017637327,0.0000025693848,0.00013979842,0.02060615,0.00015291259,0.7894021,0.18916936,0.00034178284],"about_ca_topic_score_codex":0.0000060323637,"about_ca_topic_score_gemma":0.00002797408,"teacher_disagreement_score":0.40736005,"about_ca_system_score_codex":0.000057247486,"about_ca_system_score_gemma":0.00008933727,"threshold_uncertainty_score":0.99993706},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.4758773e-7,0.00018470506,0.3769035,0.00011879603,0.000212568,0.00008488045,3.5941875e-7,0.00027921153,0.6222158],"genre_scores_gemma":[0.000028227485,0.000054690645,0.029694965,0.00048935035,0.00034111823,0.000007886821,0.000005156187,0.00001551475,0.9693631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864215,0.000023769624,0.00023934225,0.00048192378,0.00028285212,0.00032993936],"domain_scores_gemma":[0.99874634,0.00014200128,0.00009144642,0.0008092086,0.0000734348,0.00013758452],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018598445,0.00026901744,0.0003646612,0.00008879694,0.00006595197,0.00016546341,0.0014329882,0.00032677795,0.0019126986],"category_scores_gemma":[0.00004581159,0.00018705252,0.00017482373,0.00008893084,0.00006272848,0.00011783747,0.00047152798,0.00028092784,0.010406372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3908382e-7,0.000024742605,8.821198e-7,0.00002135338,0.000009340193,0.000055733024,0.000053811917,1.9325626e-7,2.755234e-7,0.7765852,0.218878,0.0043702284],"study_design_scores_gemma":[0.00006276657,0.000035587007,0.0000022817724,0.000031579595,0.0000067003007,0.00007997636,0.0000010247961,0.0012557463,0.0000036622669,0.5840403,0.41427734,0.00020301987],"about_ca_topic_score_codex":9.46135e-7,"about_ca_topic_score_gemma":0.0000033428435,"teacher_disagreement_score":0.34720853,"about_ca_system_score_codex":0.000096951575,"about_ca_system_score_gemma":0.0002527736,"threshold_uncertainty_score":0.9989997},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013948267,0.0054903356,0.8940468,0.009333738,0.0023190673,0.0019543492,0.0011713998,0.0011570803,0.08451328],"genre_scores_gemma":[0.054687414,0.0031117434,0.015928475,0.0009930781,0.0011906377,0.0003478155,0.00023119265,0.00017385438,0.9233358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968074,0.00004139925,0.00060163444,0.0012632186,0.0003873165,0.00089903193],"domain_scores_gemma":[0.9960503,0.0015426537,0.00037776158,0.0008289176,0.00087052,0.00032986634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008035239,0.00062462466,0.0008599284,0.0003570538,0.00072118867,0.0003391878,0.0010183824,0.00055226515,0.000023307408],"category_scores_gemma":[0.0034007179,0.0005657787,0.00028211813,0.00028939891,0.00010277391,0.00025357565,0.00067079643,0.0005053801,0.0006227824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016948681,0.00001562851,0.0000063772263,0.0000893775,0.00005621283,0.000051026313,0.0001085241,0.000050167513,0.000078894074,0.98794615,0.010224799,0.0013559046],"study_design_scores_gemma":[0.00075875473,0.00039751598,0.000029491966,0.00052408554,0.0001048728,0.00004927686,0.0000065314234,0.0059721656,0.00011433451,0.6674384,0.32367998,0.00092459336],"about_ca_topic_score_codex":0.0000019466265,"about_ca_topic_score_gemma":0.000063506166,"teacher_disagreement_score":0.87811834,"about_ca_system_score_codex":0.00048011384,"about_ca_system_score_gemma":0.00020152838,"threshold_uncertainty_score":0.9996794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088118744,0.0016226786,0.9873661,0.001465031,0.0033575387,0.0004530615,0.0000051352595,0.00043931208,0.005203026],"genre_scores_gemma":[0.14324269,0.0023906971,0.81882024,0.011546557,0.006171019,0.00020496784,0.00006121565,0.00027630295,0.017286327],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963084,0.00002442511,0.00048697606,0.0016519607,0.0009191816,0.0006090588],"domain_scores_gemma":[0.9974134,0.0003830643,0.0003116184,0.0013555412,0.00033863203,0.00019774925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012892247,0.00045304134,0.00046901958,0.0006404756,0.0003502523,0.0005917836,0.001694637,0.0003165972,0.00000843911],"category_scores_gemma":[0.00026891573,0.00040086385,0.0000938414,0.0007650242,0.0005113033,0.0007338952,0.001965996,0.00057985116,0.00004006263],"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.0000019135261,0.000031464693,0.0011215106,0.00009223005,0.000016865204,0.00074161787,0.0026280605,0.00041971178,0.000037474612,0.16788967,0.00031304712,0.82670647],"study_design_scores_gemma":[0.0002780653,0.0002653962,0.0079645105,0.0007735578,0.000017931776,0.00051632564,3.7807337e-7,0.15808101,0.0002035232,0.80347353,0.027003475,0.0014223251],"about_ca_topic_score_codex":0.000048701593,"about_ca_topic_score_gemma":0.00020782603,"teacher_disagreement_score":0.8252841,"about_ca_system_score_codex":0.00018515252,"about_ca_system_score_gemma":0.00042362392,"threshold_uncertainty_score":0.9998443},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013630842,0.002143389,0.9775713,0.00021659302,0.00028159414,0.0023178665,0.000008612353,0.0006511792,0.0031786335],"genre_scores_gemma":[0.9906211,0.00007046281,0.0034797161,0.000036937832,0.000050915307,0.0039287773,0.000015063778,0.000019613082,0.001777406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859405,0.0000641589,0.000313642,0.00048243045,0.00021865674,0.00032705208],"domain_scores_gemma":[0.9989452,0.000064215674,0.000119082295,0.0006578133,0.00007473267,0.00013895439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029775716,0.00018157455,0.0002661971,0.00017388201,0.0002526528,0.00022433585,0.0005266166,0.00007514213,4.848827e-7],"category_scores_gemma":[0.000008829013,0.0001452086,0.000025329327,0.00071549485,0.000044736924,0.00019802518,0.00017897256,0.00009986703,0.00009328593],"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.000035141096,0.001363286,0.060658634,0.00067883724,0.00021474373,0.000060410668,0.04056918,0.05697453,0.0031844736,0.8200227,0.011587853,0.0046501914],"study_design_scores_gemma":[0.0008552635,0.000030281282,0.001985538,0.000093125534,0.000003007772,0.0000151795975,0.0007050361,0.9896314,0.000028906423,0.000073036885,0.006371186,0.00020802952],"about_ca_topic_score_codex":0.00031869652,"about_ca_topic_score_gemma":0.000042650016,"teacher_disagreement_score":0.9769903,"about_ca_system_score_codex":0.00010632915,"about_ca_system_score_gemma":0.000056762376,"threshold_uncertainty_score":0.5921435},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01598262,0.000038381775,0.19122761,0.0016278289,0.0007783387,0.00019155338,0.0000014256198,0.0012473634,0.7889049],"genre_scores_gemma":[0.9817041,0.000018064444,0.0048104073,0.00060144253,0.000058389192,0.00002321002,0.000002385639,0.00000582501,0.012776157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909866,0.000055769116,0.000113956965,0.00026964606,0.00017857621,0.00028339314],"domain_scores_gemma":[0.99946773,0.00004966237,0.000039037488,0.00027315813,0.00008453758,0.00008589814],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019956101,0.00010063976,0.000113862145,0.00010680271,0.00010594439,0.00009785957,0.0005905763,0.00004209618,0.00007802439],"category_scores_gemma":[0.000072092895,0.00007564746,0.000060322145,0.0008539752,0.000024418416,0.00037277993,0.00037927975,0.00008470927,0.00440533],"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.000014999808,0.00017574502,0.0020769017,0.000030838462,0.000128544,0.00016639511,0.084855616,0.00006031163,0.0004625059,0.4460982,0.30294165,0.16298829],"study_design_scores_gemma":[0.0024507677,0.000883018,0.25527126,0.00008024801,0.000024492801,0.0000688671,0.0030770788,0.432648,0.016935373,0.16226825,0.12455462,0.0017380423],"about_ca_topic_score_codex":0.000053284384,"about_ca_topic_score_gemma":0.00002003837,"teacher_disagreement_score":0.9657215,"about_ca_system_score_codex":0.00004842733,"about_ca_system_score_gemma":0.00004937465,"threshold_uncertainty_score":0.99636984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022917514,0.0025697236,0.39422026,0.00044096683,0.002003604,0.0007386597,0.0008371582,0.00049795787,0.59846246],"genre_scores_gemma":[0.030309947,0.00096162467,0.775731,0.000295391,0.00082279457,0.000073364696,0.00008811974,0.000334624,0.19138311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807954,0.000022186703,0.0004421552,0.00067813747,0.00046139766,0.00031659167],"domain_scores_gemma":[0.99789864,0.0009631675,0.00029270526,0.0005654955,0.00014005027,0.00013994555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021277682,0.0005802165,0.000622624,0.0002819791,0.00022575117,0.00045641296,0.00048663336,0.00041562974,0.00012464239],"category_scores_gemma":[0.00038660964,0.00043817176,0.00011481132,0.00006693711,0.00015044893,0.00008215362,0.00021612582,0.00062856125,0.00017791025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040319255,0.000013024467,3.527268e-7,0.0003240623,0.00013591698,0.000039980634,0.00081705354,0.0000054551397,0.000018277471,0.9488018,0.003078671,0.04676138],"study_design_scores_gemma":[0.00006667551,0.00012217752,0.000019218405,0.00034987353,0.00015827142,0.00009589416,0.000016181802,0.009208528,0.00016222567,0.98000216,0.009260354,0.00053844036],"about_ca_topic_score_codex":0.000004867149,"about_ca_topic_score_gemma":0.000018747784,"teacher_disagreement_score":0.40707937,"about_ca_system_score_codex":0.000099203804,"about_ca_system_score_gemma":0.000108283115,"threshold_uncertainty_score":0.999807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9671156,0.017605457,0.002297912,0.0044678315,0.0013835417,0.0043698996,0.000019167017,0.0014222298,0.0013183798],"genre_scores_gemma":[0.94092363,0.00004067186,0.0580932,0.000043039454,0.000089139096,0.0004440966,0.0000029081507,0.000032439955,0.00033085374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813557,0.000018521574,0.00035348392,0.000681148,0.00029532562,0.00051593495],"domain_scores_gemma":[0.9986349,0.00040856746,0.00019020012,0.0004453977,0.00021841697,0.00010255187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009378577,0.00031736074,0.00035046533,0.000210497,0.00026213922,0.0008965803,0.002049758,0.000107696294,0.0000018820382],"category_scores_gemma":[0.0016829633,0.00020199486,0.00019967322,0.00069451734,0.00028539196,0.00042022907,0.00089470996,0.00025291386,0.0000020966934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017301798,0.00020767283,0.0021760273,0.0026324329,0.00019591716,0.0000069074617,0.011274227,8.6139613e-7,0.002409026,0.15630816,0.0022466916,0.82236904],"study_design_scores_gemma":[0.0112534445,0.008264507,0.007556062,0.009768832,0.0016392623,0.001165615,0.02188641,0.01517405,0.16303906,0.5630518,0.1917477,0.0054532364],"about_ca_topic_score_codex":0.0000492294,"about_ca_topic_score_gemma":0.000016985512,"teacher_disagreement_score":0.8169158,"about_ca_system_score_codex":0.00004362185,"about_ca_system_score_gemma":0.000058556416,"threshold_uncertainty_score":0.86457443},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0141386455,0.28052562,0.023354165,0.1841981,0.014869445,0.0120560145,0.0077680545,0.00020379876,0.46288615],"genre_scores_gemma":[0.72346693,0.011914641,0.17476352,0.0127875125,0.0016978002,0.000041471656,0.000052447973,0.00027549002,0.07500018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816424,0.0001706358,0.0006961961,0.00036137458,0.00027324387,0.0003343023],"domain_scores_gemma":[0.995298,0.0022654326,0.0010832467,0.00068537454,0.0004585193,0.00020937588],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016642745,0.000366405,0.0011209602,0.00007041449,0.00034851144,0.000014635358,0.0010202668,0.0006458549,0.00004749273],"category_scores_gemma":[0.0005465515,0.00022923532,0.001095618,0.0000846107,0.0052234447,0.00006307112,0.00026723338,0.00041027434,0.0000012772014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015661575,0.000018049808,0.0000062492513,0.001937333,0.00038854382,0.0000010694823,0.009488337,0.0000072206976,0.000032406802,0.9832393,0.004127904,0.0007379454],"study_design_scores_gemma":[0.00038565756,0.0001810181,0.000021646076,0.00034814098,0.00025855232,0.000027857546,0.00010547235,0.0009445036,0.0000915261,0.96900594,0.028408514,0.0002211774],"about_ca_topic_score_codex":0.0016686259,"about_ca_topic_score_gemma":0.0047446704,"teacher_disagreement_score":0.7093283,"about_ca_system_score_codex":0.00008771456,"about_ca_system_score_gemma":0.0005492204,"threshold_uncertainty_score":0.9974838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32744288,0.017391605,0.52970237,0.0009873019,0.0058160312,0.0005158046,0.000037101534,0.0012931405,0.116813794],"genre_scores_gemma":[0.97330844,0.000188811,0.02114956,0.00045182384,0.001767564,0.000013570278,0.000002191202,0.0000440301,0.003073998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771976,0.00002127023,0.00037560903,0.0009413394,0.00037663124,0.00056541123],"domain_scores_gemma":[0.9986463,0.000368297,0.00009410895,0.0002618269,0.00028398397,0.0003454669],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009068018,0.00035650667,0.00035881615,0.00023153528,0.00029560435,0.0012687844,0.0008278364,0.000138687,0.00007073839],"category_scores_gemma":[0.0009796326,0.00030896813,0.000118484095,0.0004227902,0.000104658706,0.00018822016,0.0006166904,0.00028386386,0.00021410621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014928934,0.000034540688,0.00032366032,0.00012268517,0.000054423443,0.000060233582,0.014150152,6.2689134e-7,0.010468298,0.9581612,0.0014902721,0.015119032],"study_design_scores_gemma":[0.00035415275,0.00020971568,0.0019166922,0.0011693756,0.00014420047,0.00011982748,0.0001324029,0.049619757,0.0025484217,0.72177094,0.22114202,0.0008725094],"about_ca_topic_score_codex":0.0000086962455,"about_ca_topic_score_gemma":0.0000040721716,"teacher_disagreement_score":0.64586556,"about_ca_system_score_codex":0.000046474397,"about_ca_system_score_gemma":0.00010559319,"threshold_uncertainty_score":0.9999362},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010461138,0.00006945991,0.07445047,0.0002749399,0.0012896368,0.000106600084,0.0000026331118,0.0010023745,0.92280287],"genre_scores_gemma":[0.0007880423,0.00013593776,0.003100281,0.00031516002,0.00047789392,0.0000049180453,0.000008858584,0.000028457594,0.99514043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984536,0.00001764519,0.00022685317,0.0006433903,0.00035484988,0.00030361614],"domain_scores_gemma":[0.9987404,0.00018630698,0.0000902612,0.0007426827,0.000089994064,0.0001503872],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002599197,0.00029488862,0.0003393182,0.000113287315,0.000094161296,0.00018244729,0.0013949065,0.00039013024,0.00091397966],"category_scores_gemma":[0.000042494717,0.00021619788,0.0002407592,0.00005336577,0.00006816426,0.00010605175,0.0011331729,0.0003415101,0.01618029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.7711796e-7,0.0000073744322,0.000005704696,0.000008323878,0.000010875499,0.00010046982,0.000033448425,3.775944e-7,8.590278e-7,0.9431403,0.051500227,0.0051915455],"study_design_scores_gemma":[0.00008153344,0.00008462357,0.00005753159,0.000028354641,0.00000954235,0.000023305007,7.6510275e-7,0.00056670734,0.000012991677,0.5493068,0.44947663,0.00035118862],"about_ca_topic_score_codex":0.0000062306144,"about_ca_topic_score_gemma":0.000024058407,"teacher_disagreement_score":0.3979764,"about_ca_system_score_codex":0.000040944695,"about_ca_system_score_gemma":0.00008186206,"threshold_uncertainty_score":0.99999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005752112,0.004435704,0.9449042,0.008089131,0.0037596773,0.00038842857,0.000016843502,0.0005908476,0.032063056],"genre_scores_gemma":[0.99483067,0.00071692833,0.001029375,0.0004299171,0.0010139958,0.00003045451,0.000020304462,0.000030773976,0.0018976032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956707,0.00030290877,0.00046194755,0.00069574325,0.00063829933,0.0022304347],"domain_scores_gemma":[0.99851537,0.00020990922,0.0003257772,0.00058405194,0.00020455354,0.00016035706],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002565146,0.0003781214,0.00041821838,0.00038662407,0.00035259494,0.0008036733,0.0015762922,0.00040257277,0.00003828649],"category_scores_gemma":[0.0002892779,0.0003025978,0.0005132208,0.00039687252,0.000043844946,0.00010419096,0.0008362903,0.00852097,0.0005207929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059970507,0.00018093237,0.00013271028,0.00002619864,0.00017151397,0.000038488677,0.00020742998,0.00092358247,0.000009263814,0.9865508,0.0011848469,0.010568252],"study_design_scores_gemma":[0.00026963145,0.00032589037,0.0003356637,0.00015899213,0.000066645865,0.00014554257,0.00003030895,0.07044602,0.000015188503,0.9270635,0.0007998405,0.00034276646],"about_ca_topic_score_codex":0.000024684286,"about_ca_topic_score_gemma":0.00021007692,"teacher_disagreement_score":0.9890785,"about_ca_system_score_codex":0.0027980881,"about_ca_system_score_gemma":0.00718261,"threshold_uncertainty_score":0.9999426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7081295,0.00073864945,0.2837266,0.0011098424,0.0015007543,0.0011967801,0.000018698127,0.00022723916,0.00335189],"genre_scores_gemma":[0.9930973,0.00008581369,0.0064814757,0.000016608086,0.000070128524,0.000038027567,5.0092245e-7,0.000013803632,0.00019630874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807584,0.000015038288,0.00051082106,0.00067247695,0.00038342917,0.0003423961],"domain_scores_gemma":[0.9985783,0.00029840422,0.00016767773,0.00026837163,0.000584559,0.00010265564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009155541,0.00021779262,0.00026317628,0.00022165036,0.00028137935,0.0008081595,0.0011032515,0.00011090322,0.000007681231],"category_scores_gemma":[0.00041173474,0.00015487033,0.000121631485,0.0005488036,0.00018369255,0.00052898267,0.00031728062,0.00026619097,0.000018547205],"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.000048590227,0.00007914067,0.00028335652,0.0002206551,0.000026991971,0.000002462419,0.0022989977,0.0007772033,0.014601909,0.86517125,0.00009545704,0.116394006],"study_design_scores_gemma":[0.00002829854,0.00015052248,0.00036160595,0.0006622075,0.000016868966,0.000020089727,0.0009391513,0.91096735,0.013752862,0.07276878,0.0001199625,0.00021232088],"about_ca_topic_score_codex":0.00014962004,"about_ca_topic_score_gemma":0.000052503725,"teacher_disagreement_score":0.9101901,"about_ca_system_score_codex":0.00010513736,"about_ca_system_score_gemma":0.00016438971,"threshold_uncertainty_score":0.77931005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115698375,0.00302812,0.68775946,0.004388917,0.0038326685,0.00047573767,0.000012702036,0.0007097479,0.18409425],"genre_scores_gemma":[0.96512794,0.000014478493,0.03307714,0.0009036372,0.0002448343,0.00007819445,0.0000074537998,0.000015585396,0.0005307177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810934,0.00009346282,0.00036848383,0.0007907434,0.00012595327,0.0005120243],"domain_scores_gemma":[0.9985334,0.00050384406,0.0000711448,0.0006858755,0.00005699304,0.00014873808],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021946001,0.00021885056,0.0005298789,0.00023476785,0.000051955907,0.000027811624,0.0011296467,0.00026655564,0.00023118679],"category_scores_gemma":[0.000055254433,0.00019089546,0.000092767485,0.00045687877,0.00018572774,0.00007375895,0.0005374757,0.00022031693,0.0012292926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024630204,0.000050652245,0.00023142865,0.000015956693,0.000084443214,0.0000626158,0.003243299,0.000006644379,0.010896693,0.9423365,0.005673831,0.03737331],"study_design_scores_gemma":[0.001274552,0.0007828953,0.00893546,0.000040549894,0.000109410976,0.00023056401,0.00025527677,0.006738531,0.02919425,0.6412895,0.31022865,0.0009203706],"about_ca_topic_score_codex":0.00057222147,"about_ca_topic_score_gemma":0.0007158458,"teacher_disagreement_score":0.8494296,"about_ca_system_score_codex":0.000040732695,"about_ca_system_score_gemma":0.00013823957,"threshold_uncertainty_score":0.9995484},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07024043,0.034257952,0.0082596205,0.01204565,0.0040360205,0.00049945456,0.0000064076535,0.00034412948,0.87031037],"genre_scores_gemma":[0.99855745,0.00010029029,0.00031762884,0.0004639293,0.00020776251,0.000012432478,0.0000010728818,0.000005899337,0.00033352923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901557,0.00015538436,0.00016549353,0.0003497654,0.0001482467,0.00016555395],"domain_scores_gemma":[0.9993987,0.00018047093,0.000048793136,0.0002991902,0.000023845425,0.000048982347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044412923,0.0001402485,0.00015682621,0.00014722697,0.00008278416,0.000027051983,0.00038383825,0.00007430964,0.00007764064],"category_scores_gemma":[0.000037082027,0.00008738244,0.00007396244,0.00019157739,0.00025438686,0.00014320662,0.00008061295,0.00023405602,0.00004203029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014249211,0.000055609275,0.00004479289,0.0000423428,0.000006462183,0.000025004298,0.0014792909,0.000019391338,0.0001448451,0.99271536,0.0014739204,0.00397874],"study_design_scores_gemma":[0.000110484114,0.00026735885,0.0006352638,0.000066434215,0.0000063037483,0.000026587557,0.000023478715,0.0028411357,0.000086375665,0.98547643,0.010322232,0.00013792049],"about_ca_topic_score_codex":0.000014094528,"about_ca_topic_score_gemma":0.0000031786376,"teacher_disagreement_score":0.928317,"about_ca_system_score_codex":0.00013869946,"about_ca_system_score_gemma":0.000066703535,"threshold_uncertainty_score":0.35633525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03776165,0.00023825235,0.73079735,0.0017290092,0.00094001985,0.00022823659,0.000002527738,0.0011946833,0.22710826],"genre_scores_gemma":[0.986977,0.000022697068,0.0008395156,0.00007097347,0.000042449035,0.000018377239,0.0000012571237,0.0000040386494,0.0120237265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994593,0.000019733365,0.000086839085,0.00020375638,0.00008245485,0.00014789618],"domain_scores_gemma":[0.9996384,0.00004621678,0.000018325978,0.00019435462,0.00003784358,0.00006488355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079274934,0.000069872774,0.00008561164,0.0000732752,0.00009886211,0.00015276608,0.0001978935,0.000018696057,0.00002371119],"category_scores_gemma":[0.000006875298,0.000045606233,0.00001579118,0.0003633271,0.000023072138,0.0003175313,0.000039343427,0.00006485587,0.00016662519],"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.000010994241,0.000099746256,0.021950746,0.00012211998,0.00007059,0.00009229452,0.0078967195,0.00022475912,0.00027850913,0.9180847,0.030021952,0.021146886],"study_design_scores_gemma":[0.0017920237,0.00070542394,0.07543749,0.0002759796,0.00004842977,0.00049794454,0.0022418438,0.69401103,0.00070899306,0.0046568117,0.21858692,0.0010371046],"about_ca_topic_score_codex":0.00006745396,"about_ca_topic_score_gemma":0.00012145858,"teacher_disagreement_score":0.9492153,"about_ca_system_score_codex":0.000010094004,"about_ca_system_score_gemma":0.000026682808,"threshold_uncertainty_score":0.21416853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37816,0.009358132,0.59258324,0.0008996958,0.0030532226,0.00045194398,0.0000026599348,0.0007978965,0.014693189],"genre_scores_gemma":[0.9125726,0.000033831268,0.08616111,0.00013241918,0.00039123464,0.000014381291,0.0000015184761,0.0000144760015,0.00067839114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.00004216327,0.00025216735,0.000480481,0.000104973326,0.0003689045],"domain_scores_gemma":[0.9991822,0.0004421575,0.00004209263,0.0002484015,0.000036236914,0.000048877126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064719503,0.00015137505,0.00020064991,0.00010716519,0.0002047301,0.00044438487,0.00036982808,0.00006757496,0.000006729971],"category_scores_gemma":[0.00028529306,0.0001393285,0.00005490761,0.0003550798,0.00006172581,0.00029485225,0.00036725882,0.00016374323,0.000008975442],"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.0000086088285,0.000020869653,0.00782983,0.0002317745,0.0000213022,0.000057238594,0.008892435,0.00015913522,0.000059030284,0.6546722,0.00078860886,0.32725894],"study_design_scores_gemma":[0.0005602352,0.00021731947,0.016390169,0.0008072596,0.000010862661,0.00022072793,0.00026753175,0.9010716,0.00046586382,0.03161891,0.047847632,0.0005218712],"about_ca_topic_score_codex":0.000014631298,"about_ca_topic_score_gemma":0.000013698688,"teacher_disagreement_score":0.90091246,"about_ca_system_score_codex":0.000050496576,"about_ca_system_score_gemma":0.000070329945,"threshold_uncertainty_score":0.5681652},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000503305,0.0039585647,0.026505541,0.00008708551,0.001035991,0.00013262228,0.0000017182713,0.00016374963,0.96810967],"genre_scores_gemma":[0.00020921075,0.000545504,0.007301693,0.0001840585,0.00024179458,0.000004479121,0.0000069168077,0.000019618716,0.9914867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872077,0.000013174505,0.00018747381,0.0006534106,0.00020167652,0.00022349661],"domain_scores_gemma":[0.9988002,0.000052632717,0.00008509968,0.0006434994,0.00028338254,0.00013516127],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000113882386,0.00028072647,0.00029766312,0.00007472921,0.00009134852,0.00022997745,0.00061582256,0.00021897313,0.0020552364],"category_scores_gemma":[0.000043798485,0.00023477005,0.00009074689,0.00003290683,0.000054195898,0.00017023904,0.0010857823,0.00020838516,0.0018552729],"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":[5.9962855e-7,0.000013281443,0.000018647386,0.000037052472,0.0000493631,0.000027724294,0.00015297263,9.413291e-8,0.0000052045752,0.9230497,0.044714022,0.03193133],"study_design_scores_gemma":[0.000190609,0.00004503453,0.0000625053,0.00009643829,0.000019078621,0.000014812017,0.0000036114677,0.000366267,0.00009230553,0.033572637,0.9651664,0.00037028655],"about_ca_topic_score_codex":0.0000013502505,"about_ca_topic_score_gemma":0.00003406097,"teacher_disagreement_score":0.9204524,"about_ca_system_score_codex":0.000038692993,"about_ca_system_score_gemma":0.000107432774,"threshold_uncertainty_score":0.9989219},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736202,0.00047631995,0.021419019,0.0014842182,0.00045485553,0.0003507533,0.00002245679,0.0003638838,0.0018082967],"genre_scores_gemma":[0.97724515,0.00003806791,0.02248765,0.00003873245,0.00004978375,0.000026800664,0.000010348835,0.00001046571,0.00009299243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989096,0.000012333534,0.0002878042,0.00043102534,0.0001786155,0.00018060507],"domain_scores_gemma":[0.9993506,0.00023148554,0.00013643311,0.000066620094,0.00016124919,0.000053612854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054012594,0.00016798372,0.00019732636,0.00018099425,0.00012920878,0.0006075675,0.00033900284,0.00007634523,0.0000012790391],"category_scores_gemma":[0.0004803342,0.00012065462,0.000030593874,0.00015458057,0.00007493885,0.00035821603,0.00018525394,0.00016732686,1.9407338e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037113286,0.00009271527,0.046898127,0.0013946837,0.00023455414,0.000025851774,0.013243963,0.03164776,0.01679466,0.88279474,0.00056698045,0.0059348377],"study_design_scores_gemma":[0.00032792398,0.00008148467,0.0022292023,0.0015338468,0.000014584611,0.000054106902,0.00038344247,0.99111027,0.0008362883,0.0032321129,0.000042249452,0.00015446817],"about_ca_topic_score_codex":0.000013151166,"about_ca_topic_score_gemma":0.0000021157352,"teacher_disagreement_score":0.9594625,"about_ca_system_score_codex":0.000023707633,"about_ca_system_score_gemma":0.00003630958,"threshold_uncertainty_score":0.58587873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024359344,0.0016807928,0.9462581,0.00036452402,0.0022335597,0.00021362967,0.000002506314,0.0001615114,0.049061],"genre_scores_gemma":[0.5302931,0.00012389393,0.46252528,0.00090764306,0.00096651335,0.000010253593,0.0000060811744,0.00005320501,0.0051140264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972262,0.000018192615,0.0004577307,0.0011971501,0.0006639746,0.00043675076],"domain_scores_gemma":[0.9980983,0.0003033304,0.00023419516,0.0010192869,0.00023867787,0.00010621488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006553012,0.00038557252,0.00046232535,0.0007657909,0.000104310435,0.00031336435,0.0025060694,0.00029690802,0.000028278411],"category_scores_gemma":[0.0000759219,0.00031153558,0.00016589725,0.0007078786,0.0005153605,0.00038009245,0.0012664048,0.00058438804,0.00014263597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002975551,0.000025744612,0.000039362312,0.000105302606,0.000012952107,0.000067761815,0.0012439422,0.0042425627,0.00022749086,0.7092065,0.00004465356,0.2847807],"study_design_scores_gemma":[0.00008740581,0.00015351099,0.0000479626,0.00031173497,0.000007780921,0.00004289983,7.1909874e-8,0.35909662,0.0006569447,0.6377555,0.0015176939,0.00032184442],"about_ca_topic_score_codex":0.000012225561,"about_ca_topic_score_gemma":0.00003865847,"teacher_disagreement_score":0.5302687,"about_ca_system_score_codex":0.00017733585,"about_ca_system_score_gemma":0.00041123154,"threshold_uncertainty_score":0.99993366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09598331,0.0064330604,0.572491,0.0035440484,0.0023012143,0.0018667924,0.000048953407,0.0024596674,0.31487197],"genre_scores_gemma":[0.98881555,0.00006163849,0.010515288,0.00010003157,0.0000930664,0.000036649093,0.0000067062942,0.000010923054,0.00036016648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983599,0.00013786553,0.00018226323,0.00063676375,0.0003465359,0.00033667884],"domain_scores_gemma":[0.99904007,0.00011942745,0.00007844544,0.0005305608,0.000118400494,0.000113109694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043374722,0.00021336567,0.00030776384,0.00009561913,0.00023991725,0.00021854443,0.0009432125,0.00006410058,0.00005633033],"category_scores_gemma":[0.000034703018,0.00010154986,0.00006352753,0.0005615963,0.00023448415,0.00043507208,0.0005112051,0.00015671599,0.0000730188],"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.00027845148,0.0018771541,0.027582344,0.0007580992,0.0005823765,0.0008572734,0.01320274,0.0006375342,0.005051188,0.8857675,0.013720408,0.04968491],"study_design_scores_gemma":[0.009695968,0.018833285,0.12605716,0.002557642,0.0007055493,0.00076995965,0.0023896825,0.17874265,0.011085292,0.23766734,0.4066517,0.0048437538],"about_ca_topic_score_codex":0.0001122699,"about_ca_topic_score_gemma":0.000047085523,"teacher_disagreement_score":0.8928322,"about_ca_system_score_codex":0.00004321928,"about_ca_system_score_gemma":0.00025856687,"threshold_uncertainty_score":0.4141083},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002930576,0.00071882777,0.0028353855,0.00029090923,0.0014865131,0.000517438,0.000015456035,0.0006106541,0.9932318],"genre_scores_gemma":[0.22179773,0.00055751577,0.064618796,0.0010287355,0.0022504567,0.00020821992,0.000026510981,0.00033997974,0.70917207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668336,0.000009108492,0.0006182027,0.0013549288,0.0006745524,0.0006598507],"domain_scores_gemma":[0.99854225,0.000047413647,0.00034094878,0.00043240972,0.00043510215,0.00020189628],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061789853,0.0007154068,0.0007802588,0.0005983206,0.0001758349,0.00052506576,0.001957526,0.0004490601,0.00018980581],"category_scores_gemma":[0.0000856851,0.0006730215,0.0002989729,0.0003184308,0.00029975062,0.0006319868,0.002137886,0.0014738579,0.0011904543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010563852,0.00003387634,0.00006825107,0.00027902506,0.00007979657,0.00004797937,0.004910277,4.5296596e-7,0.000011735707,0.98646086,0.002937463,0.0051597003],"study_design_scores_gemma":[0.00024595155,0.000120633405,0.0009035762,0.00070888776,0.000028686813,0.00003644817,0.00004385806,0.0020041117,0.00021235594,0.8509935,0.14391351,0.00078846584],"about_ca_topic_score_codex":0.000055213535,"about_ca_topic_score_gemma":0.00006753211,"teacher_disagreement_score":0.2840597,"about_ca_system_score_codex":0.0008128391,"about_ca_system_score_gemma":0.00020603306,"threshold_uncertainty_score":0.99958724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038263157,0.010057413,0.93222064,0.013719917,0.0007610363,0.000166751,0.000009481765,0.00003976904,0.0047618626],"genre_scores_gemma":[0.9947843,0.0007204795,0.0040414846,0.0000339863,0.00012412133,0.0000013288217,8.9190945e-7,0.0000036387673,0.00028975433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991619,0.00006112897,0.00033935465,0.000087241424,0.00026862446,0.000081734885],"domain_scores_gemma":[0.9986478,0.0006432012,0.00025461125,0.00016169222,0.00024416955,0.000048495527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082182116,0.000060678693,0.0001498816,0.00009733454,0.00008048875,0.00011057364,0.00047268157,0.000032690812,0.0000052828077],"category_scores_gemma":[0.00023622227,0.000033854158,0.00007625645,0.00021062631,0.0002707815,0.0002618539,0.000047333306,0.00015387636,0.000006532204],"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.000009854769,0.000043214823,0.0010313906,0.00006941102,0.00012222235,0.000005828877,0.004762846,0.000030928237,0.001076787,0.9863954,0.0049805143,0.0014715736],"study_design_scores_gemma":[0.0021873438,0.00044643218,0.027692681,0.0010008953,0.00042326844,0.0010366874,0.001450988,0.61703956,0.021914553,0.30655986,0.019888869,0.00035889738],"about_ca_topic_score_codex":0.0000014801334,"about_ca_topic_score_gemma":9.216169e-7,"teacher_disagreement_score":0.95652115,"about_ca_system_score_codex":0.000010977974,"about_ca_system_score_gemma":0.0001505371,"threshold_uncertainty_score":0.13805324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049039304,0.0975048,0.48282245,0.003132183,0.008586145,0.00016952696,0.0000026660762,0.00024744784,0.35849547],"genre_scores_gemma":[0.9943766,0.0006008258,0.00387016,0.00006635021,0.00037249128,8.235403e-7,2.6532578e-7,0.0000061026676,0.0007063713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906945,0.000084432024,0.00031010289,0.00018113479,0.00015031644,0.00020458653],"domain_scores_gemma":[0.9992469,0.00019803343,0.00009889583,0.0001666816,0.00013998795,0.00014948432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004466625,0.00012156061,0.00021583392,0.00017171838,0.00009047738,0.00021616292,0.0004211733,0.00006998165,0.000032602093],"category_scores_gemma":[0.000096499694,0.000079781465,0.000118408854,0.0002528522,0.00006201523,0.0003555368,0.0002272215,0.0002989653,0.0000943775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000445892,0.00005987602,0.00013226146,0.00004052744,0.000045388293,0.00020969381,0.001372851,0.00000571674,0.0010523263,0.9608453,0.005276841,0.030954791],"study_design_scores_gemma":[0.0013914458,0.0013753289,0.007981406,0.0009932697,0.00015524772,0.0072754356,0.0001692585,0.024874985,0.0015199516,0.8095011,0.14403619,0.00072639296],"about_ca_topic_score_codex":0.000002301613,"about_ca_topic_score_gemma":0.000005098874,"teacher_disagreement_score":0.9453373,"about_ca_system_score_codex":0.00003911745,"about_ca_system_score_gemma":0.00016208831,"threshold_uncertainty_score":0.32533935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029178963,0.11133209,0.6566157,0.033959948,0.0012960016,0.0005173532,0.000004576468,0.0013933418,0.19196314],"genre_scores_gemma":[0.90143836,0.038125727,0.037487485,0.0005894638,0.001300187,0.000063152715,0.000005556515,0.00003160935,0.02095849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994101,0.000016818036,0.000072268886,0.00027433276,0.000081186685,0.00014528741],"domain_scores_gemma":[0.99953365,0.0001797118,0.000010916981,0.00017402867,0.00003642944,0.00006524761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016048487,0.000086738844,0.000112553185,0.00004240818,0.000067904446,0.00018813943,0.00020055822,0.00003022706,0.0000064724004],"category_scores_gemma":[0.00002261594,0.000058992147,0.0000495543,0.000051626066,0.000031099615,0.0003034675,0.0001497716,0.00004294649,0.000022787022],"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.113268e-7,0.0000141806695,4.3024494e-7,0.00009600229,0.0000050848325,0.0000039091537,0.0009692959,4.4715475e-7,0.000014796046,0.65629315,0.0024347992,0.34016722],"study_design_scores_gemma":[0.00019007147,0.0005033861,0.00009309687,0.00018843099,0.000015086777,0.00002791477,0.00040884333,0.16712557,0.00049363385,0.06741565,0.7632599,0.00027840212],"about_ca_topic_score_codex":0.0000017248927,"about_ca_topic_score_gemma":0.0000030818826,"teacher_disagreement_score":0.8985204,"about_ca_system_score_codex":0.0000085485035,"about_ca_system_score_gemma":0.00003051418,"threshold_uncertainty_score":0.24056299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10644922,0.0017028066,0.86202806,0.00043915154,0.0019468731,0.00008799268,3.638516e-7,0.0011179361,0.026227567],"genre_scores_gemma":[0.9811976,0.000017449218,0.017090885,0.000081379956,0.0002308854,0.0000035534624,6.4663953e-7,0.000010231909,0.0013673496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913365,0.000035659115,0.0001231023,0.00033642596,0.00013184377,0.00023932868],"domain_scores_gemma":[0.999575,0.000049795948,0.000015872447,0.00025465907,0.000028056536,0.00007660594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020355749,0.000112282025,0.000103604376,0.000101451194,0.00009310563,0.00039649577,0.0003285186,0.000053935277,0.00004589178],"category_scores_gemma":[0.000026415495,0.00008989111,0.00005926879,0.00039805385,0.000020381465,0.0005185667,0.00015479677,0.00010345567,0.00030845794],"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":[5.435371e-7,0.000015649279,0.0002908994,0.00003448018,0.0000135654755,0.00003642436,0.00084952306,0.000041897627,0.0049310443,0.9766304,0.0004381833,0.016717412],"study_design_scores_gemma":[0.00013998615,0.00007617129,0.005417578,0.0002101657,0.000019191672,0.00015276887,0.00003371566,0.94181234,0.009942188,0.022721156,0.019014563,0.00046018188],"about_ca_topic_score_codex":0.00010783351,"about_ca_topic_score_gemma":0.000022663762,"teacher_disagreement_score":0.9539092,"about_ca_system_score_codex":0.00007212557,"about_ca_system_score_gemma":0.00008794736,"threshold_uncertainty_score":0.39647055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026572323,0.0013620928,0.99222887,0.0008753331,0.0010644451,0.0009418358,0.00010785867,0.0003695319,0.00039279996],"genre_scores_gemma":[0.9973614,0.000058034053,0.00108845,0.000039554794,0.00022362059,0.0002393041,0.000002029379,0.00002093367,0.0009666307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983229,0.00011997704,0.00023449847,0.0005571487,0.00023274934,0.000532743],"domain_scores_gemma":[0.99896866,0.00045290732,0.0000622519,0.0002945271,0.00007077429,0.00015088244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904529,0.00026733885,0.00032337755,0.00010856695,0.00023893129,0.0004164342,0.0003169594,0.00024914395,0.000013179824],"category_scores_gemma":[0.000019109697,0.00020573981,0.00011894937,0.00047508397,0.00006226645,0.00024559707,0.0000023461332,0.00033422533,0.000035947574],"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.0039051971,0.002030179,0.0002114044,0.000521935,0.0038326513,0.0002990672,0.0011024702,0.23331842,0.0018192014,0.27169567,0.018186646,0.46307716],"study_design_scores_gemma":[0.003237165,0.0021799316,0.000008951833,0.00022662309,0.0003251096,0.00019437303,0.00003439545,0.95997417,0.0025353932,0.0006965976,0.029937832,0.00064945663],"about_ca_topic_score_codex":0.00010695424,"about_ca_topic_score_gemma":0.00012477292,"teacher_disagreement_score":0.9947042,"about_ca_system_score_codex":0.0003899691,"about_ca_system_score_gemma":0.00053385826,"threshold_uncertainty_score":0.8389826},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014514965,0.0091301305,0.16876888,0.003644287,0.0021333513,0.00096315343,0.0005285555,0.00085004745,0.81383646],"genre_scores_gemma":[0.36639482,0.00039856468,0.0024548564,0.0005193833,0.0005807247,0.00007870162,0.00010701026,0.000057502275,0.6294085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753374,0.000034692024,0.00043420738,0.0011445465,0.00031208328,0.0005407134],"domain_scores_gemma":[0.99824506,0.0002116561,0.00015936693,0.00080641336,0.00024439473,0.0003330888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006102301,0.00047408688,0.00055043626,0.0003715485,0.00043477796,0.00069703243,0.0008270335,0.00036612505,0.00017505122],"category_scores_gemma":[0.00019336023,0.0003983407,0.00022119505,0.0001978131,0.00013535687,0.00028045112,0.0012869821,0.0004868063,0.0007333727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007310512,0.000026918013,0.00007783677,0.000049772356,0.000066033645,0.0001040281,0.00020821227,0.0000019466281,0.000089856825,0.9913373,0.006543984,0.0014867717],"study_design_scores_gemma":[0.0004040084,0.00031361752,0.00018795616,0.00043308476,0.00013984072,0.000060150105,0.000019452369,0.0010102078,0.0000924923,0.63370126,0.3628461,0.0007918134],"about_ca_topic_score_codex":0.0000071637064,"about_ca_topic_score_gemma":0.000017586175,"teacher_disagreement_score":0.36624965,"about_ca_system_score_codex":0.00079316244,"about_ca_system_score_gemma":0.00017032998,"threshold_uncertainty_score":0.9998469},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030003637,0.0009117963,0.0066321422,0.00008143703,0.0009769229,0.0002183748,0.0000660791,0.00043242367,0.99065083],"genre_scores_gemma":[0.0012029667,0.00016649887,0.00049049867,0.000036617836,0.00026722084,8.2759516e-7,0.000011536573,0.000029545221,0.9977943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985461,0.00002324383,0.00014843656,0.0008029478,0.00019757866,0.00028166085],"domain_scores_gemma":[0.99878216,0.00005820988,0.00010611419,0.000708527,0.0001403506,0.00020463917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009045686,0.00035016114,0.0003468654,0.00024390269,0.0002909222,0.00021922366,0.00090848835,0.00027923894,0.0000027819547],"category_scores_gemma":[0.0000058871046,0.000375947,0.00017721656,0.000018121518,0.00028122158,0.00017802985,0.0012092999,0.0004603798,0.000063231964],"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.0000052742334,0.0000050145445,5.07534e-7,0.00007671991,0.00008942268,0.00028411087,0.00012779485,6.323063e-7,0.000023220971,0.96874654,0.028993504,0.001647275],"study_design_scores_gemma":[0.00019212783,0.00003971454,0.000009203048,0.00012165983,0.00012978597,0.00016445003,0.000016122816,0.0004716381,0.000068234745,0.001022004,0.99732536,0.00043969727],"about_ca_topic_score_codex":0.000071803435,"about_ca_topic_score_gemma":0.0000030849671,"teacher_disagreement_score":0.9683319,"about_ca_system_score_codex":0.00012558,"about_ca_system_score_gemma":0.000111626556,"threshold_uncertainty_score":0.9998692},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005368618,0.0072337654,0.92112106,0.0017293426,0.00057250453,0.00077019376,0.000008179979,0.00019724578,0.06299909],"genre_scores_gemma":[0.97688234,0.00012131281,0.022326631,0.00014545061,0.00008147443,0.00006675212,0.000003197388,0.000009161635,0.00036369765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867743,0.00048896216,0.00024064719,0.00027391827,0.000110230845,0.00020881371],"domain_scores_gemma":[0.9791717,0.020137878,0.00017279247,0.00029895976,0.00017414683,0.000044552406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566276,0.00012910276,0.0001790085,0.00007875188,0.00024889765,0.00020043508,0.00040504592,0.000039388076,0.000021086016],"category_scores_gemma":[0.00461995,0.00008253881,0.00009590036,0.00022393026,0.00021884505,0.00052678696,0.00015791187,0.00015214144,0.0000113986935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006179199,0.00010883853,0.0000040196887,0.00012150369,0.00005589883,0.0000039916476,0.0028368398,0.0000060640086,0.00029768285,0.85627604,0.00015833568,0.14006898],"study_design_scores_gemma":[0.00045795957,0.0014108302,0.000023499499,0.0004930122,0.00024278455,0.00017554552,0.0024840692,0.019144436,0.0051449984,0.6094537,0.36060748,0.00036171902],"about_ca_topic_score_codex":0.000004667952,"about_ca_topic_score_gemma":0.0000016323244,"teacher_disagreement_score":0.9715137,"about_ca_system_score_codex":0.000013575093,"about_ca_system_score_gemma":0.0000952749,"threshold_uncertainty_score":0.5530845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64219993,0.010543924,0.0936913,0.057135988,0.005973893,0.022555323,0.000017562223,0.004102374,0.16377969],"genre_scores_gemma":[0.8927636,0.000011807016,0.10274174,0.00063138624,0.00006415367,0.00042178592,5.406896e-7,0.000013273372,0.0033516765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985559,0.000020305415,0.0004078774,0.0004141953,0.00021516737,0.00038653967],"domain_scores_gemma":[0.99819654,0.0006004704,0.00032694885,0.0006040093,0.00022545771,0.000046578283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001176334,0.00021567904,0.0005263427,0.00014376896,0.0001944018,0.0002115626,0.0036515354,0.00010477354,0.0000021027804],"category_scores_gemma":[0.00592821,0.00012659088,0.00041711138,0.00043723214,0.00015946408,0.00016892258,0.0011302906,0.00016639996,0.000004801231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012847463,0.00024743233,0.004364322,0.0005516077,0.00015676701,0.0000016547782,0.002417603,0.0000010855547,0.0017010996,0.8427496,0.0015765607,0.14494754],"study_design_scores_gemma":[0.11914836,0.001091587,0.0026888757,0.0013492123,0.00064451335,0.000052302064,0.0026767927,0.0064123133,0.123976596,0.7203006,0.020058056,0.001600791],"about_ca_topic_score_codex":0.000007589187,"about_ca_topic_score_gemma":0.0000016507057,"teacher_disagreement_score":0.25056368,"about_ca_system_score_codex":0.000038353206,"about_ca_system_score_gemma":0.00004429126,"threshold_uncertainty_score":0.70970494},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005405277,0.5362014,0.019083539,0.0034202586,0.0023353116,0.00082030427,0.0000013960927,0.0006678126,0.43741593],"genre_scores_gemma":[0.912235,0.055431277,0.0066908146,0.009151903,0.0024382346,0.00017191099,0.0000094724,0.000052392264,0.013818987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860585,0.00017181053,0.0002976812,0.00037744033,0.00024976142,0.00029746708],"domain_scores_gemma":[0.99854994,0.00035115797,0.00006267083,0.0008326776,0.000114916926,0.00008862033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009818199,0.00017875482,0.00031097696,0.000033965774,0.00014924303,0.0002566852,0.0012268368,0.000030577918,0.00015424927],"category_scores_gemma":[0.0016880799,0.00009901119,0.00015218402,0.0005196182,0.000069609894,0.00004958121,0.00027121342,0.0002151663,0.0046739844],"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":[8.0545027e-7,0.000026470469,0.0000063561674,0.0033746085,0.000035945486,0.00013829261,0.0013823567,9.030327e-7,0.000018239763,0.9002604,0.021949494,0.07280611],"study_design_scores_gemma":[0.000056713732,0.00007042755,0.00006497262,0.0045835837,0.00009347191,0.00018090401,0.000004372964,0.0062454767,0.000020429774,0.07043325,0.9180351,0.00021132582],"about_ca_topic_score_codex":0.0000153168,"about_ca_topic_score_gemma":0.000003835693,"teacher_disagreement_score":0.91218096,"about_ca_system_score_codex":0.00003460537,"about_ca_system_score_gemma":0.00017237429,"threshold_uncertainty_score":0.99610096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018127918,0.008657397,0.20899627,0.001568391,0.004714585,0.00043597372,0.000006680452,0.00033924624,0.7571536],"genre_scores_gemma":[0.85800487,0.0003850024,0.02442203,0.004337696,0.00045919587,0.000047100377,0.000011555001,0.000021705238,0.11231085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710333,0.0000805375,0.0006222657,0.0005500354,0.00041984665,0.0012239551],"domain_scores_gemma":[0.9982936,0.00015640786,0.0002728698,0.0007381414,0.00030430433,0.00023468235],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006218141,0.0004684228,0.00045516726,0.00026204344,0.000532903,0.0008476977,0.001332964,0.0002841732,0.00018555424],"category_scores_gemma":[0.00016991132,0.00037838842,0.00016822753,0.0010962255,0.00029611785,0.0019450338,0.0008013641,0.0005709089,0.0011194681],"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.000045203604,0.00015645487,0.008073799,0.00026050146,0.0001253596,0.0001571078,0.0029533722,0.0006178975,0.000019794044,0.7908561,0.0031763017,0.19355808],"study_design_scores_gemma":[0.0031026774,0.0010897676,0.033663254,0.0023441822,0.00016362325,0.00032392473,0.0004897793,0.08177281,0.0010739918,0.021391287,0.85305065,0.0015340814],"about_ca_topic_score_codex":0.00015299482,"about_ca_topic_score_gemma":0.00007772059,"teacher_disagreement_score":0.8498743,"about_ca_system_score_codex":0.00017350288,"about_ca_system_score_gemma":0.0004992454,"threshold_uncertainty_score":0.9998668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011688613,0.0006391388,0.97951776,0.001735237,0.00014220558,0.00010967924,0.0000016800541,0.00004144543,0.0061242636],"genre_scores_gemma":[0.9476937,0.00021389844,0.051321078,0.0005388552,0.000025101854,0.000005982392,7.9608304e-7,0.000004307589,0.0001962995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991195,0.000021966485,0.00035804178,0.00020626649,0.00012998679,0.00016424691],"domain_scores_gemma":[0.99905115,0.0002675004,0.00011665927,0.00034780207,0.00016833961,0.000048565005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049063197,0.00010319297,0.00019664844,0.000105339015,0.000089287576,0.00009565976,0.00043052906,0.000047394697,0.000023885905],"category_scores_gemma":[0.00026709863,0.00008330296,0.00007059673,0.00029811135,0.00008763076,0.00010538829,0.00013819567,0.000064491185,0.000024956695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023702014,0.00014139076,0.000014190256,0.00012289402,0.000007079163,0.0000015306085,0.00043820508,0.000033579723,0.0003990487,0.8287926,0.0006855202,0.16936159],"study_design_scores_gemma":[0.000015893012,0.00010216072,0.000022557686,0.00033796518,0.0000064998917,0.0000010710662,0.00015790186,0.23459087,0.21827146,0.54375017,0.002609495,0.00013397067],"about_ca_topic_score_codex":0.0000077638515,"about_ca_topic_score_gemma":0.00000398376,"teacher_disagreement_score":0.93600506,"about_ca_system_score_codex":0.0000027691322,"about_ca_system_score_gemma":0.000043836557,"threshold_uncertainty_score":0.33969963},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7689178,0.002062104,0.0003281379,0.008933958,0.0001708827,0.00063089695,0.0000064166293,0.00009369979,0.21885613],"genre_scores_gemma":[0.9958117,0.000026958487,0.003039004,0.00017605038,0.000030521038,0.00001785234,2.8318176e-8,0.0000020466287,0.0008958259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983536,0.000012937658,0.00036352908,0.00038289416,0.0006715678,0.00021548428],"domain_scores_gemma":[0.9985297,0.00029053708,0.0004348751,0.0000145107,0.0006993576,0.0000310757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013426284,0.00012245047,0.00021461738,0.00041585398,0.00019781382,0.000056146415,0.0023215062,0.00009166474,0.000003231592],"category_scores_gemma":[0.0021129944,0.000080530794,0.00006287362,0.0039321394,0.0006457012,0.0009201878,0.00048407915,0.0001945441,0.000002296288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118684375,0.0002641524,0.06563912,0.00043234933,0.00002066639,2.2670175e-8,0.0033263268,0.0005244585,0.005833071,0.91987497,0.002622203,0.0014507801],"study_design_scores_gemma":[0.0005777643,0.00006750934,0.35732284,0.0010298839,0.000012599087,0.0000049613527,0.0008470649,0.032470565,0.14003047,0.46612558,0.0012323105,0.00027842747],"about_ca_topic_score_codex":0.000005401416,"about_ca_topic_score_gemma":0.0000016857549,"teacher_disagreement_score":0.4537494,"about_ca_system_score_codex":0.00006750962,"about_ca_system_score_gemma":0.00021535774,"threshold_uncertainty_score":0.43139747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00294714,0.00074591965,0.7358696,0.005777213,0.00043125133,0.0007113622,0.000027317648,0.0003994595,0.25309077],"genre_scores_gemma":[0.8952075,0.0005273103,0.08740319,0.00016410204,0.00003104167,0.0003132659,0.00029868353,0.000021646867,0.016033199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925334,0.004809235,0.00060239603,0.0012487172,0.00037620944,0.00043006553],"domain_scores_gemma":[0.99313885,0.0014040913,0.0004924891,0.002702718,0.0021337569,0.00012810083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004592473,0.0003766538,0.00042810684,0.00051223213,0.0003426369,0.0007149307,0.0028475171,0.00037909462,0.000045560293],"category_scores_gemma":[0.0022030536,0.0003919145,0.00018586802,0.0011400235,0.00020781512,0.0002466533,0.002441263,0.0008462509,0.00007796431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004411231,0.00053173915,0.0009974927,0.00015059947,0.00003007727,0.000006582091,0.008150294,0.00009456449,0.00016352684,0.9551661,0.0004510405,0.034253594],"study_design_scores_gemma":[0.0019218031,0.00000293607,0.04586643,0.0064576208,0.00009914001,0.000029479606,0.00035462677,0.37209043,0.0219965,0.5311072,0.017935231,0.0021386226],"about_ca_topic_score_codex":0.0012971192,"about_ca_topic_score_gemma":0.0022266158,"teacher_disagreement_score":0.89226043,"about_ca_system_score_codex":0.0003964693,"about_ca_system_score_gemma":0.00092246546,"threshold_uncertainty_score":0.99985325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14173155,0.0012058609,0.8074352,0.0007880001,0.00052849937,0.00037773483,0.000014042578,0.000695187,0.047223914],"genre_scores_gemma":[0.98412013,0.00001562338,0.01510066,0.0001330841,0.00005303961,0.0000067141286,0.000011470852,0.0000068985946,0.00055236433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986167,0.00011212364,0.00032438865,0.00050350523,0.0002076872,0.0002356219],"domain_scores_gemma":[0.999165,0.00017634695,0.000060443897,0.00043461134,0.00008394057,0.00007966191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005024907,0.00017428755,0.0003028797,0.00011001725,0.00009100671,0.00012862204,0.00042805416,0.00007681571,0.000093741735],"category_scores_gemma":[0.000029191278,0.00012679066,0.00009824464,0.00033943,0.00022438617,0.00023989084,0.00020179545,0.00012239577,0.000045348555],"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.00003759869,0.0004291319,0.023362199,0.0004496128,0.0000918517,0.000045104614,0.006273067,0.000018082563,0.029753635,0.86751544,0.007925662,0.06409863],"study_design_scores_gemma":[0.00091988005,0.0008237669,0.17495386,0.00012688432,0.000036293903,0.00016561558,0.00020102937,0.68876517,0.0023323812,0.093575284,0.037414465,0.00068536965],"about_ca_topic_score_codex":0.00053794414,"about_ca_topic_score_gemma":0.00030989107,"teacher_disagreement_score":0.8423886,"about_ca_system_score_codex":0.000034509594,"about_ca_system_score_gemma":0.00003838603,"threshold_uncertainty_score":0.51703733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68628186,0.00008951649,0.1301645,0.00910296,0.0023731436,0.00085365225,0.0000044963977,0.00038259174,0.17074728],"genre_scores_gemma":[0.99759537,0.000008377067,0.0008731438,0.0006615278,0.00006121406,0.000029545066,3.044976e-7,0.000007733887,0.0007627796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978476,0.000032096697,0.00052170904,0.0006901072,0.00043226173,0.0004762381],"domain_scores_gemma":[0.9983834,0.00027274634,0.00025972325,0.00046733595,0.0005177612,0.00009903936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070773746,0.00026914733,0.00031273448,0.00012725942,0.00031138185,0.00031786706,0.002487144,0.00013467499,0.00006071217],"category_scores_gemma":[0.0008978748,0.00019330547,0.00017054222,0.00078990107,0.00029083408,0.00031757168,0.00054948806,0.00040854813,0.00010754832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006832715,0.0002031539,0.0012846122,0.000034032855,0.000017320037,4.6076e-7,0.0008326082,0.00030406722,0.003995105,0.9773076,0.00030551502,0.015647152],"study_design_scores_gemma":[0.000044081877,0.00021809444,0.0025111455,0.00037916718,0.0000140617,0.0000012074153,0.00034471732,0.074202105,0.20797816,0.7138335,0.00022729667,0.00024648252],"about_ca_topic_score_codex":0.000029401339,"about_ca_topic_score_gemma":0.000011774891,"teacher_disagreement_score":0.3113135,"about_ca_system_score_codex":0.00009338068,"about_ca_system_score_gemma":0.00021365503,"threshold_uncertainty_score":0.78827685},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120105185,0.0010603423,0.87032914,0.0014473696,0.0053752856,0.0003136197,0.00001583897,0.000046535584,0.0013066952],"genre_scores_gemma":[0.9693966,0.000039582323,0.029715387,0.0005347216,0.00020062213,0.000010389907,4.049758e-7,0.0000045414213,0.00009777834],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99841124,0.00016893761,0.0005018189,0.0002483943,0.00041846733,0.000251168],"domain_scores_gemma":[0.99852765,0.00009570768,0.0005624865,0.0004929621,0.00022233286,0.00009885494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045536988,0.000204296,0.0003691015,0.00007658505,0.0002970335,0.0001787992,0.0011740742,0.00010174256,0.000016092368],"category_scores_gemma":[0.00024706515,0.00011637672,0.00021055817,0.00036191643,0.00013710502,0.000644774,0.00017021174,0.0002706462,0.00002313863],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005928126,0.0009536441,0.8251126,0.000083253624,0.0021711537,0.00046257797,0.0006849436,0.014998058,0.0018812559,0.021501116,0.0050871037,0.12647149],"study_design_scores_gemma":[0.0080352295,0.00044533017,0.9218789,0.0012694196,0.00067867525,0.00027047037,0.0000836713,0.037379123,0.0018115755,0.0106587745,0.01685367,0.0006351649],"about_ca_topic_score_codex":0.0005533543,"about_ca_topic_score_gemma":0.00069818966,"teacher_disagreement_score":0.8492914,"about_ca_system_score_codex":0.00039176058,"about_ca_system_score_gemma":0.00044656973,"threshold_uncertainty_score":0.4745705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010025437,0.003999877,0.2314325,0.03730003,0.0031050255,0.0018236802,0.000024059655,0.0009209371,0.71136844],"genre_scores_gemma":[0.9247086,0.00020054825,0.017287366,0.003638942,0.0002937962,0.00019821269,0.000012489862,0.000019107536,0.053640924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980099,0.00012694478,0.00047732456,0.0005528323,0.00028029314,0.00055269856],"domain_scores_gemma":[0.997987,0.0006393806,0.00033004125,0.0005896314,0.0003691298,0.00008483658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009067602,0.00024525286,0.00049696927,0.00020095706,0.00019184033,0.00010526632,0.0011852878,0.00025789876,0.00012997963],"category_scores_gemma":[0.0009550368,0.00020917674,0.00025576563,0.00046958314,0.00006194415,0.000053022814,0.00032202498,0.00016531891,0.0002704697],"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.000012086601,0.0001962537,0.002250871,0.00010607256,0.00008125636,0.0000025616212,0.0003139886,0.000021170748,0.00030347993,0.88156945,0.10993849,0.0052042985],"study_design_scores_gemma":[0.0018579762,0.00034026563,0.015703678,0.00012327317,0.000095066665,0.000008590465,0.00008986561,0.0014415912,0.0029655944,0.3048598,0.6719651,0.0005491954],"about_ca_topic_score_codex":0.000062046616,"about_ca_topic_score_gemma":0.000006656122,"teacher_disagreement_score":0.91468316,"about_ca_system_score_codex":0.00016671386,"about_ca_system_score_gemma":0.00013377208,"threshold_uncertainty_score":0.85299796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000395514,0.00035945946,0.98445183,0.00022516196,0.0020606315,0.0006077598,0.000020833902,0.000112705246,0.012122069],"genre_scores_gemma":[0.2617723,0.00006450125,0.7318454,0.0016865581,0.00067141047,0.000047958685,0.00001221999,0.000041623014,0.0038580168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663687,0.00002938494,0.0006008626,0.0014451763,0.00059795676,0.00068975444],"domain_scores_gemma":[0.99611187,0.0015422171,0.00038039792,0.0014207031,0.00039574597,0.00014905704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007066214,0.00053433,0.0007663614,0.0008020009,0.00023135405,0.00026352942,0.003807285,0.00038376782,0.00001331571],"category_scores_gemma":[0.00041345987,0.00044873435,0.0002561665,0.0005440842,0.00083054975,0.00027922643,0.0013984793,0.00046387175,0.000014194261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023524377,0.000097553246,0.00004276078,0.0002917831,0.000045116984,0.00010766766,0.0016704272,0.0016467817,0.00017662806,0.5088929,0.0002061908,0.48679864],"study_design_scores_gemma":[0.0008565274,0.00087224727,0.00009567523,0.0007562359,0.00005222614,0.000085220105,3.6884086e-7,0.3378135,0.0020446193,0.6514657,0.00492961,0.0010280703],"about_ca_topic_score_codex":0.000008382058,"about_ca_topic_score_gemma":0.00007719203,"teacher_disagreement_score":0.48577058,"about_ca_system_score_codex":0.00021904615,"about_ca_system_score_gemma":0.001192999,"threshold_uncertainty_score":0.99979645},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065009375,0.73405296,0.042596754,0.014296282,0.00057857606,0.001537677,0.0000052586697,0.00015050001,0.20028107],"genre_scores_gemma":[0.8510509,0.14150874,0.0043420163,0.0024645575,0.000041134022,0.0000357807,0.0000015911809,0.000007077194,0.0005481848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838144,0.00032163397,0.00056556193,0.00027955853,0.0002008917,0.0002509385],"domain_scores_gemma":[0.99809027,0.0004588108,0.00029224504,0.0009845592,0.00014468451,0.00002941179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576326,0.00016642151,0.0006286648,0.00008500393,0.000045685505,0.000012806207,0.0018203002,0.000073779265,0.000029264294],"category_scores_gemma":[0.0006741518,0.0000913289,0.0001706333,0.0011676594,0.00020304736,0.00010185257,0.00040383323,0.00020992533,0.00002710478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019260249,0.00006151669,0.0003306719,0.0024716696,0.000013567297,0.0000022994038,0.0003068226,0.0000059944855,0.00009538325,0.95171285,0.0011387137,0.04385856],"study_design_scores_gemma":[0.000682843,0.00020328927,0.008833257,0.020318195,0.00009725146,0.0000290849,0.00012365094,0.0009919254,0.002886404,0.9091682,0.056214612,0.00045130518],"about_ca_topic_score_codex":0.000016384744,"about_ca_topic_score_gemma":0.0000121219555,"teacher_disagreement_score":0.84454995,"about_ca_system_score_codex":0.00003282222,"about_ca_system_score_gemma":0.00012657365,"threshold_uncertainty_score":0.37242845},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024934402,0.0007877651,0.056505598,0.00019242548,0.000999246,0.00013389126,0.0000030958138,0.00037083364,0.94100463],"genre_scores_gemma":[0.00069937855,0.00007997593,0.0046726856,0.0008296759,0.00020253094,0.000004503078,0.0000054406087,0.000015107904,0.9934907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862623,0.000012638923,0.00022304422,0.0006090684,0.00027353188,0.00025547875],"domain_scores_gemma":[0.9986702,0.00015374504,0.00010492933,0.0008794903,0.00009808861,0.000093507384],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000121158155,0.00031629484,0.00034803647,0.00015782857,0.000085697495,0.00019432852,0.0012424848,0.00030892092,0.0011126979],"category_scores_gemma":[0.000026202782,0.0002517642,0.00021165128,0.00005446256,0.000051604376,0.00017399588,0.0006450799,0.00028290224,0.000953133],"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.000001156783,0.000007871719,0.000013058562,0.0000196354,0.000034739664,0.000018198501,0.00011728525,1.7775494e-7,0.0000031516126,0.9118673,0.077191696,0.010725718],"study_design_scores_gemma":[0.00017181586,0.000042228912,0.000046088073,0.00009038439,0.000018292647,0.0000048440706,0.0000013854259,0.0009553377,0.00004443541,0.07452204,0.9237492,0.00035394056],"about_ca_topic_score_codex":0.000026261485,"about_ca_topic_score_gemma":0.000058957623,"teacher_disagreement_score":0.8465575,"about_ca_system_score_codex":0.00006354176,"about_ca_system_score_gemma":0.000211474,"threshold_uncertainty_score":0.99999344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083750576,0.0013722457,0.5812376,0.0027320278,0.00081541366,0.00020239955,1.2724242e-7,0.0005631949,0.32932636],"genre_scores_gemma":[0.95596457,0.000029806128,0.036893275,0.00046410013,0.00010464704,0.000008239273,3.2578308e-7,0.000004510618,0.006530558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878794,0.000030276662,0.00021317249,0.0006247778,0.00009676487,0.0002470804],"domain_scores_gemma":[0.99907106,0.00017283304,0.00005099113,0.00057942985,0.00007388596,0.000051779953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055884034,0.000118490476,0.00015296285,0.00009268792,0.0004096419,0.00041709834,0.00039735888,0.000048698308,0.00001955977],"category_scores_gemma":[0.0004237743,0.00009942144,0.000034131706,0.00038437953,0.000025448884,0.00038707542,0.00047630517,0.0001213601,0.00001458321],"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.000006510259,0.00007847618,0.01680483,0.00020111157,0.000040288724,0.00003134232,0.009312278,0.00005905938,0.0066751153,0.8245808,0.0058786897,0.13633153],"study_design_scores_gemma":[0.003447779,0.0003588623,0.06247231,0.0019138929,0.000081629885,0.00017410127,0.0011203048,0.3987532,0.30765605,0.080713816,0.14063253,0.0026755335],"about_ca_topic_score_codex":0.000083816405,"about_ca_topic_score_gemma":0.00022252736,"teacher_disagreement_score":0.87221396,"about_ca_system_score_codex":0.000032847336,"about_ca_system_score_gemma":0.00006140222,"threshold_uncertainty_score":0.4054289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1598066,0.00010972153,0.8186709,0.00016569461,0.002640396,0.00068801345,0.000003838643,0.00038339884,0.017531391],"genre_scores_gemma":[0.99266243,0.000016599215,0.0069048814,0.00019909076,0.00005172894,0.00004816774,0.000059116213,0.0000034584186,0.000054539418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982905,0.00008944228,0.00082188577,0.00015992793,0.000353081,0.00028518884],"domain_scores_gemma":[0.9986771,0.00006774323,0.0004015015,0.00046716162,0.00032201954,0.000064514694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007107779,0.00018887148,0.00020169652,0.000831782,0.00031881352,0.00057844643,0.0005267348,0.00018753609,0.0000091939955],"category_scores_gemma":[0.00019997549,0.00017644546,0.00006022735,0.0011177759,0.000024591798,0.0048052487,0.00016569918,0.00018306241,0.00018049454],"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.00016475396,0.00027581633,0.0277807,0.0011527197,0.000031384476,0.000005475203,0.018035328,0.31890383,0.003475365,0.28296837,0.0010853839,0.34612083],"study_design_scores_gemma":[0.0008160525,0.000034009052,0.015261551,0.00021991557,0.000005804665,0.0000033913045,0.0003797322,0.97385585,0.0012724826,0.00029925109,0.0076494194,0.00020254268],"about_ca_topic_score_codex":0.00025422734,"about_ca_topic_score_gemma":0.0000032330147,"teacher_disagreement_score":0.8328558,"about_ca_system_score_codex":0.0005143235,"about_ca_system_score_gemma":0.00032476158,"threshold_uncertainty_score":0.71952367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027956566,0.00012340039,0.6134664,0.008984344,0.00024524904,0.0003818766,0.000009819893,0.000089694644,0.34874266],"genre_scores_gemma":[0.9882344,0.0000025187567,0.00803242,0.00044150106,0.000011935744,0.000025215555,0.0000030178846,0.0000046729997,0.0032443367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907845,0.000051854786,0.00027872456,0.00021253077,0.00012236851,0.00025604246],"domain_scores_gemma":[0.9990796,0.00013061253,0.000062039435,0.00042284414,0.00010951393,0.00019542279],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029315212,0.000093352544,0.00018006779,0.00016900313,0.00007899174,0.00005652585,0.0006274985,0.00005712097,0.00080019596],"category_scores_gemma":[0.00023578657,0.00008249397,0.000047196652,0.00029879506,0.00006656292,0.00004700135,0.000077745186,0.000070659895,0.0015703719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.485329e-7,0.000035632766,0.00025659948,0.000087417415,0.000012007978,0.0000042351226,0.00018620827,9.82742e-7,0.0001035347,0.985475,0.009916318,0.003921132],"study_design_scores_gemma":[0.00076343096,0.00007566633,0.017450294,0.00035957736,0.000028354907,0.0000093217395,0.00020168291,0.022177575,0.00086854823,0.6164851,0.34116107,0.00041935453],"about_ca_topic_score_codex":0.0004721923,"about_ca_topic_score_gemma":0.00057126285,"teacher_disagreement_score":0.9602778,"about_ca_system_score_codex":0.00011179201,"about_ca_system_score_gemma":0.00031281618,"threshold_uncertainty_score":0.999207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016519232,0.000395123,0.98361945,0.0008309888,0.0029520309,0.0008024876,0.000023619461,0.000266288,0.010944846],"genre_scores_gemma":[0.4960914,0.00010618705,0.49356315,0.004080969,0.0013437382,0.000032675245,0.000021207868,0.00006740497,0.0046932725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550676,0.0000656488,0.0005609886,0.0021173358,0.0007772244,0.0009720636],"domain_scores_gemma":[0.99549514,0.001654307,0.00033664503,0.0015308902,0.0007676687,0.00021536034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010997594,0.0007530606,0.00091148954,0.0009499355,0.0003219025,0.00062629353,0.0024931205,0.0005420369,0.0000043524146],"category_scores_gemma":[0.00047544664,0.0006876697,0.00031116852,0.0007359127,0.0008938122,0.0005128507,0.0018213801,0.0008789149,0.000030384752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002683329,0.00009810092,0.000040246687,0.00020006945,0.000052356543,0.00028684994,0.0030226002,0.0066424785,0.00019351377,0.22501343,0.00029915525,0.76412433],"study_design_scores_gemma":[0.0005043507,0.00026459192,0.00012752108,0.0006165236,0.000023605595,0.000111438494,4.097393e-7,0.7015084,0.0022021637,0.28943965,0.004277409,0.0009239586],"about_ca_topic_score_codex":0.000029188668,"about_ca_topic_score_gemma":0.00017710937,"teacher_disagreement_score":0.7632004,"about_ca_system_score_codex":0.0004150413,"about_ca_system_score_gemma":0.0013756003,"threshold_uncertainty_score":0.99955744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038529735,0.00025725254,0.9570636,0.002002002,0.000030882886,0.0010350128,0.00004640923,0.00015172937,0.00088334],"genre_scores_gemma":[0.97408193,0.000013257917,0.025486471,0.0001787974,0.00004356938,0.00009242113,0.000022856324,0.000006457914,0.00007423087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987932,0.000026593767,0.0003748216,0.00032732426,0.0001538093,0.00032426367],"domain_scores_gemma":[0.9991046,0.00012856022,0.00008189998,0.00030899036,0.00018257377,0.00019338267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033366465,0.00015583403,0.00023664313,0.00015520678,0.00019995458,0.00014948453,0.00039039558,0.00006523471,0.0000021301391],"category_scores_gemma":[0.00016349507,0.0001438616,0.000042881376,0.0007529942,0.00001956384,0.00019937057,0.000048440685,0.00010855094,0.00005939829],"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.0000014373843,0.00013530834,0.0001485137,0.00004632712,0.0000065144995,0.0000022238414,0.0068247933,0.0010277622,0.0015339796,0.98455447,0.00012648235,0.0055922153],"study_design_scores_gemma":[0.0025424468,0.0006904778,0.046780415,0.0011633473,0.000101188445,0.000051767707,0.0010822639,0.48838407,0.005695349,0.43944222,0.012144149,0.0019222996],"about_ca_topic_score_codex":0.0000026599528,"about_ca_topic_score_gemma":0.00003697598,"teacher_disagreement_score":0.9355522,"about_ca_system_score_codex":0.000074291245,"about_ca_system_score_gemma":0.00003967194,"threshold_uncertainty_score":0.5866506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8920185,0.0011392471,0.02211872,0.00024253268,0.00027061277,0.0002532575,0.0000091708125,0.00019269963,0.083755285],"genre_scores_gemma":[0.9932454,0.000007860688,0.0028927675,0.00028475458,0.000041461986,0.000024988683,0.000004618961,0.0000047843,0.003493314],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999017,0.00012792615,0.00013245894,0.00034413065,0.00012535256,0.0002531323],"domain_scores_gemma":[0.9993548,0.000092105176,0.000042715623,0.00041802868,0.000036389887,0.000055959903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019337406,0.00012427251,0.00014684652,0.00015217619,0.0000680245,0.000095310184,0.00044490688,0.00004968706,0.00006443244],"category_scores_gemma":[0.000052399508,0.00010397601,0.000034299275,0.00029710942,0.00002652856,0.00029616753,0.00021265676,0.00013422321,0.000057112393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004588698,0.0008680338,0.011831368,0.00010527576,0.00010249679,0.02771692,0.1940476,0.00007804896,0.009439052,0.16778556,0.0013974641,0.5865823],"study_design_scores_gemma":[0.01307212,0.0019291327,0.22153462,0.0007176233,0.00015226901,0.0026715726,0.2890561,0.047222838,0.38973805,0.023289444,0.0063462616,0.004269957],"about_ca_topic_score_codex":0.00049000146,"about_ca_topic_score_gemma":0.003828076,"teacher_disagreement_score":0.58231235,"about_ca_system_score_codex":0.0000853139,"about_ca_system_score_gemma":0.0000515693,"threshold_uncertainty_score":0.42400187},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029667586,0.0007979687,0.97268623,0.0005880801,0.0036008765,0.00039257502,0.0000024540127,0.00017799971,0.021724133],"genre_scores_gemma":[0.20353185,0.0002745993,0.7816688,0.0051464844,0.0021923352,0.00007009226,0.000020377034,0.0000616425,0.007033868],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952949,0.00011302686,0.00076242385,0.0019856328,0.00082381844,0.0010201863],"domain_scores_gemma":[0.99685,0.0009669575,0.00024341966,0.0015297786,0.00025069696,0.00015912543],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015164211,0.00058098265,0.0006904757,0.0014536513,0.00021764604,0.00074690965,0.0061605745,0.0005108723,0.00001673101],"category_scores_gemma":[0.0005002729,0.0005137148,0.00015146505,0.0031464838,0.0007514059,0.0005240028,0.002464611,0.001327488,0.000098692566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004391782,0.00008775641,0.00009714664,0.00005634223,0.000004184598,0.00016000007,0.0011605788,0.018630153,0.000015492087,0.121015206,0.00015550204,0.85861325],"study_design_scores_gemma":[0.000056449524,0.00010157785,0.000100174475,0.00037151267,0.0000032131848,0.00002058724,3.4010398e-7,0.41548598,0.0009030165,0.58094364,0.0014939101,0.00051959354],"about_ca_topic_score_codex":0.000034759265,"about_ca_topic_score_gemma":0.00050397275,"teacher_disagreement_score":0.8580937,"about_ca_system_score_codex":0.000812008,"about_ca_system_score_gemma":0.002888725,"threshold_uncertainty_score":0.9997314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072938666,0.003935367,0.87043345,0.0028596304,0.000042136908,0.0005421374,0.000010016906,0.000045082932,0.04919349],"genre_scores_gemma":[0.9980578,0.000103680555,0.001049476,0.00004684351,0.000011731452,0.0000928933,0.000003292194,0.0000012073302,0.0006331036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999539,0.0000924212,0.0001602216,0.00010885142,0.000042897005,0.000056581204],"domain_scores_gemma":[0.99857515,0.0010525257,0.00006528823,0.00021510481,0.00007919458,0.000012759414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004938806,0.000051361705,0.00011667623,0.00007418227,0.00012092977,0.000015752968,0.00021112483,0.000026426162,0.0000034966988],"category_scores_gemma":[0.00007866035,0.00003558166,0.000017615837,0.00034914326,0.0005160073,0.000091807655,0.00010878729,0.0000572131,6.234001e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001259461,0.000023783019,0.0024650642,0.000020895528,0.000007253504,2.2264462e-8,0.00071394304,0.00001143335,0.0000698221,0.9938087,0.000021561304,0.0028449253],"study_design_scores_gemma":[0.00035084676,0.0000062991207,0.027707275,0.000009974119,0.000008864976,0.0000015618903,0.00013719125,0.0003304842,0.0008086652,0.9634613,0.0071384544,0.000039130533],"about_ca_topic_score_codex":0.00006076851,"about_ca_topic_score_gemma":0.000029674055,"teacher_disagreement_score":0.9251191,"about_ca_system_score_codex":0.0000043374816,"about_ca_system_score_gemma":0.000043661796,"threshold_uncertainty_score":0.19012505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044983355,0.00348096,0.97408587,0.00055598933,0.00014722125,0.00017751347,0.000017403523,0.00026524594,0.016771436],"genre_scores_gemma":[0.99781245,0.00027732877,0.00046202407,0.000016735808,0.00013686328,0.00012359893,0.000019221741,0.00000560205,0.0011461886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992481,0.00007238797,0.00016623743,0.00027281966,0.0000997431,0.00014072505],"domain_scores_gemma":[0.9990976,0.000407169,0.00004424648,0.00030576263,0.00008752935,0.000057710473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036381886,0.00010738462,0.00013053235,0.000074521166,0.00019474942,0.00014585881,0.000303381,0.000061828854,0.000009512606],"category_scores_gemma":[0.00004739936,0.00008460458,0.000043605494,0.00051795045,0.00035039277,0.0003302698,0.0001268399,0.000118003954,0.000030389177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008278734,0.000027327187,0.00005425946,0.00003640058,0.000016337732,9.566253e-7,0.00074858573,0.0000012802924,0.00019337883,0.966254,0.0005235913,0.032135624],"study_design_scores_gemma":[0.000052376083,0.000044287106,0.00064933754,0.0000084363055,0.000020032192,0.0000105647205,0.00032281608,0.00031144396,0.005658111,0.92646676,0.06635033,0.00010552284],"about_ca_topic_score_codex":0.000007464615,"about_ca_topic_score_gemma":0.0000027513577,"teacher_disagreement_score":0.9933141,"about_ca_system_score_codex":0.000019757308,"about_ca_system_score_gemma":0.00008061117,"threshold_uncertainty_score":0.34500748},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057277805,0.0005386142,0.9846483,0.00012516863,0.00002232224,0.00013011543,0.0000066364014,0.000056078945,0.008744985],"genre_scores_gemma":[0.99622035,0.00015557162,0.0024726687,0.000016447086,0.000025088508,0.0000612592,0.0000029354367,0.00000493798,0.001040716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935055,0.000050121325,0.00021132058,0.00018416869,0.00009376271,0.00011004926],"domain_scores_gemma":[0.9990258,0.0002061554,0.00013561631,0.00039734133,0.00019318235,0.000041888023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034318052,0.00009078821,0.00015074284,0.000065498774,0.00010888056,0.000017157501,0.00037886342,0.0000491237,0.000012289142],"category_scores_gemma":[0.000040424122,0.000057479938,0.000031105363,0.00022499757,0.00039780405,0.0002935164,0.000107883956,0.000025228139,0.0000062184886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010502583,0.00003377901,0.00015491818,0.000024299079,0.00000898022,5.7694432e-8,0.0006473716,0.000038178434,0.0015543132,0.978887,0.000051718976,0.018588835],"study_design_scores_gemma":[0.0001380024,0.000024914305,0.00013602359,0.000007896477,0.000011348801,0.0000021942692,0.00007306033,0.0017939867,0.05521384,0.94090724,0.0016048258,0.000086689746],"about_ca_topic_score_codex":0.000005020133,"about_ca_topic_score_gemma":0.0000040528494,"teacher_disagreement_score":0.9904926,"about_ca_system_score_codex":0.00000772039,"about_ca_system_score_gemma":0.00006221234,"threshold_uncertainty_score":0.23439638},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033521038,0.0010774495,0.81827897,0.003160702,0.00091959303,0.0001650784,0.0000020825682,0.00037123682,0.14250386],"genre_scores_gemma":[0.96805453,0.000029690224,0.014768479,0.001872785,0.000024612465,0.00000828796,0.0000016118028,0.000005281212,0.015234741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99863636,0.0002868561,0.00017426666,0.00043549767,0.00014025522,0.00032677018],"domain_scores_gemma":[0.9985992,0.00067780685,0.000018176303,0.00043620795,0.00014797051,0.000120668956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009855978,0.00012403275,0.00016849537,0.00014323735,0.00020923807,0.00037351623,0.00045890268,0.00007012537,0.00007432768],"category_scores_gemma":[0.002051837,0.000104150706,0.000040433697,0.00057676743,0.00008980061,0.0003355826,0.00048513486,0.0001346969,0.000081294886],"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.000014484527,0.00006688853,0.02520095,0.000026350759,0.000017977816,0.000030114912,0.00028443223,0.0000011142632,0.00007312438,0.9438951,0.025263358,0.0051261084],"study_design_scores_gemma":[0.001093058,0.00018389239,0.78671706,0.00022050946,0.000033507065,0.000051029998,0.00008833436,0.11344539,0.0017495326,0.06943188,0.026360866,0.0006249551],"about_ca_topic_score_codex":0.00015539357,"about_ca_topic_score_gemma":0.00019231708,"teacher_disagreement_score":0.9345335,"about_ca_system_score_codex":0.00002941053,"about_ca_system_score_gemma":0.00018318192,"threshold_uncertainty_score":0.42471424},"labels":[],"label_agreement":null},{"id":"W4414314109","doi":"10.1093/logcom/exaf046","title":"Logics of spatial isolation","year":2025,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"London Mathematical Society","keywords":"Characterization (materials science); Modal logic; Modal; Neighbourhood (mathematics); Isolation (microbiology); Accessibility relation; Topological space; Normal modal logic","score_opus":0.016261159408648314,"score_gpt":0.2742188377594588,"score_spread":0.2579576783508105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414314109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04250652,0.00050363253,0.95186687,0.00036476125,0.00037686562,0.00003684233,1.5383114e-7,0.000009516509,0.0043348353],"genre_scores_gemma":[0.9740996,0.000052485884,0.025617898,0.00011045394,0.0000620734,2.3116164e-7,4.5192712e-7,0.0000010203449,0.000055796838],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937856,0.00005727487,0.00029799435,0.00008000926,0.00011959432,0.00006653985],"domain_scores_gemma":[0.9992045,0.000107084445,0.00033403144,0.000054999127,0.00027259765,0.000026784948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029834025,0.000057604273,0.00015330657,0.00012501702,0.000049113012,0.000039540522,0.00015645973,0.00004560069,0.0000023380228],"category_scores_gemma":[0.000064433625,0.00004223826,0.000049127026,0.00016836116,0.000029030865,0.00019572163,0.00005308256,0.00007995281,0.0000010764094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007344769,0.0002447718,0.017861249,0.000087892775,0.000073319075,0.000018820147,0.0016280608,0.0074122953,0.001320061,0.47909045,0.0015070604,0.49068257],"study_design_scores_gemma":[0.0012036075,0.00084697996,0.12354213,0.000107457425,0.00003982307,0.00007393964,0.0001273252,0.4047555,0.0007552113,0.4677232,0.00068507274,0.00013977598],"about_ca_topic_score_codex":0.000006202452,"about_ca_topic_score_gemma":0.0000018640811,"teacher_disagreement_score":0.93159306,"about_ca_system_score_codex":0.000017679838,"about_ca_system_score_gemma":0.00006741749,"threshold_uncertainty_score":0.17224264},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27240297,0.0015644988,0.5901329,0.0010106835,0.0036991993,0.0012860775,0.000025620084,0.0014296351,0.12844843],"genre_scores_gemma":[0.97849715,0.00010962063,0.015428187,0.00060991856,0.00035296637,0.00009799097,0.000019793584,0.000031023625,0.004853327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675137,0.00034707162,0.00035108847,0.0014841823,0.00040519366,0.0006611135],"domain_scores_gemma":[0.9972597,0.00030950207,0.00032297304,0.0016439197,0.00027602774,0.00018788212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077914767,0.0005562424,0.0006878772,0.0002482459,0.0004227044,0.00031092853,0.0027528615,0.00047774255,0.000007670972],"category_scores_gemma":[0.00025776325,0.0005231722,0.00030439007,0.00043738002,0.00009476076,0.00033260792,0.004161705,0.0013018415,0.000039957304],"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.000059552065,0.0003334197,0.37482733,0.00083008595,0.00084334344,0.00030592486,0.04299541,0.015123791,0.00015137359,0.5279483,0.0025838478,0.03399761],"study_design_scores_gemma":[0.0026276265,0.00034023746,0.09316228,0.006057996,0.0004681799,0.00007622432,0.00042541014,0.6899808,0.005209351,0.1828313,0.014363902,0.004456683],"about_ca_topic_score_codex":0.0008087862,"about_ca_topic_score_gemma":0.00029625677,"teacher_disagreement_score":0.7060942,"about_ca_system_score_codex":0.00034629687,"about_ca_system_score_gemma":0.00060849404,"threshold_uncertainty_score":0.999722},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003622492,0.0015985597,0.9837622,0.0029353942,0.0015231414,0.00040560725,0.000012845823,0.00022054407,0.0059192018],"genre_scores_gemma":[0.9534121,0.0010253558,0.04135245,0.0013111656,0.000063854866,0.000032072592,0.0000139528365,0.000027136668,0.0027618958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996265,0.0005263743,0.00070800906,0.0010814243,0.0005182147,0.00090097677],"domain_scores_gemma":[0.9972624,0.0009239914,0.000066794724,0.0011221466,0.00027482622,0.00034984227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017539929,0.00042231518,0.0004860887,0.00023691247,0.0005387939,0.00048236913,0.0011990181,0.00017666839,0.00012143401],"category_scores_gemma":[0.0012635208,0.00040681253,0.0001454772,0.0009092567,0.00033061174,0.00047919873,0.0011480028,0.00034573828,0.00016291137],"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.00010720317,0.00037115725,0.01693825,0.00013344083,0.0001323134,0.00011939472,0.0019204232,0.0046439515,0.00031035,0.96160793,0.0017348252,0.011980734],"study_design_scores_gemma":[0.0019532274,0.0013734229,0.18629098,0.0018807334,0.00033699963,0.00029622187,0.0017075596,0.5961468,0.02261992,0.13106999,0.05240444,0.003919701],"about_ca_topic_score_codex":0.00018890305,"about_ca_topic_score_gemma":0.00012583286,"teacher_disagreement_score":0.94978964,"about_ca_system_score_codex":0.00026870286,"about_ca_system_score_gemma":0.00038900352,"threshold_uncertainty_score":0.99983835},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013700543,0.0068361987,0.3700218,0.005446771,0.0025821317,0.0013478728,0.0000013186858,0.00027862986,0.59978473],"genre_scores_gemma":[0.96373934,0.0001892402,0.012851794,0.0008892912,0.000115037845,0.000017795257,0.0000012310584,0.000009253852,0.022187026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969279,0.00029497468,0.0007479744,0.001044201,0.00027113315,0.0007138228],"domain_scores_gemma":[0.9981994,0.00044016534,0.00013518249,0.0009026073,0.00019815654,0.00012450131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015377315,0.00031564722,0.00043109636,0.0003315099,0.0002568303,0.0004597846,0.0012149066,0.00019724014,0.0002005823],"category_scores_gemma":[0.0013298917,0.00026914076,0.00013957947,0.0020258552,0.000108074804,0.00039813446,0.0012140613,0.00041336782,0.00032655153],"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.000010319121,0.00034365247,0.004592383,0.00041901617,0.000012998373,0.000036480655,0.0023428649,0.00011218833,0.00005482983,0.5467623,0.0045845495,0.44072843],"study_design_scores_gemma":[0.0017525916,0.00034022835,0.018440688,0.0037368867,0.0000442547,0.000018523016,0.00023498491,0.8444195,0.00048048014,0.08215706,0.04747425,0.00090055785],"about_ca_topic_score_codex":0.00009935328,"about_ca_topic_score_gemma":0.0001694238,"teacher_disagreement_score":0.9500388,"about_ca_system_score_codex":0.00023588788,"about_ca_system_score_gemma":0.000581717,"threshold_uncertainty_score":0.9999761},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16642304,0.0010287176,0.7659339,0.00074010616,0.0026453487,0.0006250688,0.000002878612,0.000272631,0.062328354],"genre_scores_gemma":[0.95720965,0.000024062736,0.03763017,0.0009329624,0.00015324404,0.00002901971,0.0000033513113,0.000027702321,0.0039898483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954373,0.00047894256,0.0009834019,0.0015663407,0.00040312664,0.0011308762],"domain_scores_gemma":[0.9971949,0.0005203686,0.00031661047,0.0014579647,0.00027894526,0.00023121506],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009165009,0.0004957131,0.0005788039,0.0009628636,0.00072774035,0.0011335806,0.0014562334,0.00025508268,0.00012156539],"category_scores_gemma":[0.0011433855,0.0005131509,0.00026864657,0.0036996733,0.00019900399,0.00094846205,0.0009366719,0.000649478,0.00006010839],"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.000116204064,0.0016958846,0.23846804,0.0006333523,0.00011341023,0.000443722,0.005634164,0.03821526,0.031029908,0.43628004,0.0008872706,0.24648274],"study_design_scores_gemma":[0.001398526,0.000055187003,0.022843245,0.0003977124,0.00004730243,0.000012904926,0.00020202466,0.96647346,0.0062070373,0.0016222192,0.00025188015,0.00048849534],"about_ca_topic_score_codex":0.0034066136,"about_ca_topic_score_gemma":0.00048625882,"teacher_disagreement_score":0.9282582,"about_ca_system_score_codex":0.0003375364,"about_ca_system_score_gemma":0.0016521377,"threshold_uncertainty_score":0.9999033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8028538,0.0017901349,0.16133612,0.0018078642,0.000055677316,0.0004211506,0.0000027144295,0.00016199159,0.031570494],"genre_scores_gemma":[0.98655427,0.00003776651,0.01300429,0.00014247202,0.00000937074,0.000022328542,5.2259264e-7,0.000003479948,0.00022549395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99928504,0.000043283773,0.000101029174,0.0003160359,0.00008440468,0.00017019786],"domain_scores_gemma":[0.99946535,0.00023206616,0.000032778953,0.00017944833,0.000043567154,0.000046793404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019184437,0.00010569124,0.00014273115,0.00009042908,0.00009411384,0.00012138332,0.00016805073,0.000043356624,0.0000043591485],"category_scores_gemma":[0.00008026657,0.000063600186,0.000008230205,0.0002142147,0.00013448579,0.00015564097,0.000102796344,0.00009532011,0.0000022237657],"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.00004986014,0.00009284078,0.06020576,0.00007004608,0.000026962627,0.00008802519,0.0024875682,0.00005498618,0.0001260904,0.9095807,0.000029971554,0.027187178],"study_design_scores_gemma":[0.004956464,0.0018175006,0.57372296,0.0024776517,0.000119974415,0.00072552403,0.0028633743,0.06325843,0.0019039611,0.3335508,0.012732745,0.0018706241],"about_ca_topic_score_codex":0.00005328466,"about_ca_topic_score_gemma":0.0005225939,"teacher_disagreement_score":0.5760299,"about_ca_system_score_codex":0.000017462893,"about_ca_system_score_gemma":0.000049001457,"threshold_uncertainty_score":0.25935405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5709622,0.00024789345,0.24930497,0.01142561,0.0017552107,0.0035213819,0.00002003672,0.0007278293,0.16203488],"genre_scores_gemma":[0.98333496,0.000032578053,0.015740683,0.0003046093,0.000096030875,0.0000771952,0.000002360444,0.000018985853,0.0003925812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975954,0.00001752977,0.0005608351,0.0007657763,0.000491074,0.00056934176],"domain_scores_gemma":[0.9974058,0.00018336234,0.00044779896,0.00041500808,0.0013981401,0.00014983607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327833,0.00033900986,0.00040844953,0.000082661994,0.00028084638,0.00056368543,0.0016501172,0.00015378346,0.000066124616],"category_scores_gemma":[0.0003304461,0.00022941316,0.00021245827,0.0007085129,0.00054931326,0.0003786874,0.000298395,0.00040107057,0.00007156507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006767017,0.00040231715,0.00037697665,0.00012478694,0.000040428833,0.0000061017217,0.00090275233,0.000007298534,0.0052744914,0.94685477,0.00007134767,0.04587103],"study_design_scores_gemma":[0.00012823958,0.00081457087,0.00024267957,0.0005352635,0.000044600853,0.00007712091,0.001495404,0.024839466,0.42487067,0.5459084,0.00054465316,0.00049894815],"about_ca_topic_score_codex":0.000013701098,"about_ca_topic_score_gemma":0.00004169137,"teacher_disagreement_score":0.4195962,"about_ca_system_score_codex":0.000051932664,"about_ca_system_score_gemma":0.00045833745,"threshold_uncertainty_score":0.9355197},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10601043,0.0000747226,0.8766379,0.00033484751,0.0000704792,0.000502407,0.0000017099368,0.00006638881,0.016301125],"genre_scores_gemma":[0.9824621,0.0000051048983,0.017141322,0.00014485902,0.00001161787,0.00002611827,0.0000021543838,0.000003613844,0.00020308659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992458,0.000072988914,0.00013510279,0.00023034532,0.00012913856,0.00018658857],"domain_scores_gemma":[0.99922293,0.0002989365,0.00006310374,0.00027024624,0.0001004875,0.00004428539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040715447,0.00009282337,0.00013476382,0.00002609854,0.00009926725,0.000058084184,0.00031398542,0.000043103613,0.000007008115],"category_scores_gemma":[0.00006199592,0.00005245229,0.00003986773,0.00015687101,0.000073510186,0.00014719742,0.00005551033,0.00004845316,0.00000415336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021646713,0.000042205873,0.0017979123,0.000014281532,0.000005972678,2.1927957e-7,0.00028269927,0.000027832415,0.000036198253,0.99024564,0.00018413672,0.0073607294],"study_design_scores_gemma":[0.0006344896,0.0008694717,0.0068475017,0.00005271618,0.000016300583,0.0000076557135,0.00007915306,0.15768167,0.0017269459,0.83069795,0.0011263773,0.00025977864],"about_ca_topic_score_codex":0.000008848188,"about_ca_topic_score_gemma":0.000005234594,"teacher_disagreement_score":0.8764517,"about_ca_system_score_codex":0.000009171086,"about_ca_system_score_gemma":0.000020494039,"threshold_uncertainty_score":0.21389423},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005709618,0.0000444462,0.79906726,0.0011138411,0.00036129556,0.00009764681,2.9825793e-7,0.00029609218,0.19330949],"genre_scores_gemma":[0.9261798,0.00001648323,0.06861907,0.0006169225,0.00015654507,0.000010560687,0.0000056529934,0.000004823135,0.004390087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992564,0.00001905589,0.00013184524,0.00024530588,0.00016823637,0.00017918112],"domain_scores_gemma":[0.9994062,0.00003389782,0.00004241587,0.00034570668,0.00010228822,0.000069478694],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014759957,0.00008844841,0.000079705074,0.00005893778,0.00013429517,0.00013838295,0.00041900383,0.00004694405,0.000077335906],"category_scores_gemma":[0.00008544,0.000070787326,0.00004408263,0.00021954294,0.000019928722,0.00050053734,0.00010694216,0.0000595719,0.0027991454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013879531,0.00012126563,0.00045391783,0.000005755656,0.000008324181,0.000006804932,0.0012647593,0.00016302457,0.0016555295,0.96512896,0.003621557,0.027568694],"study_design_scores_gemma":[0.0038363382,0.0005903423,0.052086085,0.00008055758,0.000031651052,0.00008948348,0.0001304684,0.066325665,0.026397485,0.7667612,0.08213609,0.0015346557],"about_ca_topic_score_codex":0.000042097792,"about_ca_topic_score_gemma":0.00006480414,"teacher_disagreement_score":0.92047024,"about_ca_system_score_codex":0.000060250866,"about_ca_system_score_gemma":0.00007811659,"threshold_uncertainty_score":0.9979773},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010698372,0.000026592254,0.95019937,0.00020668162,0.00006771793,0.00023824583,0.0000013508565,0.00011484161,0.038446806],"genre_scores_gemma":[0.83551115,0.000003612722,0.16405791,0.00021575071,0.000019317047,0.000027992075,0.0000063853768,0.000002923213,0.00015497091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994045,0.000009275007,0.00015356948,0.00013138208,0.00012801474,0.00017325665],"domain_scores_gemma":[0.999327,0.000056191748,0.000116069255,0.00021707322,0.00023569749,0.00004798678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013540009,0.00009184353,0.00012489062,0.000077423654,0.00007656135,0.00005659657,0.00028125147,0.000041736363,0.000004259606],"category_scores_gemma":[0.000099933604,0.000058946247,0.00004298971,0.00030345743,0.00003602962,0.0009040363,0.00006871615,0.00004500122,0.000017463233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030434441,0.00006075196,0.00043507645,0.000021557951,0.00001755699,6.2229964e-7,0.0027707438,0.00054221746,0.000043035197,0.9876826,0.00011693125,0.0082784975],"study_design_scores_gemma":[0.029680032,0.016615074,0.12444614,0.0011600668,0.00021259814,0.000265639,0.0047622398,0.2245537,0.0812865,0.481684,0.031856794,0.0034772325],"about_ca_topic_score_codex":0.000041526724,"about_ca_topic_score_gemma":0.000032292537,"teacher_disagreement_score":0.82481277,"about_ca_system_score_codex":0.00004076216,"about_ca_system_score_gemma":0.00009223509,"threshold_uncertainty_score":0.24037582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13614036,0.0002985139,0.79589564,0.00054915535,0.00004193911,0.00065280206,1.9522771e-7,0.00017135663,0.066250056],"genre_scores_gemma":[0.88097584,0.000003731699,0.11841553,0.00004277936,0.000010786607,0.0000094965,3.4232247e-7,0.0000027798362,0.0005387097],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99900377,0.000050554263,0.00015723315,0.0002757906,0.00021882639,0.00029383364],"domain_scores_gemma":[0.99944395,0.000046363817,0.000041202507,0.00028739046,0.00011671506,0.000064356944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003108359,0.000099980774,0.00016323052,0.00011322192,0.000037949405,0.00006971065,0.0004930435,0.000039085204,0.000008768254],"category_scores_gemma":[0.000019514951,0.00006519267,0.000027518881,0.0006763957,0.000052478357,0.00023383042,0.00007027279,0.000118835895,0.000012150535],"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.000024999195,0.000986559,0.027684443,0.000065210195,0.000026413501,0.00006569866,0.013676231,0.0005453628,0.0012949526,0.47742146,0.00013393183,0.47807473],"study_design_scores_gemma":[0.009286691,0.017504564,0.37435433,0.0011562638,0.000046689715,0.0003548846,0.002366635,0.37039915,0.11875716,0.09415405,0.008738543,0.0028810366],"about_ca_topic_score_codex":0.00007506042,"about_ca_topic_score_gemma":0.0002645903,"teacher_disagreement_score":0.7448355,"about_ca_system_score_codex":0.000026082103,"about_ca_system_score_gemma":0.00010026684,"threshold_uncertainty_score":0.26584798},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045498725,0.003981096,0.98526365,0.0003238292,0.0022225059,0.000430328,0.0000021317492,0.00029005363,0.007031445],"genre_scores_gemma":[0.37662533,0.00027263517,0.6181162,0.0013786588,0.000779055,0.000031838674,0.000001934513,0.000057443147,0.002736929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953844,0.000042696745,0.00060690456,0.0020787395,0.00093316915,0.0009541126],"domain_scores_gemma":[0.9963217,0.00048322935,0.0003140247,0.0019579295,0.00064709067,0.00027603508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008898806,0.0007678248,0.0008287689,0.00068824366,0.00062978105,0.0007097674,0.0032157288,0.00038987864,0.000023820785],"category_scores_gemma":[0.00020304546,0.00062163686,0.0002102307,0.00050361396,0.00089649815,0.0011230821,0.0030745051,0.0008946092,0.00016919446],"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.0000031287404,0.00005795815,0.000013323427,0.00013207557,0.00005501062,0.004055199,0.0077878037,0.21511173,0.00020927795,0.10449925,0.00033829888,0.66773695],"study_design_scores_gemma":[0.0001568557,0.00008503499,0.0000026449468,0.00024918796,0.0000098925675,0.0012923095,8.33949e-7,0.77999353,0.0003173144,0.21702357,0.00023900422,0.00062981056],"about_ca_topic_score_codex":0.000023367573,"about_ca_topic_score_gemma":0.00006989909,"teacher_disagreement_score":0.6671071,"about_ca_system_score_codex":0.00038390709,"about_ca_system_score_gemma":0.0005848504,"threshold_uncertainty_score":0.9996235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002240775,0.00044451392,0.8689147,0.0024656293,0.000493528,0.0006706473,0.000034269586,0.0013718585,0.123364076],"genre_scores_gemma":[0.905539,0.000003603803,0.08893643,0.00023983978,0.000563982,0.00061222236,0.00019728548,0.000028985885,0.0038786863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765444,0.000121322955,0.00046769838,0.0007942052,0.00032155812,0.0006407561],"domain_scores_gemma":[0.9972907,0.00013364365,0.00023326495,0.0014145832,0.0006684713,0.00025936987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161926,0.00027019327,0.00028645177,0.00031953174,0.00053275604,0.0006809415,0.0018999585,0.0001915888,0.000024343773],"category_scores_gemma":[0.00018486983,0.0002365149,0.0001718862,0.0011474899,0.00007787509,0.001328451,0.00021251441,0.00015680418,0.0002576932],"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.000002661,0.00022537058,0.00069369766,0.00004286244,0.000014662115,9.3094627e-7,0.00018998787,0.00004085493,0.00010523907,0.9808416,0.0062730857,0.011569049],"study_design_scores_gemma":[0.0023621728,0.0005482334,0.053630825,0.000060641287,0.00011249622,0.0001752327,0.000250983,0.25228938,0.0022784988,0.1044537,0.58216417,0.0016736424],"about_ca_topic_score_codex":0.0003052189,"about_ca_topic_score_gemma":0.00014891732,"teacher_disagreement_score":0.9032982,"about_ca_system_score_codex":0.00023050045,"about_ca_system_score_gemma":0.0004447384,"threshold_uncertainty_score":0.9644798},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006216899,0.0028520918,0.07276434,0.0018438211,0.00088569865,0.0006943985,0.00010479504,0.00029334522,0.9204993],"genre_scores_gemma":[0.026091598,0.00009915098,0.008678713,0.009141061,0.00150528,0.000031991876,0.00021147616,0.00007640724,0.9541643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966067,0.0005507078,0.0005904877,0.0009589597,0.00074581034,0.00054731074],"domain_scores_gemma":[0.9880077,0.009740009,0.0012065612,0.00043068276,0.00040387444,0.00021112674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026905981,0.0005912552,0.0008315425,0.00019262625,0.0004490261,0.0006316919,0.00079495466,0.00089849526,0.000016278042],"category_scores_gemma":[0.0037802372,0.0005005543,0.00024180075,0.00006719583,0.00005456993,0.00018693529,0.00038089865,0.0014463181,0.000004695403],"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.00015872334,0.00014120284,0.00007310605,0.00004999094,0.0029295208,0.00009334202,0.0015667003,0.0003779204,0.0000017986569,0.39266464,0.45841894,0.14352414],"study_design_scores_gemma":[0.002684313,0.0005718524,0.003165196,0.0003871237,0.0039392384,0.00018525631,0.0002794095,0.04056586,0.000008351118,0.19964118,0.7458613,0.0027109517],"about_ca_topic_score_codex":0.0045138896,"about_ca_topic_score_gemma":0.012579836,"teacher_disagreement_score":0.28744236,"about_ca_system_score_codex":0.000763868,"about_ca_system_score_gemma":0.0005722922,"threshold_uncertainty_score":0.9997446},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028124383,0.0013055252,0.021694468,0.00024739694,0.0034916787,0.00071983837,0.000013371642,0.0003847736,0.9721148],"genre_scores_gemma":[0.0073018037,0.00059277355,0.03065384,0.00039432768,0.00048193522,0.00011237885,0.000042883326,0.000060905528,0.96035916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962356,0.000028387505,0.0006154632,0.001478684,0.00074126804,0.0009005844],"domain_scores_gemma":[0.99745953,0.0000904861,0.00064299046,0.00052698195,0.00075078703,0.00052921317],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005183582,0.0007746365,0.0007346455,0.0003020736,0.0003017397,0.000525957,0.002339523,0.00049835246,0.001626423],"category_scores_gemma":[0.000065241285,0.00065793865,0.00015353078,0.0001020567,0.00020759471,0.0007043194,0.0012479656,0.00077072054,0.00013937945],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.000011761252,0.000049941667,0.0009737664,0.00009316765,0.00011862459,0.000051016727,0.00065494486,2.1565918e-7,0.0000017654233,0.4921642,0.48774517,0.01813545],"study_design_scores_gemma":[0.00059033686,0.00019163874,0.00022887379,0.00026731487,0.00006397788,0.00012497154,0.00017092146,0.002477391,0.000038771177,0.025144469,0.9694775,0.0012238807],"about_ca_topic_score_codex":0.066157505,"about_ca_topic_score_gemma":0.38922408,"teacher_disagreement_score":0.4817323,"about_ca_system_score_codex":0.0010551913,"about_ca_system_score_gemma":0.004458038,"threshold_uncertainty_score":0.9995872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059245937,0.0005725518,0.9873009,0.0003757902,0.0015478173,0.0001884155,4.7584535e-7,0.00022028282,0.0038691848],"genre_scores_gemma":[0.5831421,0.000007456083,0.415316,0.0014469321,0.00007118743,0.000006058874,2.4880813e-7,0.000005084691,0.000004965523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968118,0.00031931425,0.0003113959,0.0011621452,0.0005447305,0.0008506043],"domain_scores_gemma":[0.99771243,0.00066405884,0.00011193276,0.0011831723,0.0001818576,0.00014652988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022052722,0.00028979493,0.00029003504,0.0001726789,0.00038876105,0.0004799211,0.0026981689,0.00012595765,0.000028502516],"category_scores_gemma":[0.0007800101,0.00022281271,0.00009623734,0.0023592485,0.000643897,0.0010407141,0.000626892,0.00037392572,0.00008665502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006227958,0.00021068433,0.0025661925,0.000018908711,0.0000076121196,0.000077846584,0.0044050356,0.03935311,0.0005710053,0.75386286,0.00003178397,0.19888875],"study_design_scores_gemma":[0.00035226278,0.00014515736,0.0020483413,0.000029865601,0.0000030560827,0.00012515926,0.0000018028231,0.2049876,0.012567279,0.77865833,0.0006366896,0.00044446037],"about_ca_topic_score_codex":0.00002341048,"about_ca_topic_score_gemma":0.00002263505,"teacher_disagreement_score":0.5772175,"about_ca_system_score_codex":0.00014887357,"about_ca_system_score_gemma":0.00035987867,"threshold_uncertainty_score":0.9086039},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074775824,0.0001856243,0.91339916,0.00013596444,0.001237811,0.0003628803,0.0000020868397,0.00027274658,0.084328935],"genre_scores_gemma":[0.5486667,0.000038622744,0.44730714,0.0012620811,0.0007593654,0.000015687194,0.000007999283,0.00007011831,0.0018722613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957244,0.000030825384,0.00047893013,0.0018136413,0.0009382256,0.0010139723],"domain_scores_gemma":[0.997128,0.00029506936,0.00036502772,0.0016883259,0.00024073459,0.0002828298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006921428,0.0007310524,0.00069231837,0.000777838,0.00045473035,0.0007593028,0.004670524,0.00032359743,0.00006860522],"category_scores_gemma":[0.00004416459,0.0005416187,0.00015302996,0.0006262358,0.000959074,0.0009702647,0.0016488173,0.00082313566,0.00013893377],"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.0000149175385,0.000057609082,0.00044913095,0.00006402858,0.00002847766,0.0002715619,0.0026107335,0.00069823774,0.00008133283,0.34308797,0.00006497856,0.652571],"study_design_scores_gemma":[0.0011183594,0.0012430121,0.0024791847,0.0010783823,0.000035621957,0.0008686144,4.5597616e-7,0.19593985,0.0011943459,0.77686006,0.016436445,0.0027456721],"about_ca_topic_score_codex":0.000037898237,"about_ca_topic_score_gemma":0.00018842921,"teacher_disagreement_score":0.64982533,"about_ca_system_score_codex":0.00033322777,"about_ca_system_score_gemma":0.00042192114,"threshold_uncertainty_score":0.9997035},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36262253,0.00038465674,0.010284517,0.0015751963,0.000358521,0.0007085663,5.5082614e-7,0.00009648839,0.62396896],"genre_scores_gemma":[0.97238487,0.000011277056,0.02678998,0.000065207634,0.000040868017,0.000009123482,4.5094595e-8,0.000003164722,0.00069546234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993477,0.000025809972,0.00013943236,0.0001395474,0.00017960668,0.00016790768],"domain_scores_gemma":[0.9991885,0.00022947014,0.00019953064,0.0001297559,0.0002020328,0.00005072212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053384044,0.000078344354,0.000107619075,0.000027787317,0.00006569719,0.000040906092,0.00032373375,0.00003674318,0.0000015636301],"category_scores_gemma":[0.00034656117,0.000042803516,0.000031129774,0.00020650658,0.0000853509,0.0006045246,0.00025452234,0.00007249404,0.0000022120983],"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.000013895134,0.00025576167,0.020157248,0.000048746668,0.000021144058,1.1411628e-7,0.012538529,0.0000012326113,0.004120607,0.95866096,0.00014611619,0.004035646],"study_design_scores_gemma":[0.0014871334,0.0019400518,0.11945742,0.0004352858,0.00014537905,0.00022091997,0.007866643,0.005597588,0.6519471,0.0020754936,0.2079956,0.0008313845],"about_ca_topic_score_codex":0.000010323481,"about_ca_topic_score_gemma":0.0000019348588,"teacher_disagreement_score":0.95658547,"about_ca_system_score_codex":0.000012550237,"about_ca_system_score_gemma":0.000026997188,"threshold_uncertainty_score":0.17454767},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010377016,0.0019866698,0.5780092,0.000542631,0.0020830403,0.0004538652,0.0000019814902,0.0011926123,0.40535298],"genre_scores_gemma":[0.70998216,0.00041093782,0.22246245,0.0007774225,0.0011179933,0.000046990623,0.00012059859,0.00006399625,0.06501745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770963,0.00014481753,0.00042579602,0.00095977704,0.00035788343,0.00040207623],"domain_scores_gemma":[0.99818236,0.000089762965,0.00020748937,0.0011361146,0.00025971353,0.00012456632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045276672,0.0003551478,0.00045867992,0.00017539298,0.00014885642,0.0007852111,0.001552479,0.00031957089,0.00013702485],"category_scores_gemma":[0.000111376234,0.00028713426,0.00021458736,0.00031675326,0.00003066491,0.00021748709,0.0023900107,0.0005244974,0.0005685549],"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.00002979004,0.00043371387,0.0015861937,0.0007045108,0.00015248844,0.0004924113,0.0026877187,0.00046089172,0.0013187068,0.5123464,0.11746558,0.36232162],"study_design_scores_gemma":[0.002764616,0.000218902,0.004598884,0.0024582816,0.0001062641,0.00016221797,0.000033209344,0.45438877,0.0067314208,0.13491188,0.38973668,0.0038888904],"about_ca_topic_score_codex":0.00030370275,"about_ca_topic_score_gemma":0.000013654834,"teacher_disagreement_score":0.69960517,"about_ca_system_score_codex":0.00009887188,"about_ca_system_score_gemma":0.00024062474,"threshold_uncertainty_score":0.9999581},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07652049,0.0002251604,0.34617245,0.002425716,0.0006137281,0.00022665283,7.979438e-7,0.0006014986,0.5732135],"genre_scores_gemma":[0.84885055,0.000005952338,0.04128798,0.00041067397,0.00013866447,0.000020693764,0.000001208906,0.000014116293,0.10927018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983592,0.00004258432,0.00019571891,0.0005113959,0.00045616223,0.00043494222],"domain_scores_gemma":[0.99833983,0.00007928372,0.00004290489,0.00063508685,0.0006192484,0.00028363787],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033193297,0.00020958592,0.00022715014,0.00013952582,0.0002593626,0.000111246045,0.0007748604,0.00006471706,0.00005430665],"category_scores_gemma":[0.00011224754,0.00014758071,0.00007480889,0.0005423734,0.00007487604,0.00034455283,0.0003974279,0.00014566763,0.0009251328],"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.000079605634,0.0014376756,0.07642134,0.000106471256,0.00023525565,0.0010114063,0.05740604,0.0004428959,0.0016141206,0.4141398,0.36325014,0.08385524],"study_design_scores_gemma":[0.0017900444,0.0010109749,0.059705034,0.000114400544,0.00002431836,0.001265944,0.00049625203,0.017215103,0.00890813,0.0009996304,0.9067978,0.0016723721],"about_ca_topic_score_codex":0.00008501528,"about_ca_topic_score_gemma":0.00031628576,"teacher_disagreement_score":0.77233005,"about_ca_system_score_codex":0.00007501758,"about_ca_system_score_gemma":0.00021072153,"threshold_uncertainty_score":0.9998528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24530363,0.00026649755,0.70878893,0.002175701,0.0053142845,0.0041115833,0.0007139143,0.0012079176,0.032117568],"genre_scores_gemma":[0.9209417,0.00014070347,0.07555323,0.00058250024,0.00020359544,0.00024206971,0.00039905522,0.0000472686,0.0018898733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971484,0.000059895418,0.0010225094,0.0002672793,0.00068579224,0.0008161525],"domain_scores_gemma":[0.9975882,0.0003493086,0.0005009067,0.0009912335,0.00039573116,0.0001745856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012673496,0.0003161174,0.00039514102,0.00017042438,0.00070292054,0.00022722731,0.0015556567,0.000121339595,0.000015309954],"category_scores_gemma":[0.00013939136,0.00021278596,0.00028054195,0.000558371,0.00035643467,0.0006980593,0.0011304115,0.00025581318,0.00035448268],"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.00013580754,0.0005430811,0.0047451193,0.00076644967,0.00036602234,0.000009074507,0.016302159,0.00025706814,0.00021814379,0.90135807,0.037807774,0.037491214],"study_design_scores_gemma":[0.0033512318,0.0003578546,0.006195481,0.00013898236,0.000029916913,0.00003298534,0.0015631702,0.83773637,0.0021466424,0.009188581,0.13864917,0.0006096408],"about_ca_topic_score_codex":0.000018585444,"about_ca_topic_score_gemma":0.00003431172,"teacher_disagreement_score":0.89216954,"about_ca_system_score_codex":0.00007996541,"about_ca_system_score_gemma":0.00009548265,"threshold_uncertainty_score":0.867716},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011808581,0.005982517,0.0004051215,0.0018472319,0.0029841464,0.00040767348,0.9752501,0.00017426733,0.012830848],"genre_scores_gemma":[0.00037788448,0.0015974581,0.00092693383,0.0019207587,0.0033778378,0.00006107256,0.9868782,0.00006520499,0.0047946516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952101,0.00035077942,0.00075010606,0.0014758215,0.0009933608,0.0012198233],"domain_scores_gemma":[0.99504197,0.00038524947,0.0006159486,0.002392788,0.0009751388,0.00058889133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050799246,0.0009473385,0.0009352,0.00017022197,0.00081415335,0.0008557993,0.004428355,0.00069065543,0.00067886116],"category_scores_gemma":[0.0002126091,0.00086100935,0.00026876674,0.000561782,0.00039275677,0.000633734,0.0014991005,0.0006029796,0.00035643028],"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.0000150828455,0.00013257947,0.00029121048,0.00058644224,0.0001715537,0.00029991573,0.00072301703,0.0000035710634,0.0000030453587,0.006169127,0.9851169,0.0064875684],"study_design_scores_gemma":[0.00036172307,0.00019846455,0.0027117922,0.0004561014,0.00014747163,0.000091824775,0.000084085674,0.002390896,0.00008536863,0.00051770604,0.99196166,0.000992931],"about_ca_topic_score_codex":0.9787984,"about_ca_topic_score_gemma":0.99533325,"teacher_disagreement_score":0.016534837,"about_ca_system_score_codex":0.00030912782,"about_ca_system_score_gemma":0.0032094314,"threshold_uncertainty_score":0.99938405},"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":"protocol","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":"protocol","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014016615,0.0000030913536,0.0000059649515,0.0000054078355,0.000081001264,0.6550477,0.33049765,0.00009762348,0.00024495574],"genre_scores_gemma":[0.11355638,3.444577e-8,0.000087392364,0.0000036443887,0.00007105861,0.8509757,0.035270225,0.000015901755,0.000019691692],"study_design_codex":"randomized_trial","study_design_gemma":"randomized_trial","domain_scores_codex":[0.99758667,0.0006383645,0.00055420806,0.0004010315,0.0005408363,0.00027889336],"domain_scores_gemma":[0.99201155,0.0065925885,0.0008133958,0.00030211345,0.00022886088,0.00005151495],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039302255,0.00024186456,0.0007828721,0.00028216233,0.00013507933,0.000055068052,0.00046088727,0.000076955825,0.034127142],"category_scores_gemma":[0.0049632597,0.00013299164,0.00032592093,0.00081628654,0.000026862112,0.00021540583,0.00016090852,0.00017658786,0.000025931913],"study_design_candidate":"randomized_trial","study_design_consensus":"randomized_trial","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.92420924,0.0016886834,0.000013036252,0.00016901291,0.00011242298,0.0000025931474,0.00045125524,0.000019842568,2.4578145e-7,0.0000029418336,0.06393297,0.00939777],"study_design_scores_gemma":[0.9810236,0.006047303,0.00012688375,0.0070883348,0.000021896041,2.5992347e-7,0.00002105734,0.004924241,0.00022916934,0.000010039359,0.0003638979,0.00014327987],"about_ca_topic_score_codex":0.0000014356673,"about_ca_topic_score_gemma":0.000012169813,"teacher_disagreement_score":0.2952274,"about_ca_system_score_codex":0.000034706765,"about_ca_system_score_gemma":0.00012282172,"threshold_uncertainty_score":0.9667558},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3994274,0.00019540041,0.5591022,0.00013964181,0.0012575738,0.0003815832,0.00002488096,0.00023978448,0.039231542],"genre_scores_gemma":[0.9966542,0.00015184237,0.0007890611,0.00006121634,0.000078960664,7.459012e-7,0.0000103343755,0.000011860881,0.0022417628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977267,0.00021176474,0.0002934631,0.0012122472,0.00015114491,0.00040469272],"domain_scores_gemma":[0.9972411,0.00012508786,0.0004142569,0.0017466169,0.0003068818,0.00016609809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004823425,0.00035252704,0.00062121556,0.00017878407,0.00007544599,0.00007982258,0.0027930217,0.00048392586,0.00006498999],"category_scores_gemma":[0.00008219408,0.00033979962,0.00037466735,0.00046440028,0.00018683815,0.0002571096,0.0036158948,0.0006154413,0.00022201933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004297281,0.00026572475,0.017553836,0.00036135223,0.00013905946,0.00024708267,0.0005502817,0.017261975,0.000074632815,0.96216184,0.00051272556,0.0008285159],"study_design_scores_gemma":[0.0018212447,0.00037082392,0.051221795,0.00045807497,0.00024265547,0.000038781163,0.0001688383,0.42367604,0.0009072689,0.51640606,0.0027801492,0.0019082557],"about_ca_topic_score_codex":0.00038320108,"about_ca_topic_score_gemma":0.00004056673,"teacher_disagreement_score":0.5972268,"about_ca_system_score_codex":0.00029664562,"about_ca_system_score_gemma":0.00053075305,"threshold_uncertainty_score":0.9999054},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089798024,0.0012773032,0.010809861,0.005533717,0.0025259063,0.0009097379,0.0015283368,0.00066494563,0.9758522],"genre_scores_gemma":[0.004505454,0.0002900118,0.0034200775,0.0018334279,0.01014437,0.00009575345,0.0011568863,0.00043645632,0.9781176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9886696,0.001142644,0.0014368314,0.003018644,0.0032892635,0.0024430356],"domain_scores_gemma":[0.993813,0.0005771631,0.0012391314,0.002768403,0.00028168192,0.0013206532],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.001647137,0.0019358519,0.0025901299,0.001470954,0.0009897236,0.0022547178,0.005118307,0.0017409588,0.04254983],"category_scores_gemma":[0.0004891624,0.0016850205,0.0009770587,0.0060201106,0.0004903666,0.00051583024,0.0019630361,0.0017782714,0.0010500441],"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.00031452984,0.00015283439,0.027307136,0.00009545234,0.0020758202,0.00012593623,0.00061861426,0.000032396933,0.0000016672042,0.0016927741,0.9523147,0.0152681405],"study_design_scores_gemma":[0.0018199101,0.00011671346,0.0061801584,0.00029091758,0.0005222707,0.000044357927,0.0000382692,0.0012021278,0.000004428954,0.0005305216,0.98743194,0.0018183603],"about_ca_topic_score_codex":0.66443086,"about_ca_topic_score_gemma":0.98045444,"teacher_disagreement_score":0.31602365,"about_ca_system_score_codex":0.0010346127,"about_ca_system_score_gemma":0.0025407816,"threshold_uncertainty_score":0.9997277},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2954192,0.0017833234,0.0003044133,0.00021469849,0.0073329173,0.0021677047,0.0004164704,0.0020385121,0.69032276],"genre_scores_gemma":[0.95557255,0.00036728973,0.0136433365,0.00049829425,0.00035568295,0.0002597856,0.0002853427,0.00021201774,0.028805688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934748,0.0003661357,0.0009427624,0.0024442743,0.0013641235,0.0014079377],"domain_scores_gemma":[0.9929944,0.0009185499,0.0012612878,0.003076934,0.0009525542,0.0007962365],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0010292846,0.0013636563,0.0014348977,0.00036827038,0.0033366987,0.0007581818,0.0049423305,0.002082693,0.00022098026],"category_scores_gemma":[0.0029191282,0.0011176838,0.00059210707,0.000586482,0.00020895209,0.0014956058,0.0005277012,0.0034498023,0.0016232016],"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.00038023887,0.00059632,0.00017906353,0.0004656277,0.00038478957,0.0008772762,0.00008995036,0.000039778653,0.00036419474,0.8738065,0.000071390976,0.12274492],"study_design_scores_gemma":[0.0044181864,0.0024601857,0.009725803,0.005556586,0.0005291801,0.00032225306,0.00017777336,0.0015324648,0.01707278,0.2260485,0.7257131,0.006443189],"about_ca_topic_score_codex":0.00014262108,"about_ca_topic_score_gemma":0.0031101964,"teacher_disagreement_score":0.7256417,"about_ca_system_score_codex":0.00049520715,"about_ca_system_score_gemma":0.00025757277,"threshold_uncertainty_score":0.9999114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.959551,0.0065243053,0.0011721016,0.0069132145,0.0014652383,0.000788957,0.00004345772,0.00023057694,0.023311155],"genre_scores_gemma":[0.9821328,0.001806476,0.0071604555,0.0012706065,0.00037893525,0.0000013143756,0.000028140224,0.00003059929,0.007190677],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99852467,0.00016084537,0.00012803759,0.00043493792,0.00033119175,0.0004203455],"domain_scores_gemma":[0.99861586,0.00014667095,0.00017301475,0.00068327977,0.0001404644,0.00024071881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063081644,0.00019760175,0.00032138292,0.000115502924,0.00046919892,0.00014618199,0.0014266935,0.00018638285,0.00016344312],"category_scores_gemma":[0.000045563822,0.0001822663,0.0001143147,0.00042154774,0.0001707012,0.0023011572,0.0009946534,0.0004510507,0.00044351773],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046039931,0.00054067967,0.32649553,0.0004182335,0.00035693307,0.00029520175,0.08928604,0.000039024995,0.0019170423,0.23767503,0.25204924,0.09046663],"study_design_scores_gemma":[0.0019368486,0.00027897803,0.49629173,0.00010170991,0.000074318465,0.000012523232,0.0022157559,0.004678926,0.0001013974,0.001098325,0.49269152,0.000517995],"about_ca_topic_score_codex":0.000525169,"about_ca_topic_score_gemma":0.0004761668,"teacher_disagreement_score":0.24064225,"about_ca_system_score_codex":0.000051930314,"about_ca_system_score_gemma":0.000131475,"threshold_uncertainty_score":0.74326044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9334185,0.00038450747,0.00009682802,0.000030104891,0.0025645434,0.0015336513,0.0004426345,0.000562366,0.060966823],"genre_scores_gemma":[0.98789304,0.000041665317,0.0071318415,0.00006739221,0.000032240438,0.00028585832,0.00062045734,0.00009739975,0.0038300804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99408156,0.00080004643,0.0015120095,0.0016736508,0.0010838071,0.00084892503],"domain_scores_gemma":[0.9950289,0.0013461141,0.0011083221,0.0011267154,0.0011673364,0.00022262172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023674895,0.0007609544,0.0013157248,0.0007441098,0.00047837102,0.0001286805,0.002172697,0.000709922,0.0000780097],"category_scores_gemma":[0.0031796035,0.00075083575,0.00044628108,0.0018740265,0.00013796406,0.0010277159,0.00040234142,0.001205498,0.0005022675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013713172,0.00048265143,0.00032536092,0.00047075874,0.000110643385,0.00006777734,0.00014406086,0.00016355037,0.0060138237,0.9522374,0.000004302612,0.039842486],"study_design_scores_gemma":[0.0028106256,0.0010622966,0.06140079,0.0012044365,0.0001314764,0.000020554782,0.0012219902,0.005667816,0.02477411,0.8964149,0.0026407558,0.0026502642],"about_ca_topic_score_codex":0.0006851545,"about_ca_topic_score_gemma":0.0032192904,"teacher_disagreement_score":0.06107543,"about_ca_system_score_codex":0.0005692342,"about_ca_system_score_gemma":0.0002585989,"threshold_uncertainty_score":0.99949425},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003965585,0.00028467897,0.09056625,0.0011971476,0.0003889644,0.0001032761,8.046774e-8,0.00023540131,0.9032586],"genre_scores_gemma":[0.94669366,0.000013926863,0.017189726,0.0006142343,0.00007211896,0.000006286598,1.6125384e-7,0.0000048585935,0.03540503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992369,0.000038955415,0.00011559083,0.0002517403,0.000109188506,0.00024765995],"domain_scores_gemma":[0.9995307,0.00005534066,0.000026701371,0.00029945292,0.000041404965,0.00004644766],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001589835,0.000089869674,0.00009577847,0.000054304124,0.000045761655,0.00009729945,0.000519821,0.000054392967,0.0010754206],"category_scores_gemma":[0.00004194838,0.00006142196,0.000025846584,0.00039402588,0.000029924418,0.00024422377,0.00018236368,0.000096665564,0.00052664033],"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":[4.983623e-7,0.00008444319,0.0032009818,0.0000041593544,0.0000022106306,0.000019739335,0.0007372842,0.000013462917,0.000038257193,0.96355903,0.0031510037,0.029188951],"study_design_scores_gemma":[0.002331207,0.00040106414,0.04176475,0.00006945296,0.000009063384,0.00005838448,0.0001600583,0.51211005,0.0017294682,0.20694295,0.23284817,0.0015753874],"about_ca_topic_score_codex":0.000015930626,"about_ca_topic_score_gemma":0.00003642177,"teacher_disagreement_score":0.9427281,"about_ca_system_score_codex":0.00002633805,"about_ca_system_score_gemma":0.000011384315,"threshold_uncertainty_score":0.99983776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60639584,0.22618547,0.12780674,0.0046588564,0.006415082,0.0077893175,0.00030957608,0.000501674,0.019937461],"genre_scores_gemma":[0.97985286,0.016252598,0.00059131614,0.0016420189,0.00069758156,0.00012680309,0.000020471964,0.0001242141,0.0006921524],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9911783,0.0017171466,0.0019859395,0.0017836534,0.001667052,0.0016679057],"domain_scores_gemma":[0.99441904,0.0011982404,0.0015909501,0.0013333961,0.0003511729,0.0011072265],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029017194,0.0012285017,0.0022912647,0.001289618,0.0012352527,0.0040619737,0.006038409,0.00041967846,0.00101222],"category_scores_gemma":[0.00013690478,0.0011010729,0.00067374046,0.0020314418,0.00035033628,0.0035655464,0.0008452986,0.0012317027,0.000040016395],"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.0012020527,0.0049810037,0.32085496,0.0038394148,0.001594931,0.00055836013,0.00890159,0.00044840234,0.09111181,0.004327827,0.0877743,0.47440535],"study_design_scores_gemma":[0.0075050932,0.00093159167,0.78591883,0.0061126435,0.0005051688,0.00017517911,0.0001554642,0.0028630455,0.15240797,0.011337787,0.029153079,0.0029341523],"about_ca_topic_score_codex":0.0020449206,"about_ca_topic_score_gemma":0.00044372512,"teacher_disagreement_score":0.47147122,"about_ca_system_score_codex":0.00034193174,"about_ca_system_score_gemma":0.00057776377,"threshold_uncertainty_score":0.999901},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45249364,0.0056443773,0.030360144,0.001815258,0.0046578245,0.002265079,0.00026902588,0.0003738379,0.5021208],"genre_scores_gemma":[0.99208844,0.0018626702,0.0006914693,0.000036472164,0.000049728787,0.0000027532976,0.00001804482,0.000005176471,0.005245268],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9985931,0.00016223443,0.0001856331,0.00044820076,0.00033449903,0.00027634355],"domain_scores_gemma":[0.99889714,0.00010690786,0.00024130828,0.0002832017,0.00026401452,0.00020742304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036825784,0.00017777355,0.00032826135,0.0030608904,0.0005616224,0.0005156149,0.0012594139,0.000093348885,0.000018254987],"category_scores_gemma":[0.0000027724134,0.00017719548,0.000085424974,0.005891034,0.00020084323,0.0010887034,0.00087261695,0.00015465412,0.000009555597],"study_design_candidate":"observational","study_design_consensus":null,"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.0002794642,0.00036818653,0.3367166,0.00062702055,0.001484706,0.0025701728,0.0042722486,0.000092507216,0.0012237201,0.08837052,0.55826575,0.005729117],"study_design_scores_gemma":[0.0039428067,0.0007402801,0.8407669,0.0006713508,0.00024177208,0.0005594795,0.011477946,0.033936318,0.00023191434,0.0047180997,0.10110136,0.0016117764],"about_ca_topic_score_codex":0.12390659,"about_ca_topic_score_gemma":0.031738915,"teacher_disagreement_score":0.53959477,"about_ca_system_score_codex":0.00002269528,"about_ca_system_score_gemma":0.00019073844,"threshold_uncertainty_score":0.9859293},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010302871,0.0068405177,0.014611178,0.002725077,0.0014034108,0.00028564138,0.0000060968773,0.0003592271,0.963466],"genre_scores_gemma":[0.9852929,0.00016084283,0.004784607,0.0005143857,0.00017672412,0.000018260565,7.269613e-7,0.000008591597,0.00904296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895394,0.000081994905,0.00020880334,0.00024367789,0.00021712307,0.0002944529],"domain_scores_gemma":[0.9987607,0.00015831461,0.000082642626,0.00076839456,0.0000978465,0.0001320824],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002705469,0.00011162432,0.00013430498,0.000019456711,0.0004594203,0.00018813231,0.0010684201,0.000059093018,0.0001746673],"category_scores_gemma":[0.000065429434,0.00007608107,0.0001025884,0.0002495328,0.0001961635,0.0003396477,0.0002188278,0.00017054411,0.0010485058],"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":[8.126423e-7,0.000047438047,0.00011638869,0.0000038010605,0.000009976206,0.0000031996212,0.00019292631,0.00001177449,0.00015351185,0.99186444,0.0058135483,0.0017821857],"study_design_scores_gemma":[0.00055148284,0.00014530169,0.001177017,0.000036358615,0.000014533415,0.000028965409,0.00005864439,0.0073549193,0.0031533486,0.054319974,0.9328374,0.00032201043],"about_ca_topic_score_codex":0.00020341393,"about_ca_topic_score_gemma":0.00058631133,"teacher_disagreement_score":0.97499,"about_ca_system_score_codex":0.000025259158,"about_ca_system_score_gemma":0.0000178307,"threshold_uncertainty_score":0.9997293},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031558093,0.000586985,0.000026940925,0.0028011177,0.0009831933,0.000417407,0.000053421212,0.00015793764,0.99496984],"genre_scores_gemma":[0.0007693991,0.00016961017,0.00035932692,0.0013980196,0.00041803918,0.000024297642,0.000017692919,0.00006263772,0.996781],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997995,0.00015362269,0.00050528254,0.0002640793,0.0006363015,0.00044570531],"domain_scores_gemma":[0.99776703,0.00035643726,0.0006061187,0.0009990558,0.00015506752,0.000116303396],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039080455,0.00037724205,0.00033522258,0.000037029527,0.00022127728,0.0001549017,0.0021270344,0.00024650185,0.128278],"category_scores_gemma":[0.00013824788,0.00019637927,0.00015753278,0.000014509159,0.00022346407,4.835802e-7,0.00035772688,0.0003423857,0.009321318],"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.000008288927,0.000013422644,0.0000013886968,0.000065779765,0.00005135098,0.000013898468,0.00020616932,0.000014114497,6.8304615e-8,0.0014026675,0.9935102,0.0047126366],"study_design_scores_gemma":[0.00026523267,0.00004951084,0.000013664172,0.00010721508,0.00002431458,0.000076967735,0.00004441206,0.00006442012,0.0000060419816,0.000059007823,0.9989941,0.00029510958],"about_ca_topic_score_codex":0.23787095,"about_ca_topic_score_gemma":0.33049482,"teacher_disagreement_score":0.118956685,"about_ca_system_score_codex":0.000107030246,"about_ca_system_score_gemma":0.00029900044,"threshold_uncertainty_score":0.99145},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027848002,0.000053806478,0.002523926,0.0031065452,0.00039869922,0.0009853792,0.000023021694,0.00014214955,0.9649185],"genre_scores_gemma":[0.97916573,0.0010066768,0.0015233071,0.00032746064,0.00015826347,0.00001486047,0.000026635911,0.00003605859,0.017741013],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99778366,0.001127686,0.00019224716,0.00043714675,0.00030364323,0.00015559698],"domain_scores_gemma":[0.9966549,0.001686522,0.0007175795,0.0008489484,0.000046127752,0.00004590845],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0030095784,0.00017542699,0.0002563416,0.00013049967,0.00042364746,0.00036163704,0.0013461863,0.00018264283,0.0022695877],"category_scores_gemma":[0.0012906822,0.00014202534,0.0000606089,0.00019432345,0.00021987861,0.0009058613,0.0014625504,0.00075104326,0.0034803594],"study_design_candidate":"qualitative","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.00018327915,0.00054464326,0.05056408,0.0018097158,0.00042124983,0.00005021673,0.72004205,0.00006192229,0.000094294955,0.03522206,0.111091234,0.07991525],"study_design_scores_gemma":[0.0030522258,0.0000100766765,0.2994906,0.0038055992,0.00019153907,0.00010532877,0.2628755,0.002142779,0.000212567,0.012285128,0.41458613,0.0012425199],"about_ca_topic_score_codex":0.0003390715,"about_ca_topic_score_gemma":0.0021208755,"teacher_disagreement_score":0.9513177,"about_ca_system_score_codex":0.000062732775,"about_ca_system_score_gemma":0.00008472493,"threshold_uncertainty_score":0.99864244},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011845702,0.0032979026,0.000016283158,0.00036851296,0.0024082374,0.00063254684,0.00006361981,0.00027435023,0.9928201],"genre_scores_gemma":[0.0034494277,0.0011213794,0.003911499,0.00066999556,0.000819772,0.00002677041,0.00019529759,0.00012310753,0.98968273],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951991,0.0002486688,0.001583823,0.00083754375,0.0011069836,0.0010238728],"domain_scores_gemma":[0.9955452,0.0002882837,0.0014018797,0.0015172976,0.00078222435,0.0004651222],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000686831,0.0009728746,0.0012358953,0.00017384658,0.00032267103,0.00051781465,0.0020199288,0.0010444076,0.589574],"category_scores_gemma":[0.00036597034,0.00095815415,0.0006460905,0.000050064027,0.0003599635,9.947503e-7,0.00086679525,0.0008471327,0.12181868],"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.0000494297,0.00015697072,0.0000128358615,0.00096558634,0.0001750765,0.00015992644,0.0014048747,0.00026389371,9.949646e-7,0.0014768126,0.9887565,0.0065771295],"study_design_scores_gemma":[0.0009565134,0.00032008567,0.00005087169,0.0008462164,0.00009897941,0.0003719738,0.00022712428,0.0006131219,0.000046613593,0.000055504494,0.99538124,0.0010317881],"about_ca_topic_score_codex":0.0032637387,"about_ca_topic_score_gemma":0.0013930204,"teacher_disagreement_score":0.46775532,"about_ca_system_score_codex":0.00017011784,"about_ca_system_score_gemma":0.00028798654,"threshold_uncertainty_score":0.9992869},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925593,0.00038019233,0.0014188025,0.00013581532,0.0018307283,0.00033704753,0.00031637633,0.00033600934,0.0026856915],"genre_scores_gemma":[0.9777266,0.00009541517,0.0051147407,0.00010277532,0.00045517745,0.0000076050114,0.003802852,0.00009502551,0.012599812],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99570376,0.0004455289,0.0004270499,0.0015097422,0.0011675329,0.00074636244],"domain_scores_gemma":[0.99686074,0.00014172951,0.0011747854,0.0010512295,0.00045140137,0.00032008768],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006550269,0.00068260386,0.0009327986,0.00076001935,0.0012579131,0.0003220982,0.0032513693,0.0006775107,0.0022871143],"category_scores_gemma":[0.00009443415,0.00077425886,0.0003678658,0.0011768742,0.00015065631,0.0020396106,0.0009490114,0.0011059556,0.00004618921],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"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.028277187,0.004697532,0.0685024,0.0019507415,0.0054021515,0.0075055985,0.26844144,0.000026214431,0.35735974,0.0387199,0.013393745,0.20572336],"study_design_scores_gemma":[0.05271029,0.010490185,0.4223814,0.0069206594,0.004812761,0.00041297928,0.07081769,0.00339195,0.19234368,0.011892991,0.20714296,0.01668245],"about_ca_topic_score_codex":0.006749376,"about_ca_topic_score_gemma":0.0043001324,"teacher_disagreement_score":0.353879,"about_ca_system_score_codex":0.00050237786,"about_ca_system_score_gemma":0.00041444003,"threshold_uncertainty_score":0.99986476},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010348165,0.00015187627,0.033682384,0.0003319187,0.013816893,0.00045776792,0.000017028671,0.00031821363,0.95112044],"genre_scores_gemma":[0.0032500424,0.00003298765,0.011419782,0.0016015726,0.0005358285,0.000021386028,0.0000076943015,0.000114201146,0.9830165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960699,0.00008559098,0.00039098022,0.0015464438,0.00085108506,0.0010559811],"domain_scores_gemma":[0.997777,0.00006104451,0.00025597308,0.0013963303,0.00013610389,0.00037357802],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045873743,0.00061190897,0.00062076916,0.00064689794,0.00015266078,0.0002003851,0.0035094644,0.00030196633,0.0033630293],"category_scores_gemma":[0.0000097627435,0.00047489646,0.0000982,0.0005615744,0.00029223494,0.00028111716,0.00067326805,0.0005798234,0.00093753537],"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.0000053486006,0.00016278353,0.0005420097,0.000021326672,0.000017433933,0.00014270109,0.00068545254,0.000027539118,0.0000073082456,0.022275286,0.9749364,0.0011763785],"study_design_scores_gemma":[0.0008741104,0.00041460173,0.0023667447,0.00027866082,0.00001667335,0.00005159713,0.000017323924,0.0022651406,0.0002589183,0.00096707133,0.9908962,0.0015929494],"about_ca_topic_score_codex":0.92995745,"about_ca_topic_score_gemma":0.99412125,"teacher_disagreement_score":0.06416376,"about_ca_system_score_codex":0.0010165747,"about_ca_system_score_gemma":0.004023863,"threshold_uncertainty_score":0.9998404},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3177778,0.010820563,0.013175665,0.0011631588,0.010874235,0.0019450904,0.00030059315,0.0011316421,0.64281124],"genre_scores_gemma":[0.8351583,0.0016182155,0.0020278888,0.00053597987,0.00066145475,0.000018399527,0.0046161925,0.000069035574,0.15529457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818605,0.000111937545,0.00018987372,0.0007776417,0.00033488963,0.00039960173],"domain_scores_gemma":[0.9988506,0.00009891271,0.0001785063,0.0004948623,0.00023569482,0.00014145869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010185483,0.00031374794,0.00036505866,0.0006295176,0.00016646665,0.00009563316,0.0011789826,0.000374364,0.00016763234],"category_scores_gemma":[0.00004250985,0.00038022758,0.00017255006,0.0013425915,0.000041771364,0.00073745404,0.00017527414,0.00048753325,0.00019065013],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.0002025751,0.0013819088,0.25088215,0.0007720101,0.00039359197,0.008711734,0.0023211145,0.00007814794,0.000025314786,0.6243142,0.07622289,0.034694355],"study_design_scores_gemma":[0.002489678,0.00017434209,0.03869964,0.000717932,0.00009144863,7.605282e-8,0.015334093,0.0015508208,0.0012467707,0.0057638492,0.9321664,0.0017649772],"about_ca_topic_score_codex":0.00020094508,"about_ca_topic_score_gemma":0.1313076,"teacher_disagreement_score":0.8559435,"about_ca_system_score_codex":0.00025406055,"about_ca_system_score_gemma":0.00030681136,"threshold_uncertainty_score":0.99986494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001375854,0.00019791332,0.9609594,0.0006909823,0.0014015604,0.0007131381,0.000001475957,0.00007996205,0.035818037],"genre_scores_gemma":[0.7295061,0.000049218084,0.26509762,0.0028644777,0.0015012583,0.000083531675,0.000024297431,0.000027455402,0.0008460617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967324,0.00009973819,0.0004956892,0.0013452087,0.00076208805,0.00056483375],"domain_scores_gemma":[0.9974961,0.00057057216,0.00025881288,0.0013664487,0.00020704861,0.00010099772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017643692,0.00043495055,0.00039356513,0.00090698735,0.000346724,0.0009244309,0.0039085764,0.000296539,0.0000110408355],"category_scores_gemma":[0.0001415839,0.00033277966,0.00010756688,0.001151432,0.0003430009,0.0009921831,0.00072855566,0.0008206289,0.00003017429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038089945,0.000037311598,0.00019067533,0.000031493215,0.0000045175234,0.000055095996,0.0031876347,0.0061181653,0.000046929625,0.056509573,0.00005457505,0.9337602],"study_design_scores_gemma":[0.00034947373,0.0001711645,0.0016094998,0.00043977262,0.000008893301,0.000033060696,0.00000209021,0.90074414,0.00042638934,0.09066158,0.0049000047,0.0006539423],"about_ca_topic_score_codex":0.00008341397,"about_ca_topic_score_gemma":0.000765301,"teacher_disagreement_score":0.9331063,"about_ca_system_score_codex":0.00036260704,"about_ca_system_score_gemma":0.00067817955,"threshold_uncertainty_score":0.99991244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029972684,0.00032319524,0.60325587,0.0012607939,0.00043741596,0.00012194427,1.7111704e-7,0.00018489093,0.36444303],"genre_scores_gemma":[0.95124876,0.000009308264,0.04751442,0.00036207418,0.000020341664,0.0000013077015,7.696244e-8,0.0000015458851,0.00084213616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991551,0.0000078865705,0.00015106372,0.00021576919,0.00022868201,0.00024150692],"domain_scores_gemma":[0.9993547,0.000007264112,0.0000614297,0.00034730884,0.00009286846,0.00013639119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056834414,0.000052316132,0.000104803315,0.000111241454,0.00013247953,0.000057209967,0.0008517767,0.000014734039,0.000037020967],"category_scores_gemma":[0.000050143404,0.00003799889,0.000028661401,0.00076067605,0.00013490525,0.00037312877,0.00019150694,0.000046524892,0.00023227299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.190157e-7,0.000057018875,0.0022754748,0.000006336866,0.0000012747066,7.244242e-7,0.00027329184,0.000028620936,0.00030713392,0.9872758,0.00056463433,0.0092093665],"study_design_scores_gemma":[0.0038319505,0.0017165535,0.41451728,0.00019250155,0.0000052227433,0.000115086696,0.0003977889,0.006576878,0.104791194,0.44164985,0.025162749,0.0010429431],"about_ca_topic_score_codex":0.00013384486,"about_ca_topic_score_gemma":0.000014213656,"teacher_disagreement_score":0.9212761,"about_ca_system_score_codex":0.00007561538,"about_ca_system_score_gemma":0.0010153855,"threshold_uncertainty_score":0.2985477},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018686322,0.002141576,0.088688,0.00039833324,0.0012214788,0.00017199565,0.0000014794033,0.00082039036,0.88787043],"genre_scores_gemma":[0.89466935,0.00041772716,0.018924797,0.0011466119,0.0005305045,0.000019442701,0.000006253514,0.000020566138,0.08426473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998435,0.000056933015,0.00022576863,0.00050394906,0.0002987656,0.0004795389],"domain_scores_gemma":[0.99876845,0.000081661,0.000062557665,0.00077233,0.000092214505,0.0002227899],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019697002,0.0002060209,0.00022837418,0.000040257128,0.00027794245,0.00009469272,0.0011355889,0.000107477186,0.0003166788],"category_scores_gemma":[0.000041316125,0.00016041491,0.00012698902,0.00018998251,0.00008511226,0.00071568997,0.00036327087,0.00012901069,0.0013059436],"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.000011654284,0.00035230158,0.013387635,0.0000210177,0.000052036004,0.0002577506,0.0035832962,0.000008083986,0.00045987265,0.70976436,0.24355222,0.028549766],"study_design_scores_gemma":[0.0020406265,0.0006552165,0.07139947,0.000058674723,0.000024947813,0.000763193,0.00025786343,0.06007664,0.003617314,0.008193234,0.85109353,0.0018193083],"about_ca_topic_score_codex":0.00057825306,"about_ca_topic_score_gemma":0.0006574886,"teacher_disagreement_score":0.87598306,"about_ca_system_score_codex":0.000099306475,"about_ca_system_score_gemma":0.00014005306,"threshold_uncertainty_score":0.99947166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44798502,0.0002379923,0.35321295,0.00008849088,0.00021077774,0.00012597982,1.4717601e-7,0.00025694203,0.19788171],"genre_scores_gemma":[0.9689256,0.000015180006,0.03006143,0.0000834157,0.000056010947,0.0000023262548,0.000001055387,0.000004769487,0.0008502375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988676,0.000019983836,0.00023155934,0.00042928004,0.00015770514,0.00029392279],"domain_scores_gemma":[0.99914455,0.00015801625,0.00009285751,0.0004070132,0.00006828118,0.0001293013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160878,0.00011482413,0.00011971083,0.00006740024,0.00016656908,0.0001736653,0.00035624515,0.00009326693,0.0000485007],"category_scores_gemma":[0.00014372522,0.000092201015,0.000038440572,0.00022591309,0.0000447103,0.0008017778,0.00019114275,0.00014881327,0.000059035596],"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.000028162023,0.00018149789,0.10674871,0.000030724932,0.00002186811,0.00003783161,0.0022528262,0.000007819422,0.0017955119,0.54307306,0.000350319,0.34547165],"study_design_scores_gemma":[0.00025363834,0.00003471449,0.97640777,0.00001133367,0.0000033815097,0.000016920307,0.00003312974,0.010301348,0.0023464302,0.0096765235,0.00075918256,0.00015562962],"about_ca_topic_score_codex":0.000044203975,"about_ca_topic_score_gemma":0.00010057707,"teacher_disagreement_score":0.86965907,"about_ca_system_score_codex":0.000055761484,"about_ca_system_score_gemma":0.000046147365,"threshold_uncertainty_score":0.37598485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8201461,0.000021076672,0.15739948,0.0012626349,0.00013019945,0.0002363623,0.0000020997577,0.00004006073,0.020761983],"genre_scores_gemma":[0.99473286,0.0000053759263,0.004322942,0.0007016239,0.000018010469,0.000008570813,0.000002328532,0.0000027460296,0.00020555359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993627,0.00006317451,0.00017527713,0.00015839553,0.00012411768,0.00011632396],"domain_scores_gemma":[0.9993639,0.000282986,0.000058191923,0.00024184522,0.000028600438,0.000024483103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028869146,0.00006461318,0.00007354237,0.000052835872,0.000042469743,0.00004231383,0.00030047455,0.000031726206,0.00087785994],"category_scores_gemma":[0.000054508455,0.000041172803,0.000022442855,0.00018196383,0.000013764823,0.00013617921,0.00007238587,0.000060833412,0.00017675085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006958123,0.00013924003,0.0015186477,0.0000021472063,0.000010487804,0.0000031490492,0.009457952,0.000112583686,0.0013066612,0.857539,0.0055916603,0.12431153],"study_design_scores_gemma":[0.00097329094,0.00039378487,0.4399557,0.000029911233,0.000010636539,0.0000023853677,0.00086434116,0.029763168,0.046083357,0.480591,0.0009860108,0.00034639915],"about_ca_topic_score_codex":0.00010218582,"about_ca_topic_score_gemma":0.00045609477,"teacher_disagreement_score":0.43843704,"about_ca_system_score_codex":0.000023570292,"about_ca_system_score_gemma":0.0000088437355,"threshold_uncertainty_score":0.9611951},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2518375,0.0073707122,0.39582434,0.009407869,0.004828425,0.0006393401,0.0000023798482,0.00017408305,0.32991534],"genre_scores_gemma":[0.96906596,0.000018518105,0.003317665,0.00027825445,0.00046327352,0.000007132457,0.0000013795502,0.0000045758493,0.026843207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991306,0.00008021151,0.00018984589,0.00023872514,0.00021137971,0.00014921429],"domain_scores_gemma":[0.9989951,0.00011641089,0.00013192015,0.0006658069,0.00006504223,0.000025690453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009226375,0.00010046344,0.000098735305,0.000023683431,0.00015325879,0.00015701848,0.00138158,0.000057119523,0.00007042617],"category_scores_gemma":[0.00003811284,0.000049230024,0.000078279954,0.00029193776,0.000058558355,0.00038692268,0.00026147734,0.00010246239,0.000040946798],"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.0000047475196,0.00019749698,0.0044309436,0.0000051573597,0.000013575444,6.910185e-7,0.0043989974,0.00018182243,0.002372145,0.7791587,0.16198847,0.04724723],"study_design_scores_gemma":[0.0005221653,0.000039814284,0.37571955,0.000064699525,0.000032439242,0.0000076168317,0.000075188036,0.010550978,0.08923393,0.23991929,0.28350094,0.00033337984],"about_ca_topic_score_codex":0.0036749197,"about_ca_topic_score_gemma":0.0012626933,"teacher_disagreement_score":0.7172285,"about_ca_system_score_codex":0.000027164939,"about_ca_system_score_gemma":0.0005843025,"threshold_uncertainty_score":0.5555404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5739969,0.000689954,0.19018105,0.0013271155,0.00028060353,0.00034509506,5.070795e-7,0.00068738096,0.23249142],"genre_scores_gemma":[0.9821013,0.00006449804,0.0144234225,0.0007486473,0.00012266349,0.000019363562,0.0000020936723,0.000011905838,0.002506079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99842036,0.00006863292,0.0001936277,0.00056342874,0.00031518182,0.000438745],"domain_scores_gemma":[0.9989395,0.000064221436,0.000075219825,0.0005102344,0.00013408206,0.0002767363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025214133,0.00020458181,0.000202086,0.00013899259,0.00046855686,0.00038492057,0.0005110674,0.00007953964,0.0001410213],"category_scores_gemma":[0.00006975278,0.00014430963,0.000043173706,0.0006335335,0.00012228968,0.0009645561,0.00022804647,0.00025351,0.0002522978],"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.00003447798,0.0005634319,0.34728003,0.00004253418,0.00006400249,0.00020553525,0.004374966,0.00006902049,0.0011853464,0.6185819,0.004067313,0.023531476],"study_design_scores_gemma":[0.006724715,0.0011657333,0.83607626,0.00034731807,0.000054395605,0.0033339113,0.00062194077,0.023691328,0.00192522,0.0062676235,0.11705116,0.0027404202],"about_ca_topic_score_codex":0.00015587862,"about_ca_topic_score_gemma":0.00022727578,"teacher_disagreement_score":0.6123142,"about_ca_system_score_codex":0.000053967116,"about_ca_system_score_gemma":0.00013055222,"threshold_uncertainty_score":0.5884776},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015750187,0.000034249537,0.5197063,0.0020679848,0.00026245482,0.000024472298,1.2177959e-7,0.00019763804,0.47613174],"genre_scores_gemma":[0.86213964,0.000060290782,0.10303007,0.00079503696,0.00007744517,0.0000058054534,0.0000014321421,0.0000027780543,0.033887517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996579,0.000013915104,0.000059133297,0.0001176783,0.000050142917,0.0001012144],"domain_scores_gemma":[0.9996718,0.000031101674,0.000013458858,0.00021010767,0.000029973022,0.000043553955],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000050849438,0.00003712048,0.00004055144,0.00002674422,0.00013801118,0.000021608415,0.00030332612,0.000016253436,0.0002191791],"category_scores_gemma":[0.000019012683,0.000028521028,0.000024128223,0.00014570172,0.00001542502,0.00019441769,0.00008615249,0.000034372788,0.00078966474],"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":[2.515506e-7,0.00005312979,0.0018366824,7.782808e-7,0.0000039952142,0.000008566541,0.00095184223,0.0000013198851,0.000045301244,0.7789424,0.190496,0.02765973],"study_design_scores_gemma":[0.00032650182,0.00007065358,0.013620717,0.0000041860676,0.0000017463324,0.00016916762,0.00003134528,0.014671034,0.002135358,0.016182113,0.9525268,0.00026034098],"about_ca_topic_score_codex":0.000011343231,"about_ca_topic_score_gemma":0.000008941428,"teacher_disagreement_score":0.8605646,"about_ca_system_score_codex":0.000009303078,"about_ca_system_score_gemma":0.00002784171,"threshold_uncertainty_score":0.9999883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083097446,0.006115249,0.9438827,0.0010470172,0.0074807745,0.0019968264,0.000037662834,0.00025998827,0.03909669],"genre_scores_gemma":[0.635242,0.00020847816,0.17645378,0.0004302188,0.00031454547,0.00066179363,0.000008750289,0.000025302252,0.18665516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701536,0.00017779208,0.00062023895,0.0011934729,0.00024976084,0.0007433923],"domain_scores_gemma":[0.99696654,0.00039687598,0.00019421648,0.00088310195,0.0013311687,0.00022808382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005935252,0.00041995946,0.0004987281,0.0003910379,0.00084512855,0.0007564909,0.001308636,0.00023822978,0.000054031952],"category_scores_gemma":[0.00058413483,0.000368476,0.00033205806,0.00092666317,0.00013376327,0.0004689884,0.000445335,0.00022061121,0.0002744311],"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.000013069455,0.0010217463,0.00034585374,0.0001481808,0.00025627532,0.0000070333826,0.007506348,0.00043800706,0.00011605797,0.973999,0.011695939,0.0044524604],"study_design_scores_gemma":[0.0026405412,0.00013801875,0.001350514,0.00016605368,0.00008416327,0.0000060028274,0.0059695584,0.95489305,0.00038993885,0.00051689934,0.033385597,0.0004596354],"about_ca_topic_score_codex":0.00069742056,"about_ca_topic_score_gemma":0.0005535441,"teacher_disagreement_score":0.97348213,"about_ca_system_score_codex":0.00067262544,"about_ca_system_score_gemma":0.0006409262,"threshold_uncertainty_score":0.99987674},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096809315,0.00053294003,0.4263791,0.0001898661,0.00049871526,0.000307839,0.000027052123,0.00021815559,0.5717495],"genre_scores_gemma":[0.3841984,0.000046982677,0.03048342,0.0023248927,0.0013251692,0.000008433017,0.00002888438,0.00014602659,0.58143777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817973,0.000028029528,0.0002831296,0.0007894855,0.0003885223,0.00033110974],"domain_scores_gemma":[0.99853545,0.00012995182,0.00025777222,0.0007717508,0.00016958991,0.00013545566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000100187564,0.00048204363,0.0004374026,0.00008865048,0.00034165138,0.000360639,0.0014128566,0.00032830934,0.00020030957],"category_scores_gemma":[0.00003591283,0.00029781283,0.00020528525,0.00007464657,0.00011677144,0.00031203302,0.0009648955,0.00063792185,0.0000721975],"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.0000033944345,0.0000029949738,0.000019696803,0.000019788264,0.00009832348,0.000022035036,0.0012038117,0.0016519421,0.000111656525,0.9948095,0.0014149065,0.0006419688],"study_design_scores_gemma":[0.00027232023,0.00008062213,0.00002726432,0.00013614082,0.00012552136,0.000060861144,0.000026446553,0.6224525,0.0004670675,0.36071524,0.01476991,0.0008661333],"about_ca_topic_score_codex":0.000015822321,"about_ca_topic_score_gemma":0.00008019634,"teacher_disagreement_score":0.63409424,"about_ca_system_score_codex":0.00012575931,"about_ca_system_score_gemma":0.00029094706,"threshold_uncertainty_score":0.9999474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8475331,0.00244196,0.13565108,0.0035571584,0.0019072323,0.0006278077,0.0001848328,0.00017282313,0.007923993],"genre_scores_gemma":[0.99479353,0.00039958724,0.0012369617,0.0010730411,0.00010535015,0.000089473375,0.00005450784,0.000013072062,0.0022344985],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9971116,0.00023968668,0.00058443414,0.0012462832,0.00017464386,0.00064331555],"domain_scores_gemma":[0.9971912,0.00073942274,0.00011521174,0.0014591973,0.0002039077,0.00029107256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008083738,0.00036456727,0.00038745752,0.0006873159,0.00067582366,0.00020124204,0.00078920415,0.00008300635,0.00009562783],"category_scores_gemma":[0.0012642394,0.00033272555,0.00009095417,0.0023924352,0.00018968401,0.0007138573,0.0014159285,0.00035404204,0.00018580946],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004444228,0.0015231639,0.73267895,0.00014280085,0.000108060754,0.00008868548,0.012867537,0.00032153685,0.0014571298,0.22686745,0.016264215,0.007636031],"study_design_scores_gemma":[0.0021914386,0.00042752994,0.7162462,0.0013115361,0.00010225891,0.000063966196,0.008213905,0.08097956,0.0071495557,0.00057056826,0.18131325,0.0014302593],"about_ca_topic_score_codex":0.00073104224,"about_ca_topic_score_gemma":0.0041469345,"teacher_disagreement_score":0.22629689,"about_ca_system_score_codex":0.00015161479,"about_ca_system_score_gemma":0.0004191906,"threshold_uncertainty_score":0.9999125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7308135,0.00053558673,0.23837289,0.00040209395,0.0010487067,0.0010121039,0.00004676926,0.00016515762,0.027603187],"genre_scores_gemma":[0.98373145,0.00006486817,0.015211616,0.00041663533,0.000049197697,0.000032537708,0.000029069412,0.0000136317185,0.00045101033],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978663,0.00003987808,0.00093201443,0.00027466213,0.00024366894,0.00064348086],"domain_scores_gemma":[0.9986472,0.00023934101,0.00035056463,0.00046975934,0.00018519754,0.00010793969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008558594,0.0002873546,0.0005048404,0.00033857973,0.0001867368,0.00035434723,0.0008266857,0.00019695977,0.000008066389],"category_scores_gemma":[0.00013987265,0.00025658315,0.00012879947,0.00056206936,0.00014971553,0.0011971026,0.0004964019,0.00029819258,0.000009396153],"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.00042828778,0.0012469449,0.59216315,0.0037126946,0.0004538159,0.000022302436,0.046898097,0.0010730405,0.00016353565,0.24999458,0.015888304,0.08795526],"study_design_scores_gemma":[0.0059677204,0.00035487773,0.04338917,0.0009675421,0.000047789905,0.000030579526,0.0021892784,0.91861326,0.0013352296,0.0028898208,0.023466546,0.00074817194],"about_ca_topic_score_codex":0.000037121594,"about_ca_topic_score_gemma":0.0000958033,"teacher_disagreement_score":0.91754025,"about_ca_system_score_codex":0.00006494963,"about_ca_system_score_gemma":0.000093395225,"threshold_uncertainty_score":0.9999886},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14980794,0.009944059,0.13999552,0.0037279483,0.0013024203,0.0017999,0.00001609008,0.00044424736,0.6929619],"genre_scores_gemma":[0.96609706,0.0005144065,0.024778439,0.00071497785,0.0001840808,0.00008742746,0.000023536006,0.000021214195,0.007578846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9966633,0.0005546093,0.0006368469,0.00090903486,0.00044809337,0.00078814244],"domain_scores_gemma":[0.9963758,0.00076810864,0.00042354636,0.0014827135,0.0005271787,0.00042267435],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073721213,0.00041796456,0.00048012732,0.00012793043,0.0013069384,0.0013567063,0.0015971609,0.00019141326,0.0018101181],"category_scores_gemma":[0.00038058648,0.0003758061,0.00013641387,0.00040195338,0.00070947676,0.0016889845,0.0030040662,0.0005583944,0.0010824973],"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.000011145778,0.0006410252,0.21987519,0.00008740411,0.00038370833,0.000023894663,0.01892367,0.00002842029,0.00015811928,0.6637672,0.027100073,0.06900011],"study_design_scores_gemma":[0.0021629152,0.00023104607,0.5352931,0.00046808049,0.00006738821,0.00016408743,0.0017169492,0.39238396,0.0004892134,0.0569175,0.008924588,0.001181203],"about_ca_topic_score_codex":0.0010087262,"about_ca_topic_score_gemma":0.00005093726,"teacher_disagreement_score":0.8162891,"about_ca_system_score_codex":0.00008674535,"about_ca_system_score_gemma":0.000118121716,"threshold_uncertainty_score":0.9999932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010703545,0.0006341168,0.94419664,0.005149498,0.010975741,0.001679241,0.0000122612055,0.0003985206,0.02625042],"genre_scores_gemma":[0.6671065,0.00007090089,0.32277158,0.0017799914,0.004371302,0.00026755332,0.0000029447667,0.000025811118,0.003603377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644935,0.00009624429,0.00052512676,0.0012433749,0.0004112506,0.001274628],"domain_scores_gemma":[0.99668515,0.0009545131,0.00019681595,0.0011840886,0.00037967556,0.00059974974],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009103618,0.00049354037,0.0006243012,0.00011163278,0.0005424087,0.0007706816,0.0019653728,0.0009522938,0.0016413052],"category_scores_gemma":[0.0012638747,0.00038529726,0.000479559,0.00054049894,0.00032485704,0.0005694373,0.00079873274,0.0011155488,0.0008038835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004726572,0.00033901748,0.00063134235,0.000045416673,0.000023308516,0.000016222726,0.0020366556,5.3407007e-8,0.0003292703,0.8715153,0.0010669938,0.12394919],"study_design_scores_gemma":[0.00337429,0.0015356671,0.011678195,0.00015601616,0.00009135445,0.00013064075,0.00011126534,0.09239547,0.0014480146,0.6991058,0.18821526,0.0017580533],"about_ca_topic_score_codex":0.000031673197,"about_ca_topic_score_gemma":0.0001064586,"teacher_disagreement_score":0.656403,"about_ca_system_score_codex":0.000037590322,"about_ca_system_score_gemma":0.0002146108,"threshold_uncertainty_score":0.99997413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8148413,0.000495821,0.04448417,0.0003582518,0.0033226272,0.0003849902,0.0000012576385,0.000107119544,0.13600446],"genre_scores_gemma":[0.9928751,0.00003878361,0.0017209353,0.0010198117,0.0003363356,0.000011940547,0.0000034299342,0.000015798765,0.003977847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9971769,0.00028007658,0.0005271683,0.0005938511,0.00037043728,0.0010515895],"domain_scores_gemma":[0.9982962,0.00041759087,0.00012850917,0.00071021746,0.000105267354,0.0003422405],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000948261,0.00034457017,0.0003709472,0.00027411303,0.00021201833,0.00027620574,0.00086283317,0.00022273704,0.0011388013],"category_scores_gemma":[0.00037443326,0.00030197977,0.00012809393,0.00063203624,0.00009626988,0.0011762527,0.00041901253,0.00027821105,0.0022754595],"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.00007820155,0.003068938,0.269249,0.000107725355,0.00007688881,0.00009327216,0.048992958,0.0001335553,0.0009862359,0.45090628,0.0060183876,0.22028856],"study_design_scores_gemma":[0.00395023,0.00083050306,0.56260127,0.0003181866,0.000043058288,0.000063641266,0.0003608525,0.41258654,0.0058313315,0.00812176,0.0036420915,0.0016505551],"about_ca_topic_score_codex":0.00012828206,"about_ca_topic_score_gemma":0.00011066589,"teacher_disagreement_score":0.44278452,"about_ca_system_score_codex":0.00017417573,"about_ca_system_score_gemma":0.00011832981,"threshold_uncertainty_score":0.99994326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03714791,0.0037669698,0.59000385,0.005135658,0.0020707105,0.0005894681,8.0766824e-7,0.00011546033,0.3611692],"genre_scores_gemma":[0.9942471,0.000057638972,0.0014667964,0.00080263126,0.0003306341,0.000020316043,0.0000016121593,0.000007268797,0.0030660147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763125,0.00042613744,0.00036764034,0.00052132003,0.0005251901,0.00052848103],"domain_scores_gemma":[0.99851525,0.00019465678,0.00011322229,0.0007877565,0.00021014283,0.00017897876],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018125675,0.0002330921,0.0002354291,0.00011001271,0.00013865308,0.0005299257,0.0014419657,0.00013715227,0.00009977865],"category_scores_gemma":[0.00035236092,0.00014466188,0.00009108184,0.00079730107,0.0001297822,0.00057695,0.00031962883,0.00025633254,0.0012558731],"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.000023121202,0.00088466174,0.0040823673,0.000032979806,0.000028337683,0.00015653315,0.14788324,0.0006286331,0.000030550873,0.37752232,0.0373469,0.43138033],"study_design_scores_gemma":[0.001813754,0.0008052216,0.016774535,0.00006525521,0.00003250021,0.0001493324,0.0047186203,0.9267527,0.00031700777,0.01625056,0.03164153,0.00067901995],"about_ca_topic_score_codex":0.0005823337,"about_ca_topic_score_gemma":0.0009472186,"teacher_disagreement_score":0.9570992,"about_ca_system_score_codex":0.00018769347,"about_ca_system_score_gemma":0.00051681587,"threshold_uncertainty_score":0.9995218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18580031,0.00036115616,0.7884815,0.00030919592,0.0003009284,0.0004687444,7.1638897e-7,0.00006811177,0.02420934],"genre_scores_gemma":[0.98354435,0.00007493389,0.015376347,0.000058184087,0.00008292846,0.000013996343,0.000006260633,0.000009735853,0.00083326077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820036,0.00016999115,0.00034328687,0.00056472595,0.0004407837,0.00028084853],"domain_scores_gemma":[0.9985989,0.000064189815,0.00033131466,0.00053315575,0.00031587543,0.00015659131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006051263,0.00020777498,0.00025201574,0.00009218568,0.0002548022,0.00020566884,0.00034041525,0.00012826585,0.000053013504],"category_scores_gemma":[0.00007976612,0.0001487206,0.00003868222,0.00037149547,0.00022041431,0.00048402458,0.00017072621,0.00010106034,0.000035447032],"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.000096799886,0.00063118146,0.009094381,0.00024409452,0.0000529974,0.0000023812265,0.010537853,0.000022618722,0.0033450092,0.26082128,0.000491295,0.7146601],"study_design_scores_gemma":[0.0020963708,0.0020378695,0.14383385,0.0003616275,0.00006615102,0.000022071596,0.000098986726,0.8215644,0.022949219,0.0038899533,0.0025872418,0.00049229246],"about_ca_topic_score_codex":0.000041612097,"about_ca_topic_score_gemma":0.00005261629,"teacher_disagreement_score":0.8215417,"about_ca_system_score_codex":0.00004061473,"about_ca_system_score_gemma":0.00011430266,"threshold_uncertainty_score":0.606465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020352306,0.002543135,0.9208845,0.00029255156,0.0003588002,0.00024688354,8.0741233e-7,0.00011165651,0.055209376],"genre_scores_gemma":[0.8280697,0.000071248185,0.16764462,0.00011202388,0.000018936116,0.000016610671,0.0000010472131,0.0000057916127,0.0040600575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881876,0.00004686331,0.00031030574,0.00041458276,0.00012857112,0.00028092146],"domain_scores_gemma":[0.9991892,0.00014508987,0.00006506958,0.00034499526,0.00016783849,0.00008782852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028126064,0.00017334022,0.0002520706,0.00012244812,0.00022213794,0.00007029366,0.0005355809,0.00010502873,0.000033483335],"category_scores_gemma":[0.00008784763,0.00013918614,0.0000620569,0.0005243784,0.000070139184,0.00022122022,0.00037839563,0.000112305825,0.000020998878],"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.000034868997,0.0025759453,0.11940751,0.00097301794,0.00029523537,0.000019629906,0.037374303,0.0011475956,0.0033381179,0.42377743,0.0037435656,0.40731278],"study_design_scores_gemma":[0.0033004754,0.00027440087,0.024149124,0.000251993,0.000043979548,0.0000054970637,0.0002911161,0.9273169,0.007437627,0.016337752,0.019983526,0.0006075851],"about_ca_topic_score_codex":0.0001385011,"about_ca_topic_score_gemma":0.00071931985,"teacher_disagreement_score":0.92616934,"about_ca_system_score_codex":0.0000428262,"about_ca_system_score_gemma":0.00011281921,"threshold_uncertainty_score":0.56758463},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.165218,0.011936075,0.06893792,0.0041189394,0.0072793663,0.0009422913,0.000009148616,0.00052126125,0.741037],"genre_scores_gemma":[0.97166795,0.00010953981,0.0026631881,0.0005447009,0.00016499127,0.000061419356,0.0000043279456,0.000027095008,0.024756819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995774,0.0006708448,0.0006617019,0.0011840373,0.0006702231,0.0010391922],"domain_scores_gemma":[0.9982121,0.00020000534,0.00024360976,0.0010363703,0.00007039442,0.00023752723],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018298008,0.00036918116,0.0004798879,0.00034831357,0.00089057465,0.00034779464,0.0023158935,0.00010720334,0.0037896065],"category_scores_gemma":[0.00017385517,0.0003870294,0.0002059298,0.0019222962,0.00009630805,0.0005064497,0.0031227136,0.0009622846,0.00044742716],"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.000052015206,0.00075300044,0.028883064,0.000069519265,0.00003594875,0.00053522433,0.016379328,0.0016346232,0.0002531269,0.7969472,0.0069208667,0.14753607],"study_design_scores_gemma":[0.0029667665,0.0011953787,0.020237323,0.00020716751,0.00003239039,0.0008252071,0.0033139838,0.85430753,0.00055566634,0.019837856,0.09463254,0.0018881581],"about_ca_topic_score_codex":0.00060740585,"about_ca_topic_score_gemma":0.00017938526,"teacher_disagreement_score":0.85267293,"about_ca_system_score_codex":0.0007178302,"about_ca_system_score_gemma":0.00042399578,"threshold_uncertainty_score":0.99985814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7076457,0.0051792725,0.19216624,0.0013728503,0.0068312963,0.0014243877,0.000016566208,0.0015407532,0.083822936],"genre_scores_gemma":[0.98130447,0.0009272314,0.0048217573,0.00034379118,0.00019346348,0.000022685752,0.000019367175,0.000057844525,0.012309404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99328613,0.00061331555,0.0012464257,0.0019288481,0.00073930103,0.0021860062],"domain_scores_gemma":[0.9970398,0.00039405708,0.0004433373,0.0014490712,0.00023511778,0.0004386469],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002380489,0.00077234756,0.0009225228,0.00089458586,0.0006282312,0.00074009766,0.0022834563,0.00046488646,0.0004555707],"category_scores_gemma":[0.00056238816,0.0007195097,0.00038363962,0.005189538,0.00031589667,0.0008291219,0.0017717748,0.0008057169,0.0022460977],"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.00015638804,0.0011095753,0.052476253,0.0010721526,0.00034051464,0.0041504344,0.030134372,0.20940574,0.005750887,0.47647122,0.0026144618,0.21631801],"study_design_scores_gemma":[0.0010035326,0.00012111265,0.022509152,0.0007338356,0.000030370447,0.00010666739,0.00064243004,0.9605137,0.00004307124,0.012808276,0.00059221796,0.00089563587],"about_ca_topic_score_codex":0.0014576926,"about_ca_topic_score_gemma":0.0015718542,"teacher_disagreement_score":0.75110793,"about_ca_system_score_codex":0.0011730243,"about_ca_system_score_gemma":0.0006880342,"threshold_uncertainty_score":0.9995256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010412474,0.001281915,0.7015614,0.00024456257,0.0014652227,0.0006365476,0.000022364766,0.00022888464,0.28414664],"genre_scores_gemma":[0.91018724,0.00005009159,0.056340046,0.0003624866,0.0001370345,0.000274455,0.00004416585,0.000029715819,0.032574758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955051,0.000869795,0.0005933504,0.0014500878,0.0008177243,0.0007639309],"domain_scores_gemma":[0.9977855,0.00018591773,0.0003784355,0.0012396298,0.00016234908,0.0002481568],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016585066,0.00041380414,0.0004336062,0.00025380924,0.0015639832,0.00048700834,0.0021389006,0.00008180018,0.0021433504],"category_scores_gemma":[0.000104580395,0.00040522992,0.00026187045,0.0017837756,0.00021341589,0.0007847033,0.0015030692,0.0006507766,0.00041026194],"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.00007193281,0.0010062525,0.00037841665,0.00004458866,0.00005692469,0.000022603203,0.014710175,0.0011019104,0.00040399883,0.9684701,0.0015958885,0.012137197],"study_design_scores_gemma":[0.0012605172,0.0011726554,0.0012082565,0.0000059700023,0.00003301004,0.00004538264,0.0058787167,0.94339305,0.0001615391,0.002925919,0.04325697,0.0006580116],"about_ca_topic_score_codex":0.00027363887,"about_ca_topic_score_gemma":0.000022682769,"teacher_disagreement_score":0.96554416,"about_ca_system_score_codex":0.00034286806,"about_ca_system_score_gemma":0.00029305322,"threshold_uncertainty_score":0.99983996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56034625,0.00007419779,0.4168729,0.0013008327,0.0005219045,0.00019534798,0.0000011186041,0.00004489197,0.020642584],"genre_scores_gemma":[0.9992574,0.000005282901,0.00017686932,0.00024280105,0.000010743349,0.0000029229843,7.7880276e-7,0.0000011927011,0.00030201068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935555,0.0000843356,0.00015058511,0.00016128254,0.00013376368,0.000114453214],"domain_scores_gemma":[0.99933785,0.00027378747,0.000048097158,0.00027524753,0.00004735714,0.00001767004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000229736,0.00007194374,0.00010658516,0.000044807246,0.00003087492,0.000034099954,0.00036588186,0.000039676477,0.0000470627],"category_scores_gemma":[0.00017644103,0.000041394153,0.000032248052,0.00026071718,0.000047861653,0.000057803158,0.00016167428,0.00009325418,0.000010018331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019788567,0.0000357766,0.0010662196,0.000008095197,0.000005747947,7.719613e-7,0.0011435637,0.000107731474,0.00014699575,0.9847281,0.0014120954,0.011342917],"study_design_scores_gemma":[0.0009561019,0.00021642218,0.20691696,0.000084448504,0.000021897338,0.000002788956,0.00033237922,0.35971272,0.067794226,0.36113125,0.002467188,0.0003636129],"about_ca_topic_score_codex":0.00009213439,"about_ca_topic_score_gemma":0.00030847423,"teacher_disagreement_score":0.62359685,"about_ca_system_score_codex":0.000036258232,"about_ca_system_score_gemma":0.0000626438,"threshold_uncertainty_score":0.16880046},"labels":[],"label_agreement":null},{"id":"W7125986258","doi":"10.1093/logcom/exaf073","title":"Advances in computational logic (CILC 2024)","year":2025,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Field (mathematics); Association (psychology); Computational logic; Mathematical logic; Computational model; Computational complexity theory","score_opus":0.015170227867167407,"score_gpt":0.2938185786288521,"score_spread":0.27864835076168465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125986258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008292584,0.0051361443,0.97025114,0.0013521205,0.00070374453,0.00006544107,2.8531758e-7,0.000017681188,0.01418085],"genre_scores_gemma":[0.95852494,0.0004008679,0.040369835,0.00048562116,0.000069611226,0.0000013090875,0.0000010334313,0.0000019089487,0.00014486765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903995,0.00009303615,0.0003901633,0.00015912406,0.00018390895,0.00013382173],"domain_scores_gemma":[0.9991814,0.00024387041,0.0002496186,0.00005745986,0.00022055725,0.000047119902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040373328,0.000099676996,0.00021438363,0.00027085617,0.00007717344,0.000096302894,0.00024825643,0.00005217686,0.0000060241423],"category_scores_gemma":[0.00007072924,0.0000764566,0.000054133132,0.00043269404,0.000046141246,0.0005371043,0.00007827811,0.00016897601,0.000004787782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037494003,0.00018315893,0.0076329745,0.000052998705,0.000019083787,0.00007037957,0.0005967567,0.08623711,0.000019399511,0.62153155,0.0014838947,0.28213522],"study_design_scores_gemma":[0.0008521219,0.00023151517,0.02841551,0.00008800161,0.000008157979,0.000088134606,0.000117331634,0.17639999,0.000008741177,0.79194444,0.0017376217,0.000108423825],"about_ca_topic_score_codex":0.0000022543468,"about_ca_topic_score_gemma":0.000005504376,"teacher_disagreement_score":0.9502324,"about_ca_system_score_codex":0.000051441275,"about_ca_system_score_gemma":0.000116901276,"threshold_uncertainty_score":0.311781},"labels":[],"label_agreement":null},{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62962306,0.0057221153,0.07127566,0.00018135074,0.00062254816,0.00032374778,0.000005639281,0.00017012958,0.29207575],"genre_scores_gemma":[0.95323807,0.0009581554,0.0050839297,0.00005347813,0.000034527806,0.000017635637,0.000081965925,0.00001995239,0.040512286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987416,0.000079454185,0.00023945059,0.0004873864,0.0002083056,0.00024377025],"domain_scores_gemma":[0.9988374,0.0000884424,0.00025832985,0.0005653236,0.00016270917,0.0000877932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014634803,0.00023523472,0.0006174532,0.00043588012,0.000085271706,0.00003075955,0.00055755215,0.00026694546,0.000088195746],"category_scores_gemma":[0.000053379586,0.00020627066,0.00019703741,0.0007516592,0.000117098825,0.00007769103,0.00008190353,0.00018262428,0.000016817652],"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.0000850291,0.00026364144,0.0017616729,0.0003534708,0.002442513,0.00005520353,0.14455459,0.0018220172,0.0016074855,0.83122694,0.0034906564,0.012336752],"study_design_scores_gemma":[0.0008330932,0.00032432517,0.00985068,0.00011113376,0.0028066982,0.00003262811,0.0027020418,0.9522883,0.0037916314,0.0238471,0.0020356718,0.0013766716],"about_ca_topic_score_codex":0.00016174342,"about_ca_topic_score_gemma":0.0004931903,"teacher_disagreement_score":0.95046633,"about_ca_system_score_codex":0.000023808165,"about_ca_system_score_gemma":0.00012305172,"threshold_uncertainty_score":0.84114736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85693467,0.000046209836,0.08832174,0.00024723425,0.0003254147,0.00033103148,0.000003750819,0.000007875523,0.053782098],"genre_scores_gemma":[0.98393285,0.000005348212,0.013477239,0.000026870837,0.000023221824,0.000009596925,0.000043073585,0.0000030699275,0.0024786987],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992929,0.00007088793,0.00015816357,0.00026150313,0.000089531764,0.00012702253],"domain_scores_gemma":[0.9994217,0.000016857428,0.000084410196,0.0002946722,0.00012787596,0.000054447228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012781964,0.000070370894,0.00014154949,0.000016302689,0.00003410416,0.00022890729,0.0006715313,0.000046446265,0.000610732],"category_scores_gemma":[0.00003261545,0.00005621512,0.000037565937,0.00024020513,0.00003167325,0.00023613953,0.0005425588,0.00005374194,0.00013209398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010392783,0.00035699355,0.0025297846,0.000007487694,0.000021716998,0.00004309449,0.0016486598,7.247655e-7,0.07526086,0.0074512092,0.00003336676,0.9126357],"study_design_scores_gemma":[0.0020518336,0.0010239795,0.05128277,0.00040549124,0.00004392605,0.00014107834,0.00022854937,0.035571873,0.67749065,0.0020964548,0.22880954,0.0008538374],"about_ca_topic_score_codex":0.0000041075946,"about_ca_topic_score_gemma":0.0000136153,"teacher_disagreement_score":0.91178185,"about_ca_system_score_codex":0.000014209494,"about_ca_system_score_gemma":0.000089909874,"threshold_uncertainty_score":0.6687087},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.1835714e-7,0.0007476968,0.10492439,0.00066401844,0.00044491957,0.00013102965,0.000001468852,0.00042294068,0.8926627],"genre_scores_gemma":[0.0005679647,0.00015817958,0.009711901,0.005851144,0.00046966088,0.0000032203543,0.000007720565,0.00001881494,0.9832114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982186,0.000017297993,0.00027890762,0.00075746444,0.0003548058,0.00037290037],"domain_scores_gemma":[0.99863845,0.0000893265,0.00013132991,0.0008398568,0.00009818607,0.00020285662],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015436101,0.00040010165,0.00043395712,0.00012049669,0.00009104884,0.00021507744,0.0014394035,0.00049083144,0.0017502722],"category_scores_gemma":[0.000023562021,0.0002849072,0.00026075382,0.000042152238,0.00007843365,0.00017147986,0.00037966442,0.0004304113,0.0023729696],"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.0000013533355,0.000016650032,0.0000015913814,0.0000036876916,0.000012683692,0.00008112578,0.00005481247,7.0105244e-7,0.0000017780794,0.8306656,0.122786336,0.046373714],"study_design_scores_gemma":[0.00012396222,0.00014220517,0.00004007956,0.000034485434,0.00000877626,0.000051980118,5.673972e-7,0.00030949063,0.000016976297,0.17406976,0.82482237,0.00037932175],"about_ca_topic_score_codex":0.0000058971045,"about_ca_topic_score_gemma":0.00002176979,"teacher_disagreement_score":0.7020361,"about_ca_system_score_codex":0.00005780444,"about_ca_system_score_gemma":0.000078006255,"threshold_uncertainty_score":0.9999603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067499685,0.001116641,0.9557794,0.00022057566,0.00077244604,0.0003296174,0.000008495035,0.00023712442,0.04146824],"genre_scores_gemma":[0.29841498,0.00030837144,0.6957738,0.0021290346,0.001109315,0.000026721253,0.000052218726,0.00009766846,0.002087921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571264,0.000042850865,0.00042081063,0.0020467776,0.00090306485,0.00087384775],"domain_scores_gemma":[0.9971967,0.00041786535,0.0002644931,0.0016797695,0.00020168164,0.00023953877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006059849,0.00069648004,0.0006293017,0.00071277877,0.00043351142,0.00090067234,0.0044152895,0.00030436995,0.0000910333],"category_scores_gemma":[0.00004854247,0.000519516,0.00010689472,0.00075910613,0.0010371152,0.0011832754,0.0012364065,0.00089617417,0.00020568773],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018596305,0.00005374732,0.00014556546,0.000027946186,0.00003760864,0.0004586422,0.0019492944,0.005975089,0.000046996844,0.15712498,0.000090262394,0.8340713],"study_design_scores_gemma":[0.0010401745,0.0010373536,0.0005251901,0.0013103811,0.0000473272,0.0009055633,7.6094676e-7,0.32176477,0.0031146903,0.6377976,0.029451024,0.0030051682],"about_ca_topic_score_codex":0.000020368798,"about_ca_topic_score_gemma":0.00015094357,"teacher_disagreement_score":0.8310661,"about_ca_system_score_codex":0.0002488041,"about_ca_system_score_gemma":0.0006476381,"threshold_uncertainty_score":0.99972564},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2508025,0.00013304096,0.10892031,0.0012510234,0.0014886578,0.00088508904,0.000014280984,0.00032758908,0.6361775],"genre_scores_gemma":[0.99669653,0.00004413211,0.0027381782,0.00005268096,0.000047399633,0.000012953047,2.0405493e-7,0.000007739333,0.00040016766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99856776,0.000021185231,0.00047250045,0.00035776326,0.00031214525,0.00026863805],"domain_scores_gemma":[0.9981966,0.00008229223,0.00043079775,0.00034759374,0.0008685304,0.00007415706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044340984,0.00018207192,0.00026904565,0.000120486526,0.00016474507,0.000080905,0.0018869274,0.000084669075,0.0001611816],"category_scores_gemma":[0.0005122379,0.00012525903,0.00013271057,0.000706284,0.00041601187,0.0003990417,0.00036389774,0.00021779924,0.00007536953],"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.000033388562,0.000135825,0.00066440157,0.00002929624,0.000014976901,2.3828431e-7,0.004016846,7.543534e-7,0.014977393,0.96632797,0.000072186616,0.013726738],"study_design_scores_gemma":[0.000014689882,0.0001792377,0.0009053757,0.00012370113,0.0000131959705,0.0000038799926,0.00051628076,0.0021781872,0.5479111,0.44793376,0.000087857064,0.00013270881],"about_ca_topic_score_codex":0.0000593413,"about_ca_topic_score_gemma":0.000012274507,"teacher_disagreement_score":0.7458941,"about_ca_system_score_codex":0.00002218405,"about_ca_system_score_gemma":0.00009645465,"threshold_uncertainty_score":0.5107915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008104444,0.0029183284,0.991088,0.00012596672,0.0006679016,0.0008569165,0.0000037578309,0.00021114342,0.004046955],"genre_scores_gemma":[0.40467775,0.000060693303,0.59417814,0.00016357315,0.00053343555,0.000036768142,0.0000031295438,0.00004181567,0.0003047106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963846,0.00003423976,0.00038256423,0.0014880956,0.00070263585,0.0010078708],"domain_scores_gemma":[0.9976891,0.000560543,0.00021543806,0.0008937176,0.00037930522,0.0002618685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014634972,0.0005362496,0.0005869141,0.00050735864,0.0004812747,0.0007557696,0.0019754749,0.00030800106,0.0000031453765],"category_scores_gemma":[0.00002416709,0.0003942669,0.00009103423,0.00036783877,0.0005310543,0.0006617958,0.0010034576,0.00060677767,0.00001498166],"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.000021375878,0.00005255175,0.00019255302,0.0010844516,0.00003953773,0.00005270818,0.0058907596,0.34374672,0.000096324846,0.32566762,0.000009882406,0.3231455],"study_design_scores_gemma":[0.00033295047,0.00027848984,0.000009512942,0.0008969058,0.000013928907,0.00020019292,8.185649e-7,0.95974463,0.0003120749,0.036979575,0.0006368107,0.00059413526],"about_ca_topic_score_codex":0.000025777372,"about_ca_topic_score_gemma":0.000037228387,"teacher_disagreement_score":0.61599785,"about_ca_system_score_codex":0.00027999526,"about_ca_system_score_gemma":0.0004236012,"threshold_uncertainty_score":0.9998509},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004260649,0.00014165665,0.57653177,0.0008699762,0.00025377312,0.000044655684,1.01385886e-7,0.00014388135,0.41775352],"genre_scores_gemma":[0.9640665,0.00001826941,0.0077089136,0.0009213608,0.00018828666,0.0000029901962,2.6650977e-7,0.0000031115958,0.02709027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994533,0.000017376058,0.000083395484,0.00013994331,0.0001096888,0.00019629207],"domain_scores_gemma":[0.9993887,0.00014023906,0.000021205124,0.00035541222,0.000041657757,0.000052764586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038911554,0.000055877455,0.000051115545,0.000029129927,0.00018544603,0.00011070335,0.0006265363,0.000026760405,0.0000961523],"category_scores_gemma":[0.000043326127,0.000029766645,0.000041558415,0.00020764358,0.00003494073,0.00016430156,0.00013736627,0.000070828624,0.0005541492],"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":[4.724683e-7,0.000027201073,0.0023739678,0.0000010326086,0.00000533072,0.0000035067276,0.0006000276,0.0000022258448,0.00006636405,0.9368448,0.01962361,0.040451434],"study_design_scores_gemma":[0.00031154626,0.00007116259,0.3284171,0.000011168654,0.000008155929,0.000046603345,0.00018338053,0.008111649,0.00428494,0.03129058,0.6269495,0.00031424096],"about_ca_topic_score_codex":0.00002282623,"about_ca_topic_score_gemma":0.00013211633,"teacher_disagreement_score":0.9598059,"about_ca_system_score_codex":0.000013343981,"about_ca_system_score_gemma":0.000020582724,"threshold_uncertainty_score":0.71226525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035444453,0.00042764205,0.7877414,0.00026795207,0.008114749,0.0024823446,0.000054318116,0.0014172619,0.16404986],"genre_scores_gemma":[0.90262365,0.00004298022,0.011917183,0.00019568643,0.0005277786,0.000030044057,0.00054065743,0.000087799795,0.08403424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731666,0.0001232036,0.00030513995,0.0011801284,0.00037220016,0.00070264447],"domain_scores_gemma":[0.9976374,0.00027960542,0.0003235569,0.00089376135,0.0005172677,0.0003483903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031321048,0.00053855684,0.000648131,0.0008974218,0.00069649157,0.00027906985,0.0021840418,0.0005285183,0.000029026563],"category_scores_gemma":[0.00014654172,0.00056443666,0.0003422209,0.0013501018,0.000030313393,0.0004706979,0.00024877838,0.0003167166,0.0003305511],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.00062351814,0.00038513396,0.01128463,0.0032030924,0.00047930994,0.0004996351,0.0014167848,0.00029698544,0.00002841789,0.8923939,0.07061788,0.018770749],"study_design_scores_gemma":[0.0027510414,0.0007399981,0.0013283847,0.001114046,0.00035640027,1.1884502e-7,0.024632609,0.006563768,0.00079657283,0.0025477484,0.9569224,0.0022469056],"about_ca_topic_score_codex":0.00014425021,"about_ca_topic_score_gemma":0.043194406,"teacher_disagreement_score":0.88984615,"about_ca_system_score_codex":0.0006022985,"about_ca_system_score_gemma":0.00022253595,"threshold_uncertainty_score":0.9996807},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001598744,0.0014495078,0.0013691994,0.00017694164,0.00029248348,0.00041467394,0.000004348007,0.00006405747,0.9960689],"genre_scores_gemma":[0.1713268,0.002262087,0.00065696496,0.00026171553,0.00019584772,0.000012836378,0.000014641339,0.000051279723,0.82521784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899274,0.000028428392,0.00021398123,0.0003571773,0.00021097252,0.00019667974],"domain_scores_gemma":[0.9971658,0.0017162366,0.00017369594,0.00082394003,0.000054256663,0.00006608653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039255767,0.00024451248,0.0003648049,0.00006238492,0.00017227876,0.0001148491,0.000676651,0.00014793566,0.00009392914],"category_scores_gemma":[0.00011036837,0.00012176457,0.00013438197,0.000028398721,0.00007042212,0.00011074265,0.00041838927,0.00021835312,0.00029753995],"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.000007744714,0.0000040384266,0.000049351424,0.0000622555,0.00003568262,0.0000021376277,0.00004120647,2.8292402e-7,0.0000041167254,0.9293446,0.004936496,0.06551211],"study_design_scores_gemma":[0.0005793353,0.0029865268,0.00029927742,0.0005172869,0.00010162163,0.000032811673,0.000004772985,0.0016972607,0.00093509565,0.07446729,0.91779166,0.00058704155],"about_ca_topic_score_codex":0.000009841721,"about_ca_topic_score_gemma":0.00001808256,"teacher_disagreement_score":0.9128552,"about_ca_system_score_codex":0.00002387674,"about_ca_system_score_gemma":0.000043105196,"threshold_uncertainty_score":0.4965415},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1367779,0.0036610775,0.08158392,0.22959721,0.0046625007,0.006675869,0.0000051497805,0.0018248387,0.53521156],"genre_scores_gemma":[0.99185395,0.00033620404,0.006076616,0.00093982165,0.00028066672,0.00021398059,0.0000063660946,0.000022701097,0.00026971163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753535,0.00014881756,0.00055930484,0.0007309679,0.0004022864,0.00062325626],"domain_scores_gemma":[0.99830747,0.0004802885,0.00017299221,0.00066538557,0.00018221933,0.00019163253],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058101496,0.0003223585,0.0002601444,0.00017074501,0.00073351886,0.0010215705,0.0011375947,0.00013399759,0.00017230053],"category_scores_gemma":[0.0002401983,0.00023699478,0.000080806,0.0007692377,0.0004556474,0.0014158378,0.00032272257,0.0003904061,0.0010962957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006941327,0.00006747337,0.0009152377,0.00001356844,0.000019219355,0.0000032482112,0.0015483283,0.000030289802,0.00038329535,0.7308966,0.00007902472,0.26603678],"study_design_scores_gemma":[0.00021654654,0.00015068451,0.0055507477,0.000050941668,0.000011069582,0.000029532746,0.00036590305,0.014162305,0.00031600567,0.96621066,0.012368325,0.00056725246],"about_ca_topic_score_codex":0.00013026502,"about_ca_topic_score_gemma":0.00017088585,"teacher_disagreement_score":0.855076,"about_ca_system_score_codex":0.0001251983,"about_ca_system_score_gemma":0.000114315364,"threshold_uncertainty_score":0.9996815},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7708454,0.00010805774,0.15043683,0.0035105427,0.0010090326,0.0014644958,0.0000029404541,0.0002264114,0.07239625],"genre_scores_gemma":[0.9952934,0.000018495934,0.0043801256,0.000058792517,0.00004637681,0.000039148217,3.7646365e-7,0.000007586539,0.00015574125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836063,0.000025627873,0.0005084986,0.00036394212,0.00046172715,0.0002795478],"domain_scores_gemma":[0.9978651,0.000115641626,0.00049834617,0.00028587165,0.0011572539,0.00007783349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004490914,0.00018815078,0.00025750836,0.00010192807,0.00016249536,0.00019385453,0.0016655745,0.00009182969,0.00009947547],"category_scores_gemma":[0.0005021795,0.00012074584,0.000114479335,0.0005373903,0.00033121827,0.00056246325,0.0003737085,0.00017669483,0.00012619136],"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.000016896403,0.00012549636,0.00034661498,0.000030374156,0.0000073939627,8.5186954e-8,0.002056761,0.0000060236634,0.07597376,0.8024847,0.000071790855,0.11888012],"study_design_scores_gemma":[0.000021797876,0.00018772812,0.0007677303,0.00014764938,0.000005905711,0.0000016550679,0.00033138428,0.039328344,0.6219651,0.3371025,0.000019572706,0.00012061236],"about_ca_topic_score_codex":0.000054665263,"about_ca_topic_score_gemma":0.0000074855157,"teacher_disagreement_score":0.54599136,"about_ca_system_score_codex":0.000028821798,"about_ca_system_score_gemma":0.000093070674,"threshold_uncertainty_score":0.49238724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054723457,0.0004393479,0.7305614,0.00223175,0.0005023425,0.00032454586,7.574624e-7,0.00057648675,0.25989106],"genre_scores_gemma":[0.83116883,0.0000016353797,0.16461104,0.0005652547,0.000107372914,0.00006577441,0.000004956676,0.000015908265,0.0034592205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980282,0.00006665577,0.0003866227,0.00079454423,0.00023962336,0.0004843384],"domain_scores_gemma":[0.99825233,0.00016017436,0.000103673025,0.0010585221,0.00011697648,0.00030830322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005505947,0.00025405546,0.00027642975,0.00019352959,0.00025414582,0.0001644483,0.00088797533,0.00008983423,0.000042870095],"category_scores_gemma":[0.0002690166,0.00020789851,0.00015394973,0.0006732583,0.000076915785,0.00031006994,0.00038283403,0.00013550861,0.00046331235],"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.00003770617,0.0011507958,0.0016617263,0.00013381784,0.000056210745,0.0010509731,0.0054585445,0.003748802,0.00032968973,0.94629014,0.0068701413,0.033211444],"study_design_scores_gemma":[0.012129412,0.0065554553,0.027207091,0.0016050957,0.0003210696,0.004747223,0.0032778347,0.35224026,0.16315913,0.10254975,0.3172065,0.009001149],"about_ca_topic_score_codex":0.00006648875,"about_ca_topic_score_gemma":0.00007733369,"teacher_disagreement_score":0.8437404,"about_ca_system_score_codex":0.0001240354,"about_ca_system_score_gemma":0.0006330898,"threshold_uncertainty_score":0.84778553},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22772159,0.005632367,0.29770902,0.1403587,0.0063851485,0.00307731,0.000028026916,0.003781445,0.3153064],"genre_scores_gemma":[0.9848282,0.0002250256,0.013297086,0.0005602468,0.00035276168,0.00018951675,0.000012092648,0.00003877967,0.0004963285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99662215,0.00019994414,0.00048759254,0.001004807,0.0008557485,0.00082978135],"domain_scores_gemma":[0.9976188,0.0001068168,0.00030321,0.00088994054,0.0006088208,0.00047240074],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003971658,0.0005013847,0.0004601878,0.00031467178,0.0008391054,0.001129378,0.0013537941,0.000320155,0.000015998767],"category_scores_gemma":[0.00017603698,0.0003814608,0.00017987193,0.0010166474,0.000043696637,0.002801275,0.0004285379,0.00053799973,0.000054578115],"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.0000886063,0.00038992337,0.00021283912,0.000051438517,0.0001134033,0.00014329194,0.012767613,0.00018427745,0.00078547397,0.9825107,0.00020497262,0.0025474664],"study_design_scores_gemma":[0.0047423653,0.0006113202,0.007214611,0.0009803469,0.00010468528,0.0037264423,0.0026289523,0.0022935197,0.02835027,0.010831055,0.9366155,0.0019008818],"about_ca_topic_score_codex":0.0000034024533,"about_ca_topic_score_gemma":0.0002714486,"teacher_disagreement_score":0.9716796,"about_ca_system_score_codex":0.00066404295,"about_ca_system_score_gemma":0.0009337623,"threshold_uncertainty_score":0.99990755},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109101124,0.0010702353,0.034065995,0.07514847,0.005588744,0.0019464662,0.000011153486,0.0012153294,0.7718525],"genre_scores_gemma":[0.94927335,0.00039631999,0.005318775,0.0044729877,0.024648348,0.000051703482,0.000006410074,0.000031740805,0.01580038],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964825,0.00043991028,0.00020446807,0.00057291414,0.0012716741,0.001028565],"domain_scores_gemma":[0.99777746,0.0005918115,0.000048020385,0.0010568147,0.0003117967,0.0002141056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040014246,0.00019829678,0.0002060759,0.000055031214,0.0012029755,0.0005341142,0.0023368844,0.00013136989,0.000091096306],"category_scores_gemma":[0.0004136216,0.00012750873,0.00028597325,0.0011642098,0.000265371,0.0003560763,0.00033185753,0.0012772176,0.00061694585],"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.000029992074,0.00011846501,0.00007596798,0.0000075889284,0.000026004776,0.000026262085,0.010619166,0.00009589829,0.00025975032,0.34328616,0.58722067,0.058234077],"study_design_scores_gemma":[0.0020580166,0.0021133188,0.016928146,0.00019950826,0.000016145757,0.000059755825,0.0018876609,0.09201664,0.0053198184,0.14903504,0.7293212,0.0010447775],"about_ca_topic_score_codex":0.0000399484,"about_ca_topic_score_gemma":0.0000092480395,"teacher_disagreement_score":0.84017223,"about_ca_system_score_codex":0.00026909908,"about_ca_system_score_gemma":0.00029676454,"threshold_uncertainty_score":0.9252437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038705903,0.00076645135,0.9865424,0.00037249882,0.001989986,0.0003683674,0.0000018268017,0.00014909141,0.0094223125],"genre_scores_gemma":[0.8812144,0.00013878231,0.11485754,0.002309293,0.001020026,0.000010672945,0.000007859905,0.00003571625,0.0004057137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969451,0.00014373264,0.00043620076,0.0012465798,0.00063404127,0.00059433706],"domain_scores_gemma":[0.9971899,0.00089922413,0.00022525009,0.0013005484,0.0001884756,0.0001966027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016590505,0.00043550483,0.00042033687,0.00085796433,0.00032903897,0.0005182828,0.0014468088,0.00035517305,0.00007284839],"category_scores_gemma":[0.00022635673,0.00036808083,0.00009299988,0.00042095612,0.00039254842,0.0011261746,0.00056986173,0.0008882456,0.0001340321],"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.0000054916577,0.00007111608,0.00007418801,0.000014441025,0.0000026037694,0.00002899213,0.0013710904,0.0029029914,0.00009169902,0.3938438,0.000022697326,0.6015709],"study_design_scores_gemma":[0.0004142977,0.0005331542,0.0012258482,0.0006562744,0.000009577053,0.000103240796,7.1125163e-7,0.108257085,0.0015823534,0.8832673,0.0029750688,0.0009751046],"about_ca_topic_score_codex":0.000009638905,"about_ca_topic_score_gemma":0.00019384029,"teacher_disagreement_score":0.8808273,"about_ca_system_score_codex":0.00034154486,"about_ca_system_score_gemma":0.00037590298,"threshold_uncertainty_score":0.9998771},"labels":[],"label_agreement":null}]}