{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":18,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":18,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"3f7fc1108130","filters":{"venue":"Principles of Knowledge Representation and Reasoning"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0617395922315109,"gpt":0.2860782928732976,"spread":0.2243387006417867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006995244,0.000229174,0.0003089008,0.0002184373,0.0003960257,0.0001965566,0.0002852603,0.000170878,0.00001900529],"category_scores_gemma":[0.0007332826,0.0002015936,0.00008462057,0.0003648082,0.0002276831,0.0007444422,0.0003541344,0.0003602032,0.00002221518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002254965,"about_ca_system_score_gemma":0.0001031701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006839215,"about_ca_topic_score_gemma":0.0002549356,"domain_scores_codex":[0.9983068,0.0001384784,0.0004086643,0.0006485335,0.000207202,0.0002903626],"domain_scores_gemma":[0.9983209,0.0004061357,0.0002810725,0.0005192507,0.0002417162,0.00023096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001128633,0.000827063,0.1759011,0.0003686775,0.0002403275,0.00001938432,0.01630578,0.0001288159,0.01839177,0.4722044,0.0007180878,0.3147817],"study_design_scores_gemma":[0.005406423,0.0005311528,0.4446308,0.0004209193,0.0002581368,0.0008695327,0.004083101,0.4540498,0.02969511,0.004262291,0.05415134,0.001641435],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8328361,0.004496629,0.09323297,0.0005166858,0.001672186,0.0007110022,0.00001153072,0.0003964721,0.06612641],"genre_scores_gemma":[0.9852056,0.0003150729,0.01216087,0.00001779063,0.0002272283,0.00004488241,0.00001979542,0.00001736745,0.001991392],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4679421,"threshold_uncertainty_score":0.8220747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2237543400","doi":"","title":"Declarative entity resolution via matching dependencies and answer set programs","year":2012,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Computer science; Expressive power; Matching (statistics); Programming language; Set (abstract data type); Theoretical computer science; Invariant (physics); Semantics (computer science); Task (project management); Class (philosophy); Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2393407786433807,"gpt":0.4310733909013771,"spread":0.1917326122579964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003496238,0.0001175199,0.0002273589,0.000169006,0.0002569665,0.000182748,0.0001936181,0.00005861661,0.00003318459],"category_scores_gemma":[0.001229875,0.00009226274,0.00005092088,0.0003349496,0.00018805,0.001115246,0.0005014954,0.00009788104,0.00002476467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002337543,"about_ca_system_score_gemma":0.0000218385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001696521,"about_ca_topic_score_gemma":0.0003416099,"domain_scores_codex":[0.9980547,0.0003818805,0.000479934,0.0003398931,0.0005124251,0.0002311494],"domain_scores_gemma":[0.9985829,0.0004676614,0.0002945195,0.0003036679,0.0002083817,0.0001428949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00008679571,0.0003127354,0.5895694,0.0001332961,0.0001014942,0.000002377389,0.04586019,0.00007036058,0.001011837,0.1112329,0.0004368708,0.2511817],"study_design_scores_gemma":[0.00106329,0.0001159779,0.8704777,0.0002583844,0.0001092827,0.0000573961,0.04138107,0.01415121,0.003386736,0.01427217,0.05422809,0.0004987387],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9245435,0.00239615,0.060024,0.0001483826,0.0003136909,0.000350961,0.00001130915,0.00004221923,0.01216979],"genre_scores_gemma":[0.9923027,0.000151262,0.006188016,0.00001435343,0.00007068693,0.00001608686,0.00002709803,0.000006261861,0.001223493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2809082,"threshold_uncertainty_score":0.3762366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2510506392","doi":"","title":"On referring expressions in query answering over first order knowledge bases","year":2016,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Conjunctive query; Context (archaeology); Noun phrase; Knowledge base; Description logic; Expression (computer science); Class (philosophy); Natural language processing; Artificial intelligence; Information retrieval; Relational database; Programming language; Noun","retraction":null,"screen_n_in":null,"score":{"opus":0.03158008085999161,"gpt":0.3247805165416627,"spread":0.2932004356816711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003358494,0.000164647,0.0002207691,0.0003369082,0.0001323025,0.0000583173,0.000396829,0.00008504291,0.00001601695],"category_scores_gemma":[0.001201526,0.0001142046,0.00004596525,0.000492789,0.00007305204,0.0005980359,0.0005078751,0.0001345985,0.000006300502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007556493,"about_ca_system_score_gemma":0.00007185231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005741134,"about_ca_topic_score_gemma":0.0001850655,"domain_scores_codex":[0.998696,0.00009841989,0.0003399961,0.0004703609,0.0001580954,0.0002371761],"domain_scores_gemma":[0.9984792,0.0007096282,0.0001587984,0.0004238608,0.0001412511,0.00008726599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001278903,0.0006756214,0.111483,0.0005832538,0.00005542896,0.00005800789,0.01269689,0.0001712349,0.09128206,0.4631997,0.0003996062,0.3192673],"study_design_scores_gemma":[0.00619386,0.0004370275,0.1682751,0.0307668,0.00004748943,0.0001284647,0.0007145567,0.1253359,0.6285196,0.02279933,0.0143444,0.002437413],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6095845,0.01052371,0.3535675,0.0006223749,0.000494833,0.0005276041,0.000005137616,0.0007561878,0.02391813],"genre_scores_gemma":[0.9385347,0.000209142,0.06044053,0.00001372852,0.00003976444,0.00003063936,0.00000114214,0.00001517475,0.000715112],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5372375,"threshold_uncertainty_score":0.4657129,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04830289136334191,"gpt":0.3164103196092453,"spread":0.2681074282459033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007217005,0.0001229284,0.0002201164,0.000209364,0.0001130422,0.00006508738,0.0002854365,0.00007153221,0.000004556852],"category_scores_gemma":[0.000815435,0.0001116515,0.00005730782,0.0004128315,0.00005497779,0.0004317807,0.0002654862,0.0001250801,0.00001206966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003489359,"about_ca_system_score_gemma":0.00004381849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004881895,"about_ca_topic_score_gemma":0.0001274076,"domain_scores_codex":[0.9987689,0.0001651964,0.0003314091,0.0003735645,0.000137141,0.0002237597],"domain_scores_gemma":[0.9989884,0.0003070748,0.00019018,0.0003127042,0.000116302,0.0000853171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000130974,0.0001260234,0.1881785,0.0001344952,0.00001665619,0.00000254648,0.005967409,0.0002534242,0.00303405,0.5065947,0.00003531679,0.2956438],"study_design_scores_gemma":[0.001400966,0.0001032117,0.3271306,0.0003388067,0.00001350728,0.00004702549,0.0005241512,0.6342136,0.02134585,0.004347526,0.01014775,0.0003870768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6180753,0.001050664,0.2285582,0.000180155,0.0005514495,0.0002510625,3.400369e-7,0.0001730656,0.1511598],"genre_scores_gemma":[0.985626,0.00009649772,0.0132633,0.00001155343,0.0000910801,0.00001326947,0.000002263676,0.000008449538,0.0008875254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6339601,"threshold_uncertainty_score":0.4553016,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02266828649504329,"gpt":0.2750889418451013,"spread":0.252420655350058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001078072,0.0001584169,0.0003231821,0.0001658705,0.0001490057,0.00004930037,0.0005407464,0.00009134592,0.000005717136],"category_scores_gemma":[0.001297708,0.0001184502,0.000106322,0.0006670461,0.000124335,0.0002775997,0.0004981249,0.0001517633,0.000005191147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007423909,"about_ca_system_score_gemma":0.0001202298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001871071,"about_ca_topic_score_gemma":0.0002864882,"domain_scores_codex":[0.998187,0.0003315495,0.0005451983,0.0004114956,0.000274683,0.0002500949],"domain_scores_gemma":[0.9983172,0.0003990108,0.0004244931,0.0005574169,0.0002190142,0.00008287614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003001346,0.0002687673,0.3163932,0.0002552311,0.00004160675,0.000002018042,0.01482352,0.002213815,0.005893026,0.5963907,0.00004483272,0.06364334],"study_design_scores_gemma":[0.001476726,0.00009241149,0.3902342,0.001006042,0.00002832464,0.00003380888,0.0005263457,0.5708472,0.03121489,0.003052418,0.001192183,0.0002954141],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7901573,0.001885141,0.1495016,0.0002480009,0.0004715328,0.0004935083,0.000001039243,0.00006721411,0.05717473],"genre_scores_gemma":[0.9916918,0.00008722393,0.007470682,0.00001199114,0.00004730172,0.00002553672,0.000002102285,0.000009929586,0.0006533876],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5933383,"threshold_uncertainty_score":0.4830259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2579435387","doi":"","title":"Knowledge compilation for lifted probabilistic inference: compiling to a low-level language","year":2016,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Inference; Probabilistic logic; Speedup; Compiler; Relational database; Programming language; Theoretical computer science; Data structure; Artificial intelligence; Data mining; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.09358399773436435,"gpt":0.3677652128852419,"spread":0.2741812151508776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004536254,0.0001589365,0.0002568807,0.000180743,0.0001474387,0.00007936159,0.0003478709,0.00007148377,0.000004826745],"category_scores_gemma":[0.001200012,0.0001200836,0.00006438004,0.0003470365,0.00006985415,0.0002835833,0.0002712158,0.00006466916,0.0000186927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004714776,"about_ca_system_score_gemma":0.0001486285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001441234,"about_ca_topic_score_gemma":0.00004637966,"domain_scores_codex":[0.99865,0.00009440601,0.0004075606,0.0004666804,0.0001371262,0.0002442207],"domain_scores_gemma":[0.9980513,0.0008006288,0.0001607036,0.0003577975,0.0004646598,0.0001649037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009371111,0.0003181326,0.01223933,0.0004864029,0.00006203948,0.000002061676,0.02164089,0.001230699,0.04016443,0.3704065,0.0001018774,0.5532539],"study_design_scores_gemma":[0.002141543,0.0002721802,0.03866817,0.002364087,0.0000397336,0.00001643831,0.0004992954,0.9147803,0.03257636,0.007144707,0.0008324613,0.0006647233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1679486,0.0003232608,0.8285972,0.0002161984,0.0001698885,0.0004068449,0.00001786325,0.0001133688,0.002206748],"genre_scores_gemma":[0.9394915,0.00002296135,0.0597099,0.00001535242,0.00006884825,0.00006784987,0.000009489695,0.00001190701,0.0006021741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9135496,"threshold_uncertainty_score":0.4896868,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04961093887796212,"gpt":0.2983021263901871,"spread":0.248691187512225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007042776,0.0001984252,0.0003799968,0.0001652895,0.0002071049,0.0001603959,0.000503182,0.0001000157,0.000006488393],"category_scores_gemma":[0.0006429501,0.0001667981,0.0001070047,0.0003193852,0.0001078524,0.0003559487,0.000382627,0.0001187487,0.00004020049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003204281,"about_ca_system_score_gemma":0.00006440596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001406526,"about_ca_topic_score_gemma":0.00006042826,"domain_scores_codex":[0.9982334,0.0003078057,0.0004518187,0.0005218054,0.0001975457,0.0002876426],"domain_scores_gemma":[0.9983997,0.0002890865,0.0002903714,0.0005455626,0.000294501,0.0001808208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001447033,0.0001739225,0.0321738,0.0001666697,0.00006304255,0.000003419305,0.005680033,0.0004022785,0.001609187,0.8925655,0.0001645049,0.06698315],"study_design_scores_gemma":[0.002053438,0.00008537322,0.02730564,0.0002355978,0.00002773461,0.00006505466,0.000426234,0.9381869,0.004988458,0.000358212,0.02587865,0.0003886684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1999248,0.009774039,0.7222134,0.0001239768,0.001550921,0.0005150527,0.000002079072,0.0003732436,0.0655225],"genre_scores_gemma":[0.9770532,0.0001826471,0.01878003,0.0000186223,0.0001569809,0.00003123143,0.000005230614,0.00001550905,0.003756554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9377847,"threshold_uncertainty_score":0.6801829,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04601614073732518,"gpt":0.3090084260364157,"spread":0.2629922852990905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000829387,0.0002532923,0.0003784393,0.0002138965,0.0002794224,0.0001055591,0.000565721,0.0001331596,0.00002028431],"category_scores_gemma":[0.000503139,0.0002183381,0.0001518496,0.000476562,0.000131611,0.0009695826,0.000699671,0.0001964556,0.00007247536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006908526,"about_ca_system_score_gemma":0.0001361594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003535939,"about_ca_topic_score_gemma":0.00002319304,"domain_scores_codex":[0.9980051,0.0001994161,0.0004662436,0.0005018892,0.0002666084,0.0005607603],"domain_scores_gemma":[0.9983257,0.0003278011,0.0002786751,0.0005604677,0.0002031268,0.0003041983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002058057,0.0004010746,0.168606,0.0001373321,0.00009293261,0.000006984911,0.01186771,0.000123663,0.002304955,0.7300126,0.0001403743,0.08628585],"study_design_scores_gemma":[0.004017711,0.000370304,0.6010883,0.0008259196,0.0001954528,0.0007317961,0.00163959,0.2773061,0.04334448,0.004305105,0.06405449,0.002120725],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4564878,0.02486327,0.1652924,0.0004453227,0.002062952,0.0007641483,0.000003381105,0.0005527504,0.349528],"genre_scores_gemma":[0.9731888,0.0003362329,0.02413726,0.00002538151,0.0002525312,0.00002272791,0.000005692284,0.00001880356,0.002012632],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7257075,"threshold_uncertainty_score":0.8903569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2222911679","doi":"","title":"Diagnostic problem solving via planning with ontic and epistemic goals","year":2014,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Ontic; Planner; Computer science; Artificial intelligence; Medical diagnosis; Automated planning and scheduling; Machine learning; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.01924517497698003,"gpt":0.2657287045236372,"spread":0.2464835295466571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000694175,0.0001751225,0.0002767655,0.0001460722,0.000267389,0.000137877,0.0002312664,0.0000639832,0.00000192368],"category_scores_gemma":[0.0005208781,0.0001466092,0.00003014874,0.0002449437,0.0001006052,0.0003630075,0.0002292209,0.0001572696,0.000003400224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001905107,"about_ca_system_score_gemma":0.00005316891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006268478,"about_ca_topic_score_gemma":0.0000169248,"domain_scores_codex":[0.9986091,0.0001671428,0.0003289034,0.0004547064,0.0001757141,0.0002644877],"domain_scores_gemma":[0.9976185,0.001562949,0.000263859,0.0002935565,0.0001222523,0.0001388966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003199153,0.000067973,0.8643262,0.0006965551,0.00008001098,0.00001946084,0.01551241,0.006220216,0.00172808,0.03282939,0.00004442585,0.07844327],"study_design_scores_gemma":[0.001584833,0.0003850589,0.2166345,0.004546132,0.00007887863,0.0003523433,0.0004907176,0.7678666,0.003737996,0.002673707,0.000978675,0.0006705258],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3572867,0.003229866,0.6297628,0.0002424668,0.00009114415,0.0002673563,7.364465e-7,0.0001553626,0.008963568],"genre_scores_gemma":[0.928319,0.00004976737,0.07129596,0.00001580874,0.0000464171,0.00001574601,0.0000044922,0.00001407787,0.0002387616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7616464,"threshold_uncertainty_score":0.5978551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2200473356","doi":"","title":"Assertion absorption in object queries over knowledge bases","year":2012,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Assertion; Computer science; Knowledge base; Object (grammar); Information retrieval; Knowledge-based systems; Base (topology); Knowledge extraction; Absorption (acoustics); Theoretical computer science; Artificial intelligence; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04915225042878439,"gpt":0.331647011578306,"spread":0.2824947611495215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005330727,0.0001215221,0.0002058687,0.0002177814,0.00008022395,0.00005110748,0.000187882,0.00007100055,0.00001249961],"category_scores_gemma":[0.0004700148,0.0001074099,0.00005216003,0.0003634959,0.0000712134,0.0009218651,0.0002192991,0.00008698923,0.00001680654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004215384,"about_ca_system_score_gemma":0.00005483675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001298563,"about_ca_topic_score_gemma":0.0002336512,"domain_scores_codex":[0.9989246,0.0001510406,0.0003113814,0.0002479084,0.0001224942,0.0002426377],"domain_scores_gemma":[0.999142,0.0002965783,0.0001418541,0.0002579298,0.00008882624,0.00007284177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00001993877,0.0002420422,0.8261252,0.0001148754,0.0000181057,0.000001645431,0.01126658,0.00004393967,0.003148504,0.1099723,0.00005165935,0.04899524],"study_design_scores_gemma":[0.000429399,0.0000303812,0.9552124,0.0001799417,0.000009453555,0.00001755847,0.000893899,0.02632985,0.01457353,0.0002498044,0.001910976,0.0001628126],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9540674,0.00481873,0.02176388,0.00007157997,0.0004704272,0.0001665183,5.521628e-7,0.0001056085,0.01853531],"genre_scores_gemma":[0.9927381,0.0002646124,0.006494943,0.000008069235,0.00007817792,0.0000182712,0.000004696153,0.000006744144,0.0003863383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1290872,"threshold_uncertainty_score":0.4380049,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.151396291895283,"gpt":0.3716772708593377,"spread":0.2202809789640546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350075,0.0001545499,0.0002292649,0.0001544519,0.0002753463,0.0001303158,0.0004573471,0.00008518737,0.00001025473],"category_scores_gemma":[0.0007763391,0.0001132424,0.00007328328,0.0005972302,0.0001405692,0.0005198037,0.000225746,0.000109302,0.000009775244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005109013,"about_ca_system_score_gemma":0.00006966648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009980395,"about_ca_topic_score_gemma":0.0005769568,"domain_scores_codex":[0.9984398,0.0002204259,0.0003992664,0.0004782311,0.0001912693,0.0002709652],"domain_scores_gemma":[0.9983965,0.0005023072,0.0002142542,0.0004290466,0.0003938397,0.00006405071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001095191,0.000571645,0.1420985,0.0003187926,0.00006102685,0.000007713016,0.1958857,0.00002985755,0.003402461,0.4447526,0.0001601831,0.212602],"study_design_scores_gemma":[0.00156014,0.0002418746,0.6520026,0.0002732978,0.00002304993,0.00003074004,0.001014339,0.3298233,0.008624963,0.002074356,0.004003993,0.0003273629],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7236958,0.001819519,0.2465726,0.0005768719,0.0007192331,0.001608949,0.000009077427,0.0001303568,0.02486764],"genre_scores_gemma":[0.9914196,0.00004233706,0.007839959,0.00005321992,0.0003322702,0.00009627815,0.00001033145,0.00000875512,0.0001973206],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5099041,"threshold_uncertainty_score":0.4617892,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03987223338670914,"gpt":0.302820400739416,"spread":0.2629481673527069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499848,0.0001779116,0.0002735266,0.0002457594,0.0001198595,0.00009225565,0.0003290647,0.00009753228,0.000007775813],"category_scores_gemma":[0.001373366,0.0001245953,0.00006416199,0.0005553063,0.0001380654,0.0006944631,0.0002555967,0.00009466624,0.0000180047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009643052,"about_ca_system_score_gemma":0.0001153607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004581595,"about_ca_topic_score_gemma":0.000176364,"domain_scores_codex":[0.9982692,0.0001988039,0.0004848478,0.0005419118,0.0002094955,0.0002957308],"domain_scores_gemma":[0.9985977,0.0003635811,0.000300006,0.0003702821,0.000259038,0.0001093269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002955994,0.0002010439,0.2395868,0.0001389054,0.00001926483,0.000005269731,0.00442449,0.0001016846,0.002996374,0.4145063,0.00001038535,0.33798],"study_design_scores_gemma":[0.005923935,0.0004779419,0.6994034,0.002441612,0.00006413769,0.0001435633,0.0008227688,0.2229687,0.02021653,0.04131543,0.004968578,0.001253372],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5567088,0.001544326,0.4084175,0.0006675062,0.0005355341,0.001153895,0.000001503311,0.0003420934,0.03062885],"genre_scores_gemma":[0.9755399,0.0001132128,0.02335888,0.000008340824,0.00007024463,0.00006622646,0.000003490937,0.00001176751,0.0008279991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4598166,"threshold_uncertainty_score":0.5080847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1510506302","doi":"","title":"Ontologies for dates and duration","year":2010,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Duration (music); Timeline; Computer science; Ontology; Metric (unit); Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04243871134609954,"gpt":0.3232519904105558,"spread":0.2808132790644562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002435095,0.0000689283,0.0001265482,0.00006415972,0.0001124638,0.00007246406,0.0001552502,0.0000499016,0.000001621437],"category_scores_gemma":[0.0009053343,0.00005600257,0.00002388869,0.00007630946,0.00009863896,0.0002977843,0.0001578608,0.00005456959,9.82246e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002846924,"about_ca_system_score_gemma":0.00002687852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002462854,"about_ca_topic_score_gemma":0.0001661631,"domain_scores_codex":[0.9994169,0.00002218031,0.0001789602,0.0002233752,0.00005610285,0.000102413],"domain_scores_gemma":[0.9991655,0.0003924901,0.0001073638,0.0001895029,0.0001093182,0.0000358365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001919204,0.00004729103,0.1292953,0.0001241465,0.00002797169,0.000001189003,0.003732031,0.000008789129,0.02562044,0.6321346,0.00005583691,0.2089332],"study_design_scores_gemma":[0.001184519,0.0001338386,0.6379155,0.00009735571,0.00003201269,0.00009042659,0.001360934,0.2364114,0.105491,0.01016066,0.006798589,0.0003236991],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.872838,0.000922657,0.1195192,0.0005663625,0.0003960265,0.0002377843,9.638431e-7,0.0001097863,0.005409244],"genre_scores_gemma":[0.9043964,0.0001112837,0.09523402,0.00000668211,0.00003418979,0.00001671341,0.000002800209,0.000002947613,0.0001949487],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.621974,"threshold_uncertainty_score":0.2283718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2571905942","doi":"","title":"Infinite paths in the situation calculus: axiomatization and properties","year":2016,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Correctness; sort; Situation calculus; Formalism (music); Computer science; Calculus (dental); Futures contract; Natural deduction; Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.06647694693038328,"gpt":0.3155171339005637,"spread":0.2490401869701805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576464,0.00006853403,0.00009144221,0.0001182014,0.00008215602,0.00005639593,0.0001797549,0.00003698149,0.000001016639],"category_scores_gemma":[0.0009221471,0.00003852619,0.00001479686,0.0002925032,0.00008542586,0.0006006441,0.0001156883,0.00003815553,0.000001990117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001827433,"about_ca_system_score_gemma":0.00002745665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001856616,"about_ca_topic_score_gemma":0.00002003526,"domain_scores_codex":[0.9990674,0.0002597233,0.0002512135,0.0001926809,0.0001375724,0.00009141023],"domain_scores_gemma":[0.9993029,0.0002020685,0.0001431803,0.0002237279,0.0001038162,0.00002427545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002093199,0.00007772337,0.05208357,0.0001290205,0.0000117542,0.000001118226,0.0396607,0.0000648483,0.03048227,0.456838,0.000009001757,0.4206211],"study_design_scores_gemma":[0.0008849167,0.0000795777,0.5593628,0.0006138269,0.00001177054,0.00004117208,0.001490855,0.3988907,0.03566744,0.001826468,0.0009105248,0.0002199515],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.56531,0.0005585068,0.4309347,0.0004548125,0.00008104699,0.000250367,4.838744e-7,0.00003449044,0.002375621],"genre_scores_gemma":[0.9646941,0.0002470858,0.03491967,0.00001154031,0.00001810401,0.0000280547,9.773065e-7,0.000003586224,0.00007686436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5072792,"threshold_uncertainty_score":0.1571052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2572760676","doi":"","title":"Using metric temporal logic to specify scheduling problems","year":2016,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Temporal logic; Computer science; Linear temporal logic; Formalism (music); Theoretical computer science; Scheduling (production processes); Programming language; Artificial intelligence; Mathematics; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.09561138242305982,"gpt":0.3375175428627435,"spread":0.2419061604396837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003204586,0.0001049598,0.000161823,0.0003526912,0.0001165165,0.00006610945,0.0001793192,0.00004701519,0.00002487105],"category_scores_gemma":[0.0004384905,0.00007772754,0.00004679409,0.0007277371,0.00004883673,0.0004058182,0.0002193768,0.0000483544,0.00001426282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005387302,"about_ca_system_score_gemma":0.00007230935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002347078,"about_ca_topic_score_gemma":0.00002160381,"domain_scores_codex":[0.9989511,0.00007445231,0.0003124624,0.0003389249,0.000161253,0.0001617416],"domain_scores_gemma":[0.9991249,0.0001492156,0.0001690092,0.0002332881,0.0001988271,0.0001247506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002282562,0.0001163546,0.2865129,0.0001010593,0.00006225101,0.000005798284,0.002984076,0.0230447,0.02877185,0.2168654,0.00001950091,0.4414932],"study_design_scores_gemma":[0.002031029,0.0001528104,0.1509089,0.001046093,0.00003724711,0.0001370611,0.0004728599,0.8143439,0.02482707,0.002075732,0.00323416,0.000733201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06953426,0.000267612,0.9248355,0.0003645487,0.0002037376,0.000203564,9.678016e-7,0.00008206077,0.004507767],"genre_scores_gemma":[0.7399362,0.00005949677,0.2596743,0.00001320521,0.00003784949,0.000004973992,7.719825e-7,0.000005914732,0.0002672694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7912992,"threshold_uncertainty_score":0.3169637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898989991","doi":"","title":"On Limited Conjunctions in Polynomial Feature Logics, with Applications in OBDA.","year":2018,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Feature (linguistics); Polynomial; Theoretical computer science; Mathematics; Artificial intelligence; Algebra over a field; Algorithm; Pure mathematics; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0403847077313735,"gpt":0.3263807146401066,"spread":0.2859960069087331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003291309,0.00009651043,0.0001441808,0.0002931872,0.00009156125,0.00003699641,0.0002260497,0.00006926845,0.000002920795],"category_scores_gemma":[0.0002904008,0.00008032414,0.00001920337,0.0008394225,0.0001488189,0.0002423604,0.00009858504,0.0001457918,0.000006199762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005284174,"about_ca_system_score_gemma":0.00006217055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000347477,"about_ca_topic_score_gemma":0.0002037233,"domain_scores_codex":[0.9990903,0.0001189302,0.0002181246,0.0003227961,0.0001109559,0.0001388619],"domain_scores_gemma":[0.9991314,0.0001991676,0.0001377865,0.0003453648,0.0001377858,0.00004844296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001587036,0.000424285,0.1549508,0.00006165152,0.0000211516,0.000002672163,0.006917281,0.0007056169,0.001676487,0.796203,0.00008199947,0.03879642],"study_design_scores_gemma":[0.001776351,0.0003989494,0.7723507,0.000367211,0.00001220751,0.00002543078,0.0009087598,0.1964073,0.02105054,0.001586417,0.004762089,0.0003541248],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4177847,0.0003588698,0.5278023,0.0003732227,0.0002735072,0.0008454733,0.0000031964,0.0001189273,0.05243987],"genre_scores_gemma":[0.8379685,0.0000321173,0.1615001,0.00001813713,0.00004610073,0.00005987306,0.000006371666,0.000006352362,0.0003625015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7946166,"threshold_uncertainty_score":0.3275523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1513254282","doi":"","title":"Towards a logic of feature-based semantic science theories","year":2010,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Feature (linguistics); Artificial intelligence; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.02836111487639027,"gpt":0.3179121078937459,"spread":0.2895509930173557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007179579,0.0001040705,0.0002164856,0.0002108317,0.0001457849,0.00007110709,0.0006056106,0.00005673085,0.000005750671],"category_scores_gemma":[0.001336275,0.00007921727,0.00005638845,0.0006494506,0.0007395325,0.0003024396,0.0003184595,0.0001241496,0.000002433674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008360757,"about_ca_system_score_gemma":0.0002842671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004804376,"about_ca_topic_score_gemma":0.00005028305,"domain_scores_codex":[0.9989661,0.00004688959,0.000223757,0.0003249738,0.0002539044,0.0001843537],"domain_scores_gemma":[0.998691,0.0002415379,0.0001985447,0.0004530602,0.000345544,0.00007028584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001243772,0.00007262,0.04237079,0.0001024059,0.0000105576,0.000002785261,0.001881823,0.00004878754,0.04309669,0.8780067,0.00000526862,0.03438916],"study_design_scores_gemma":[0.0007372334,0.0001160335,0.3647693,0.0002029376,0.00002524488,0.00004724944,0.0005700768,0.1408009,0.4755583,0.01656557,0.0003448037,0.0002623704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7867086,0.0007673263,0.1790471,0.0006004006,0.0006849163,0.0002075281,9.385029e-7,0.0001149326,0.03186822],"genre_scores_gemma":[0.9306911,0.00002347607,0.06913497,0.00001211421,0.00002424214,0.00000500731,6.977493e-7,0.000003612148,0.0001047735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8614411,"threshold_uncertainty_score":0.3230387,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02879964874048106,"gpt":0.2945712786650068,"spread":0.2657716299245257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000302679,0.0001857215,0.0002690935,0.0003707809,0.000160687,0.00007581458,0.0003338041,0.000119416,0.00001253632],"category_scores_gemma":[0.0002678111,0.0001462849,0.00004784373,0.0008760549,0.0002111789,0.0002750051,0.0001557958,0.0002434401,0.00001825008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007334694,"about_ca_system_score_gemma":0.0001316943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009056809,"about_ca_topic_score_gemma":0.001138865,"domain_scores_codex":[0.9986369,0.00008356643,0.0003141134,0.0005383358,0.0001603843,0.0002667027],"domain_scores_gemma":[0.9987052,0.0003523999,0.0001978206,0.0004288591,0.0002095184,0.0001062227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0004081856,0.001991372,0.3587583,0.0001692198,0.00009671326,0.00003547318,0.01767412,0.0005593723,0.002855147,0.5560791,0.0005421027,0.06083093],"study_design_scores_gemma":[0.00216722,0.0003600609,0.9629956,0.0003418403,0.00001572077,0.0000341913,0.000820681,0.02235898,0.005118278,0.001310316,0.004085166,0.0003918943],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7802758,0.001240972,0.04081605,0.0004413356,0.0004031059,0.001107882,0.000006307129,0.0002132101,0.1754954],"genre_scores_gemma":[0.9927029,0.00007010303,0.006233688,0.00002267878,0.0001021062,0.00006367735,0.00001245118,0.00001139984,0.0007809943],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6042374,"threshold_uncertainty_score":0.5965324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}