{"meta":{"query_hash":"3f7fc1108130","filters":{"venue":"Principles of Knowledge Representation and Reasoning"},"cohort_total":18,"direct_labels_cover":0,"predictions_cover":18,"exported":18,"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/3f7fc1108130","api":"https://metacan.xera.ac/api/v1/cohort?venue=Principles+of+Knowledge+Representation+and+Reasoning"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Duration (music); Timeline; Computer science; Ontology; Metric (unit); Mathematics; Statistics","score_opus":0.04243871134609954,"score_gpt":0.3232519904105558,"score_spread":0.28081327906445624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510506302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055172415,0.0054997583,0.8560578,0.005816428,0.0014883048,0.0002485068,0.0038502873,0.0012962434,0.1202254],"genre_scores_gemma":[0.19651613,0.0133266095,0.74031115,0.0029132264,0.001873405,0.0010630564,0.0075598476,0.0006359791,0.035800565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605966,0.0011652175,0.00064376614,0.0007749906,0.0010710211,0.00028528043],"domain_scores_gemma":[0.99532324,0.0019500055,0.0006470776,0.00096636725,0.00081251666,0.00030072953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037432415,0.00097169454,0.0008827102,0.005648413,0.003605105,0.0063351593,0.0020682565,0.0023956238,0.0076783844],"category_scores_gemma":[0.008750838,0.0007716277,0.002401098,0.0062261405,0.0044579324,0.018424615,0.0037025148,0.004484153,0.0020731566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006358522,0.0000059557988,0.000082872844,0.000051511615,0.000005515756,0.00004056062,0.00029385433,0.0006861558,0.00010644485,0.9876495,0.002979499,0.008091722],"study_design_scores_gemma":[0.000008793957,0.0000063791827,0.00025215733,0.00015491749,0.000022303977,0.000249843,0.0003512238,0.003658053,0.00025287812,0.70162827,0.2933905,0.00002472954],"about_ca_topic_score_codex":0.012518255,"about_ca_topic_score_gemma":0.0073453295,"teacher_disagreement_score":0.012518255,"about_ca_system_score_codex":0.0035278092,"about_ca_system_score_gemma":0.0037240537,"threshold_uncertainty_score":0.0256868},"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,"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; Feature (linguistics); Artificial intelligence; Epistemology","score_opus":0.02836111487639027,"score_gpt":0.3179121078937459,"score_spread":0.28955099301735565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513254282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006537406,0.0010871638,0.9553636,0.008741252,0.00026230124,0.00011074823,0.00035998397,0.00024320469,0.027294314],"genre_scores_gemma":[0.31539297,0.0011995883,0.67006266,0.003728409,0.0007901519,0.0006950047,0.00066892186,0.00018744935,0.007274855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99134934,0.0042854007,0.0006382905,0.001134947,0.0021433686,0.00044865743],"domain_scores_gemma":[0.99050456,0.005638912,0.00063329947,0.0013887858,0.0014326763,0.00040181956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014709437,0.0009967022,0.0012770827,0.0048496327,0.0028409613,0.007312962,0.0032933601,0.0033395563,0.003544876],"category_scores_gemma":[0.01597993,0.00095623697,0.00306215,0.0034442835,0.012593171,0.017521381,0.0055674743,0.0075664776,0.00089568435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040367927,0.000004810058,0.000055331835,0.000014422916,0.000006620166,0.000023220457,0.00010650041,0.00074661727,0.00003399957,0.9966935,0.0004001936,0.0019108973],"study_design_scores_gemma":[0.0000037094187,0.000003490041,0.000020178872,0.000011578515,0.000003618393,0.0000131194265,0.00002250257,0.004653404,0.00004958984,0.9924844,0.0027303288,0.000004143372],"about_ca_topic_score_codex":0.0028376805,"about_ca_topic_score_gemma":0.0025218835,"teacher_disagreement_score":0.014709437,"about_ca_system_score_codex":0.004815478,"about_ca_system_score_gemma":0.0025507824,"threshold_uncertainty_score":0.07779187},"labels":[],"label_agreement":null},{"id":"W1898747386","doi":"","title":"Only-knowing meets nonmonotonic modal logic","year":2012,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Non-monotonic logic; Autoepistemic logic; Default logic; Rotation formalisms in three dimensions; Multimodal logic; Dynamic logic (digital electronics); Modal logic; Axiom; Circumscription; Normal modal logic; Computer science; Default; Accessibility relation; Artificial intelligence; Theoretical computer science; Modal operator; Modal; Description logic; Mathematics","score_opus":0.04601614073732518,"score_gpt":0.3090084260364157,"score_spread":0.2629922852990905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898747386","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07372421,0.0027595335,0.6590946,0.008726518,0.00046965719,0.0002311285,0.0009116514,0.0010753666,0.2530074],"genre_scores_gemma":[0.8724671,0.0010733713,0.106355615,0.0012987835,0.00055247144,0.00017283825,0.00046924746,0.00010295301,0.017507521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981482,0.0004480064,0.0001574518,0.00049936085,0.0005117875,0.00023525851],"domain_scores_gemma":[0.99808973,0.0010136723,0.00013587902,0.00022920435,0.0004059365,0.00012557086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015803297,0.00055593037,0.00067415263,0.0008926041,0.0016650781,0.00247685,0.00092118647,0.0014488215,0.0043972083],"category_scores_gemma":[0.002180936,0.0004196149,0.00076518033,0.0006909733,0.0032563459,0.007912167,0.0020687527,0.0025646153,0.0006975719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016605092,0.0000114393615,0.00008396842,0.000037545873,0.0000067941774,0.0001372495,0.00018902663,0.00049023936,0.00063884864,0.99238366,0.0007857717,0.0052188444],"study_design_scores_gemma":[0.000010945747,0.0000120758905,0.00008705767,0.00000926812,0.000009623242,0.00015247337,0.00006197198,0.0068563176,0.000843179,0.982736,0.009210306,0.000010727661],"about_ca_topic_score_codex":0.0014478437,"about_ca_topic_score_gemma":0.0014459079,"teacher_disagreement_score":0.0043972083,"about_ca_system_score_codex":0.002066178,"about_ca_system_score_gemma":0.0010325708,"threshold_uncertainty_score":0.014991283},"labels":[],"label_agreement":null},{"id":"W2166645709","doi":"","title":"Horn clause contraction functions: belief set and belief base approaches","year":2010,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Contraction (grammar); Horn clause; Propositional calculus; French horn; Belief revision; Mathematics; Computer science; Algorithm; Artificial intelligence; Discrete mathematics; Logic programming; Linguistics; Psychology","score_opus":0.0617395922315109,"score_gpt":0.28607829287329756,"score_spread":0.22433870064178665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166645709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005739462,0.00083302584,0.97842443,0.001460363,0.00005146491,0.00008284447,0.000071801835,0.0001179856,0.013218614],"genre_scores_gemma":[0.44525138,0.0019505272,0.53749883,0.001164569,0.0004345736,0.0007986844,0.00039807186,0.00016986608,0.012333472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99365836,0.0031451185,0.00030647952,0.0006366819,0.0018805864,0.00037288506],"domain_scores_gemma":[0.9889305,0.007838587,0.00043508952,0.0012065828,0.0012748636,0.00031428202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0112926625,0.00084973575,0.0009407327,0.002898495,0.0011483436,0.0035332763,0.0033495575,0.0020015484,0.0054694717],"category_scores_gemma":[0.018638462,0.0005450394,0.0017085944,0.0027572736,0.0054145698,0.010623644,0.003540126,0.0046843737,0.00087461143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028018718,0.000024301607,0.00013836694,0.000059153102,0.000019720625,0.000029470193,0.0003694859,0.0064603044,0.00025982948,0.96700233,0.0006082563,0.025000675],"study_design_scores_gemma":[0.000018083318,0.000033210585,0.000117873526,0.000051983217,0.000022066042,0.000048265705,0.00016170835,0.056421604,0.0007949543,0.93656504,0.0057490873,0.000016204402],"about_ca_topic_score_codex":0.0021924148,"about_ca_topic_score_gemma":0.0012271485,"teacher_disagreement_score":0.0112926625,"about_ca_system_score_codex":0.0030737957,"about_ca_system_score_gemma":0.001503439,"threshold_uncertainty_score":0.059722066},"labels":[],"label_agreement":null},{"id":"W2175700267","doi":"","title":"Generalized multi-context systems","year":2014,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Operational semantics; Well-founded semantics; Semantics (computer science); Context (archaeology); Computer science; Formal semantics (linguistics); Proof-theoretic semantics; Computational semantics; Denotational semantics; Action semantics; Theoretical computer science; Programming language","score_opus":0.04961093887796212,"score_gpt":0.2983021263901871,"score_spread":0.248691187512225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175700267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0507895,0.00637514,0.8941097,0.0030049768,0.00036633882,0.0003726041,0.0008423194,0.0009961537,0.04314318],"genre_scores_gemma":[0.7470256,0.0029612693,0.23979013,0.0007948857,0.00040190498,0.0004411948,0.00075875,0.00009968374,0.007726598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956275,0.0013856863,0.00045010724,0.0010478324,0.0010803037,0.00040863326],"domain_scores_gemma":[0.99688953,0.0010824723,0.00030624555,0.0008583812,0.00057430024,0.0002890871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002739829,0.0010921457,0.001252774,0.0026615139,0.0019354683,0.0053644716,0.0020025251,0.0020123387,0.00381494],"category_scores_gemma":[0.005363049,0.00049744034,0.0016048538,0.0027162859,0.0034753974,0.007455194,0.0060566203,0.0020714074,0.0006173321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025325658,0.000017718796,0.00053837785,0.00010798953,0.00007518572,0.00037222242,0.00039042367,0.01363488,0.0006257628,0.9713542,0.0010861652,0.011771787],"study_design_scores_gemma":[0.000028441102,0.000024196122,0.0002999595,0.000064344975,0.00005636502,0.00024289146,0.00021189572,0.049764987,0.0004818005,0.9232601,0.025533186,0.000031847634],"about_ca_topic_score_codex":0.0048030536,"about_ca_topic_score_gemma":0.0040439214,"teacher_disagreement_score":0.0053644716,"about_ca_system_score_codex":0.0022517082,"about_ca_system_score_gemma":0.0015450367,"threshold_uncertainty_score":0.016337395},"labels":[],"label_agreement":null},{"id":"W2177576448","doi":"","title":"Decidable reasoning in a fragment of the epistemic situation calculus","year":2014,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Situation calculus; Decidability; Undecidable problem; Fragment (logic); Calculus (dental); Formalism (music); Computer science; Frame problem; Circumscription; Knowledge representation and reasoning; Mathematics; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.022668286495043287,"score_gpt":0.2750889418451013,"score_spread":0.25242065535005803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177576448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021616913,0.0007187166,0.9560416,0.0016077936,0.00011904448,0.00017655303,0.00036790146,0.00097334664,0.018378232],"genre_scores_gemma":[0.6143344,0.0009979921,0.37431195,0.00078042643,0.00043603743,0.00047197184,0.0011332592,0.00019705697,0.007336894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916298,0.0025752096,0.0006146804,0.0014042292,0.0029002198,0.000875915],"domain_scores_gemma":[0.98962957,0.0072215335,0.00052989763,0.0014443287,0.000837209,0.0003374042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006565571,0.0009273933,0.0014588139,0.002040207,0.0029534341,0.0060370923,0.0033043346,0.002126024,0.0040098703],"category_scores_gemma":[0.015903512,0.001106526,0.004075114,0.0020401175,0.00854097,0.012320771,0.0049628597,0.0058059525,0.0006234269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005407531,0.00004256946,0.00012835827,0.00007221737,0.00003689572,0.0002864993,0.00063600484,0.014637657,0.0009954716,0.9738897,0.0010583762,0.008162053],"study_design_scores_gemma":[0.000038812286,0.000015392063,0.00006713251,0.00002757158,0.000038908347,0.00010524527,0.000072179384,0.05351655,0.000954033,0.93950886,0.005632423,0.000022883902],"about_ca_topic_score_codex":0.01091449,"about_ca_topic_score_gemma":0.0074021877,"teacher_disagreement_score":0.01091449,"about_ca_system_score_codex":0.004457988,"about_ca_system_score_gemma":0.0035900888,"threshold_uncertainty_score":0.034722447},"labels":[],"label_agreement":null},{"id":"W2189980513","doi":"","title":"Forgetting in action","year":2014,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Forgetting; Action (physics); Computer science; Belief revision; Operator (biology); Artificial intelligence; Cognitive science; Calculus (dental); Psychology; Cognitive psychology","score_opus":0.048302891363341906,"score_gpt":0.31641031960924526,"score_spread":0.26810742824590333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189980513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02234744,0.0012770348,0.93449795,0.0018764054,0.0003558129,0.00010267836,0.00014108892,0.0007118331,0.038689792],"genre_scores_gemma":[0.7215667,0.0014385936,0.25232476,0.0011788623,0.00043170096,0.00023124395,0.00045407773,0.0002915819,0.02208248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586415,0.0010123431,0.000299653,0.0013922827,0.0009854725,0.00044608544],"domain_scores_gemma":[0.99260217,0.003133883,0.0006019379,0.002443881,0.0008175526,0.0004005989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043578944,0.0012406985,0.0008183765,0.0012913174,0.0017575676,0.0037124893,0.0025041823,0.0021926225,0.00980439],"category_scores_gemma":[0.010408639,0.0007175968,0.0025460266,0.00074256235,0.007758748,0.013080698,0.0042630574,0.0030905085,0.0011300929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044451503,0.00002055594,0.0004258967,0.00010148004,0.000027845308,0.00026479986,0.001029639,0.0039807404,0.0008934265,0.9713558,0.00059048727,0.021264827],"study_design_scores_gemma":[0.000021143316,0.000051645326,0.0002485348,0.00007189958,0.000047793237,0.000271267,0.0001569741,0.014999886,0.0013400584,0.9665197,0.016239686,0.000031490443],"about_ca_topic_score_codex":0.0039085103,"about_ca_topic_score_gemma":0.0023059675,"teacher_disagreement_score":0.00980439,"about_ca_system_score_codex":0.0017883792,"about_ca_system_score_gemma":0.002055833,"threshold_uncertainty_score":0.032799006},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04915225042878439,"score_gpt":0.33164701157830595,"score_spread":0.28249476114952154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200473356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02658323,0.00023979408,0.9676906,0.0003761139,0.00001994308,0.00017303672,0.00011852819,0.0026487599,0.0021501288],"genre_scores_gemma":[0.31183362,0.00037633447,0.6815204,0.00041121474,0.00010024962,0.0003184661,0.0008277443,0.000642471,0.0039694537],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910415,0.0025839324,0.00074553426,0.0009794515,0.0040504374,0.0005990388],"domain_scores_gemma":[0.9784838,0.01511876,0.0011311539,0.0035147225,0.0014843886,0.0002672242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007016993,0.0009554742,0.0014138893,0.0024945757,0.0012125664,0.0034199418,0.003073902,0.0013580907,0.0035382088],"category_scores_gemma":[0.020944392,0.0010679399,0.0015444175,0.0038597041,0.0019706308,0.01048348,0.005156611,0.002404496,0.0012052923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016564596,0.0011984565,0.0041463044,0.00088491733,0.00025965163,0.0010894182,0.003435662,0.075545706,0.052210264,0.23840302,0.013848346,0.60732174],"study_design_scores_gemma":[0.00018020562,0.00029956194,0.0009985704,0.00009975323,0.00018367944,0.0008215848,0.0008700893,0.74681455,0.060530793,0.17025253,0.01883756,0.00011105376],"about_ca_topic_score_codex":0.0028547253,"about_ca_topic_score_gemma":0.0031528461,"teacher_disagreement_score":0.007016993,"about_ca_system_score_codex":0.0010814794,"about_ca_system_score_gemma":0.0017485906,"threshold_uncertainty_score":0.037109792},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01924517497698003,"score_gpt":0.26572870452363717,"score_spread":0.24648352954665714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222911679","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01613091,0.0001869726,0.9721665,0.0012006912,0.0000301524,0.00019429879,0.00015046124,0.00073706405,0.009203053],"genre_scores_gemma":[0.30822977,0.00029690497,0.6879664,0.00021353002,0.000042299493,0.0002830397,0.00037969867,0.00009300321,0.0024953857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971631,0.0013577637,0.00022517836,0.00042959163,0.00061210763,0.0002122545],"domain_scores_gemma":[0.99279684,0.0056562615,0.00042387223,0.00059573655,0.00034906305,0.00017829263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003271331,0.00096339546,0.00041557042,0.0009899597,0.0011885455,0.0024090721,0.0014451197,0.0013325149,0.0030525983],"category_scores_gemma":[0.01191024,0.00061881484,0.0014782365,0.000866598,0.0041319584,0.003321885,0.003436562,0.002097554,0.00036044724],"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.00017159208,0.00014709642,0.0011979373,0.00033124894,0.00006883569,0.0005714475,0.0009420907,0.25706056,0.0020858194,0.66522545,0.0028465556,0.06935137],"study_design_scores_gemma":[0.000055689656,0.000043513126,0.00018938571,0.00005331655,0.000036471178,0.00012242795,0.00015661864,0.38950202,0.0029351553,0.6008232,0.0060605863,0.000021599515],"about_ca_topic_score_codex":0.0057325945,"about_ca_topic_score_gemma":0.008564661,"teacher_disagreement_score":0.0057325945,"about_ca_system_score_codex":0.0018007641,"about_ca_system_score_gemma":0.0033248083,"threshold_uncertainty_score":0.017300606},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.23934077864338069,"score_gpt":0.4310733909013771,"score_spread":0.1917326122579964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237543400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00887162,0.00011131106,0.98687565,0.00078326266,0.000021316926,0.000088736364,0.0001819249,0.0006760658,0.00239013],"genre_scores_gemma":[0.18767111,0.00038560663,0.80533946,0.000677057,0.00013828733,0.0005021943,0.001161005,0.00028250998,0.0038427608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98957413,0.003960559,0.0009328727,0.0016649407,0.0031513188,0.0007161637],"domain_scores_gemma":[0.98415864,0.01158065,0.0011316425,0.0016415982,0.0012477911,0.00023960903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0092523955,0.0008937547,0.00084082206,0.0022167882,0.00093730923,0.0042024613,0.0029775063,0.001974319,0.003582673],"category_scores_gemma":[0.022061672,0.0008610516,0.0026281767,0.0018433706,0.0045995694,0.008326898,0.0052682017,0.0036510588,0.00062866416],"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.00011652169,0.00015070761,0.00092239166,0.00030942285,0.000077610865,0.0003241721,0.0011451172,0.04834589,0.002947867,0.88587075,0.0023161208,0.05747338],"study_design_scores_gemma":[0.000054674794,0.00005833611,0.00018913898,0.000080791084,0.00007641469,0.00023125997,0.0002150049,0.23095097,0.0069294614,0.7498003,0.011373612,0.000039944363],"about_ca_topic_score_codex":0.0018363862,"about_ca_topic_score_gemma":0.001777651,"teacher_disagreement_score":0.0092523955,"about_ca_system_score_codex":0.0015571617,"about_ca_system_score_gemma":0.0017176667,"threshold_uncertainty_score":0.048931956},"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,"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; 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","score_opus":0.03158008085999161,"score_gpt":0.3247805165416627,"score_spread":0.2932004356816711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510506392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009615632,0.0020173928,0.97463596,0.0029338803,0.00008012961,0.00016594742,0.00024092144,0.00067586906,0.0096341185],"genre_scores_gemma":[0.20613343,0.004863232,0.775047,0.0023388849,0.00070044596,0.0006482262,0.001306939,0.0007831168,0.008178764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9836865,0.0075639742,0.0013371967,0.0022042198,0.004093744,0.0011144293],"domain_scores_gemma":[0.96817833,0.025656391,0.00092509796,0.0031366118,0.0017795985,0.00032396044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016115434,0.0012395268,0.001865307,0.004518604,0.0035481162,0.009089249,0.0040885513,0.002971215,0.006070493],"category_scores_gemma":[0.03761599,0.0017831697,0.0035221782,0.009999847,0.01129345,0.029029356,0.008340033,0.0059994366,0.0016285123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000674635,0.00004525032,0.0004057155,0.00020218668,0.00003258503,0.00029532227,0.0019257778,0.011029443,0.000922454,0.9588526,0.0019763776,0.02424487],"study_design_scores_gemma":[0.000023452309,0.000041142306,0.00022439545,0.00010411292,0.0000665918,0.00023806083,0.0004075039,0.057257786,0.0021437875,0.9257613,0.013680813,0.000051125186],"about_ca_topic_score_codex":0.015041712,"about_ca_topic_score_gemma":0.008222971,"teacher_disagreement_score":0.016115434,"about_ca_system_score_codex":0.0060941647,"about_ca_system_score_gemma":0.0023418674,"threshold_uncertainty_score":0.08522761},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06647694693038328,"score_gpt":0.31551713390056374,"score_spread":0.24904018697018046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571905942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064872145,0.00055773166,0.9808967,0.0009386158,0.00013973203,0.000107500615,0.00019291112,0.00047264155,0.010206877],"genre_scores_gemma":[0.23068978,0.0014547538,0.7597437,0.0005998954,0.0002588557,0.0006704397,0.00067610573,0.00025723188,0.0056492286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955368,0.0015829366,0.0004493481,0.0006574171,0.001429071,0.000344492],"domain_scores_gemma":[0.9959591,0.0023773864,0.00026267362,0.00072226883,0.0005090476,0.00016951593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005792333,0.00085914164,0.0007247601,0.0016330804,0.0020492256,0.003485986,0.0023355247,0.0017709555,0.0033746716],"category_scores_gemma":[0.006659875,0.0010504143,0.0025457055,0.0018374745,0.008384068,0.010748773,0.0040692794,0.0063692443,0.00097356923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072968896,0.00000861961,0.000074282834,0.000030933756,0.000007433092,0.000091467096,0.00033926556,0.0019973118,0.00036885397,0.9927061,0.0004406898,0.003927726],"study_design_scores_gemma":[0.000015834152,0.000012630373,0.00006465983,0.0000268914,0.000015338968,0.000109832,0.0000792262,0.009960395,0.00072364556,0.9748635,0.0141113335,0.000016710552],"about_ca_topic_score_codex":0.0038107452,"about_ca_topic_score_gemma":0.00252734,"teacher_disagreement_score":0.005792333,"about_ca_system_score_codex":0.0016881644,"about_ca_system_score_gemma":0.0023909607,"threshold_uncertainty_score":0.030633152},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09561138242305982,"score_gpt":0.33751754286274355,"score_spread":0.24190616043968372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572760676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035067315,0.00013422543,0.99105483,0.00051675114,0.000048213624,0.00008610152,0.00028899775,0.00041601784,0.003948216],"genre_scores_gemma":[0.11603934,0.00043418683,0.8791179,0.00039822597,0.00009456288,0.00044310675,0.0007991198,0.00018225142,0.0024914062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967982,0.0013166239,0.00041710504,0.00038196382,0.00083688746,0.00024927166],"domain_scores_gemma":[0.99654835,0.0020963582,0.00037524028,0.00038544124,0.0004212086,0.0001732842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032089164,0.0011858935,0.00061750243,0.0012104443,0.0008435718,0.0024307014,0.0018981068,0.0012003793,0.003814222],"category_scores_gemma":[0.009225682,0.0006567699,0.0017501776,0.00200574,0.0020380917,0.0054559903,0.0024250054,0.002739132,0.0006524956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042162806,0.000041002575,0.0003015823,0.00015751176,0.000030218127,0.00028415868,0.0002835666,0.0922858,0.0020698807,0.8772606,0.0020664516,0.025177142],"study_design_scores_gemma":[0.00004985682,0.00004506173,0.0000833821,0.000049453593,0.000025117683,0.00014375075,0.00009709535,0.35188907,0.0023830007,0.62397456,0.021231536,0.000028104994],"about_ca_topic_score_codex":0.0061071874,"about_ca_topic_score_gemma":0.00911334,"teacher_disagreement_score":0.0061071874,"about_ca_system_score_codex":0.002263006,"about_ca_system_score_gemma":0.0026931546,"threshold_uncertainty_score":0.016970575},"labels":[],"label_agreement":null},{"id":"W2573027291","doi":"","title":"Negation without negation in probabilistic logic programming","year":2016,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Negation; Probabilistic logic; Computer science; Conditional probability; Mathematics; Joint probability distribution; Algorithm; Theoretical computer science; Artificial intelligence; Algebra over a field; Programming language; Pure mathematics; Statistics","score_opus":0.039872233386709144,"score_gpt":0.302820400739416,"score_spread":0.2629481673527069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573027291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009032471,0.00056837086,0.978573,0.0011936144,0.00008272046,0.000061271174,0.00013246972,0.00031389378,0.0100421],"genre_scores_gemma":[0.39340246,0.0014819136,0.59598124,0.0009824489,0.00033041832,0.00043257835,0.00044492213,0.00024319437,0.006700828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939996,0.0023692965,0.0005244677,0.001032541,0.0017137736,0.00036035827],"domain_scores_gemma":[0.99385923,0.0043235193,0.0003809023,0.00065597077,0.00058491883,0.00019547199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005881141,0.0008057285,0.0007584514,0.0012144309,0.0011678938,0.0045949323,0.0017599327,0.001289467,0.0026349574],"category_scores_gemma":[0.012473578,0.000843832,0.0016698772,0.002089291,0.006527189,0.009865355,0.0035196503,0.0032809929,0.00061408407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021208838,0.000011869699,0.0001655849,0.00006339541,0.000013859125,0.000079899924,0.0002057405,0.009056987,0.0003460066,0.9744091,0.0005630359,0.015063349],"study_design_scores_gemma":[0.000008491836,0.000009766841,0.000033425807,0.000028012788,0.00001387428,0.000056978963,0.000026704636,0.02554754,0.00046790656,0.968491,0.0053044637,0.000011716666],"about_ca_topic_score_codex":0.00320504,"about_ca_topic_score_gemma":0.002356375,"teacher_disagreement_score":0.005881141,"about_ca_system_score_codex":0.0023857302,"about_ca_system_score_gemma":0.0016407938,"threshold_uncertainty_score":0.031102836},"labels":[],"label_agreement":null},{"id":"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,"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; Inference; Probabilistic logic; Speedup; Compiler; Relational database; Programming language; Theoretical computer science; Data structure; Artificial intelligence; Data mining; Parallel computing","score_opus":0.09358399773436435,"score_gpt":0.36776521288524194,"score_spread":0.27418121515087757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579435387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007576783,0.000080295875,0.97103196,0.00016238041,0.00003907692,0.00007330299,0.00018411277,0.019168573,0.001683561],"genre_scores_gemma":[0.15542358,0.00023271186,0.8378995,0.00028758944,0.00007005787,0.00018523635,0.0010336197,0.0029981146,0.0018695868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789006,0.00042161,0.00020367806,0.00059455575,0.00064337766,0.00024684778],"domain_scores_gemma":[0.9911225,0.0048431377,0.00039239478,0.0027246806,0.0007793543,0.0001380356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017417769,0.0011003619,0.000977975,0.0009704165,0.00068855984,0.0024069014,0.0021112063,0.0008876387,0.007607338],"category_scores_gemma":[0.012399353,0.0011497046,0.0024168957,0.0010752232,0.0015485449,0.0046239467,0.0029868179,0.0031533632,0.0025544502],"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.00047205752,0.00043949983,0.0036535573,0.001075854,0.0002269861,0.0008817405,0.001246129,0.21531977,0.02144209,0.14019834,0.021760931,0.593283],"study_design_scores_gemma":[0.00008305463,0.00008217169,0.00047810437,0.00011194944,0.00010781854,0.0003199671,0.00011166113,0.80293924,0.027625589,0.15264942,0.015429525,0.00006146961],"about_ca_topic_score_codex":0.004566504,"about_ca_topic_score_gemma":0.004663803,"teacher_disagreement_score":0.007607338,"about_ca_system_score_codex":0.0010129059,"about_ca_system_score_gemma":0.0023885507,"threshold_uncertainty_score":0.025449097},"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,"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; Feature (linguistics); Polynomial; Theoretical computer science; Mathematics; Artificial intelligence; Algebra over a field; Algorithm; Pure mathematics; Linguistics","score_opus":0.040384707731373495,"score_gpt":0.3263807146401066,"score_spread":0.2859960069087331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898989991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011239958,0.0024845735,0.95317185,0.0020833793,0.00019854496,0.00009994156,0.00036495482,0.00050449814,0.029852236],"genre_scores_gemma":[0.3631054,0.0039156494,0.611569,0.0013340076,0.00081290945,0.00035350598,0.00088477024,0.00034107643,0.01768378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971834,0.0011512253,0.00019427094,0.0004960504,0.0006880538,0.00028707003],"domain_scores_gemma":[0.9909032,0.006929001,0.00042717476,0.0008212814,0.0006237433,0.00029562257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004751651,0.00090812746,0.0012533207,0.0025461898,0.0020384456,0.0032578586,0.0026408187,0.0014985171,0.009350593],"category_scores_gemma":[0.016790323,0.0008121205,0.0019476097,0.0042554378,0.0051203393,0.012005371,0.005355198,0.0046745753,0.0014692673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010376764,0.000074934076,0.00040599133,0.00016301619,0.000032142954,0.00019283051,0.0002970126,0.011135787,0.00054376887,0.9451388,0.0036172313,0.03829472],"study_design_scores_gemma":[0.000018529143,0.000017310638,0.00012891863,0.00005400891,0.000025541094,0.000073917094,0.00007742036,0.03245026,0.00037367843,0.9612562,0.005509495,0.000014693027],"about_ca_topic_score_codex":0.0048534637,"about_ca_topic_score_gemma":0.008284888,"teacher_disagreement_score":0.009350593,"about_ca_system_score_codex":0.0026303327,"about_ca_system_score_gemma":0.0014190145,"threshold_uncertainty_score":0.031280875},"labels":[],"label_agreement":null},{"id":"W2899509916","doi":"","title":"Specifying Plausibility Levels for Iterated Belief Change in the Situation Calculus.","year":2018,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Iterated function; Belief revision; Computer science; Calculus (dental); Situation calculus; Theoretical computer science; Mathematics; Artificial intelligence; Medicine","score_opus":0.15139629189528303,"score_gpt":0.37167727085933766,"score_spread":0.22028097896405463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899509916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029284183,0.0005459496,0.9356049,0.0018173679,0.00013375373,0.00017864224,0.0002855381,0.00070152554,0.031448215],"genre_scores_gemma":[0.6891655,0.00027219093,0.30415642,0.0003379333,0.00012697201,0.00025309867,0.00032876138,0.00016080643,0.0051983814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923838,0.0032364905,0.00076585554,0.0010092854,0.0019461984,0.00065841863],"domain_scores_gemma":[0.9825691,0.012923393,0.000800814,0.0015314787,0.0015250935,0.0006501433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009245238,0.00093887653,0.0009664577,0.0022424625,0.0023119398,0.008289666,0.0028578872,0.0035542601,0.009088459],"category_scores_gemma":[0.043290712,0.0015298715,0.0028896264,0.0012880033,0.0056550903,0.015090734,0.0047533903,0.0059732,0.001227505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009899439,0.000042128744,0.0003494753,0.00007301149,0.000044263485,0.00019925646,0.0007122982,0.007990809,0.0007480371,0.98012084,0.00062190025,0.008998906],"study_design_scores_gemma":[0.000029969997,0.000019809997,0.0000880093,0.000029265108,0.000031880176,0.000057024317,0.00009659885,0.029653074,0.0005888016,0.9680296,0.0013565295,0.000019374404],"about_ca_topic_score_codex":0.0035231907,"about_ca_topic_score_gemma":0.0044575795,"teacher_disagreement_score":0.009245238,"about_ca_system_score_codex":0.0030440916,"about_ca_system_score_gemma":0.0020550624,"threshold_uncertainty_score":0.048894048},"labels":[],"label_agreement":null},{"id":"W3092634028","doi":"","title":"On limited conjunctions in polynomial feature logics, with applications in obda — Extended abstract","year":2018,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Feature (linguistics); Computer science; Polynomial; Algebra over a field; Theoretical computer science; Mathematics; Artificial intelligence; Pure mathematics; Linguistics; Philosophy","score_opus":0.028799648740481056,"score_gpt":0.29457127866500676,"score_spread":0.2657716299245257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092634028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015586392,0.0013382911,0.9617923,0.001658147,0.00025501498,0.000070886184,0.0002563324,0.00036261082,0.018680058],"genre_scores_gemma":[0.40033987,0.0029062328,0.5789085,0.00094892184,0.0013396959,0.00026935057,0.00065860624,0.00035901027,0.014269757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973667,0.0011109585,0.00017901292,0.00046268225,0.00061351556,0.00026713146],"domain_scores_gemma":[0.9907539,0.006814525,0.0004248407,0.0009303449,0.00076441653,0.00031198692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045189704,0.0008765461,0.0014685092,0.0027858352,0.001922147,0.0038223423,0.0027586299,0.0014226631,0.00946645],"category_scores_gemma":[0.01418431,0.0008261978,0.0024501919,0.0057702065,0.0045108823,0.012433359,0.0057951533,0.004588494,0.0012494386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015154599,0.000117878124,0.0005137443,0.00017189434,0.000038259317,0.00020333916,0.0003255725,0.014007695,0.000810268,0.92497414,0.0039424174,0.054743335],"study_design_scores_gemma":[0.000019058187,0.000023533761,0.00014254639,0.000049775528,0.000029836294,0.00007624998,0.00007167642,0.066698365,0.00044430836,0.9277053,0.0047186455,0.00002083954],"about_ca_topic_score_codex":0.0035539055,"about_ca_topic_score_gemma":0.0051859207,"teacher_disagreement_score":0.00946645,"about_ca_system_score_codex":0.0018865122,"about_ca_system_score_gemma":0.0010920605,"threshold_uncertainty_score":0.031668425},"labels":[],"label_agreement":null}]}