{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"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":"666f4a6656e9","filters":{"venue":"Description Logics"}},"results":[{"id":"W183822441","doi":"","title":"Binary Absorption in Tableaux-Based Reasoning for Description Logics.","year":2006,"lang":"en","type":"article","venue":"Description Logics","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":43,"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; Generalization; Satisfiability; Axiom; Binary number; Terminology; Algorithm; Theoretical computer science; Boolean satisfiability problem; Mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.04297128287683932,"gpt":0.2480619291802778,"spread":0.2050906463034385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326062,0.0002252676,0.0002598882,0.0003184578,0.0001836046,0.0003050066,0.0004889606,0.0002180185,0.00001137894],"category_scores_gemma":[0.000161479,0.0002113676,0.0001115127,0.0005562511,0.00006803894,0.0009481789,0.00007254438,0.000164903,0.000034685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002224632,"about_ca_system_score_gemma":0.00007312373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003391949,"about_ca_topic_score_gemma":0.0002261329,"domain_scores_codex":[0.9981514,0.0001076381,0.0004470643,0.0005433203,0.0002632008,0.0004874345],"domain_scores_gemma":[0.9990616,0.0001093939,0.0001896834,0.000431962,0.0001577105,0.00004959195],"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.0002456147,0.001079762,0.06496397,0.0002164102,0.00001877303,0.0001122248,0.0004891443,0.06174443,0.06605568,0.7631006,0.01620471,0.02576868],"study_design_scores_gemma":[0.001897835,0.0004372328,0.1917768,0.0001164678,0.00001943891,0.00002407051,0.0002032375,0.7035773,0.002614872,0.08554734,0.01315655,0.0006288741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1848944,0.000500435,0.811127,0.0006100865,0.0008056355,0.0003971214,0.000004424002,0.0003860769,0.001274872],"genre_scores_gemma":[0.8777766,0.00002436254,0.1212216,0.0003823763,0.0001294572,0.000090073,0.00004919508,0.00001271213,0.0003136288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6928822,"threshold_uncertainty_score":0.8619319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142128908","doi":"","title":"Automata-Based Abduction for Tractable Diagnosis.","year":2010,"lang":"en","type":"article","venue":"Description Logics","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Inference; Abductive reasoning; Axiom; Domain (mathematical analysis); Theoretical computer science; Complete information; Automaton; Artificial intelligence; Non-monotonic logic; Representation (politics); Interpretation (philosophy); Monotonic function; Machine learning; Programming language; Mathematical economics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0428340268826681,"gpt":0.265612261656814,"spread":0.2227782347741459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003366543,0.0001019598,0.0001190317,0.00007896475,0.0001559689,0.000207327,0.0004059339,0.0001158848,0.0000226449],"category_scores_gemma":[0.0002349823,0.00008753832,0.0000726195,0.0001579303,0.00004343729,0.0005544613,0.0000315138,0.0001250329,0.00004134585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001949446,"about_ca_system_score_gemma":0.0000444225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001688593,"about_ca_topic_score_gemma":0.00003762461,"domain_scores_codex":[0.9991745,0.00002154956,0.0001658463,0.000272765,0.0001408178,0.0002245626],"domain_scores_gemma":[0.9992406,0.000123026,0.00007870287,0.000400146,0.0001067741,0.00005079763],"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.00004689844,0.000932514,0.01425042,0.0001148366,0.00002950869,0.00001703191,0.0005598349,0.001236768,0.05283919,0.6018395,0.07543372,0.2526997],"study_design_scores_gemma":[0.001622136,0.0004493484,0.05561538,0.00001927324,0.00003369715,0.00004266409,0.0001050643,0.4182838,0.04614334,0.06817242,0.4088767,0.0006361299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09115369,0.00004833662,0.9016456,0.002568022,0.003143229,0.000248505,0.000004057562,0.0005851584,0.0006033844],"genre_scores_gemma":[0.77651,0.000009483957,0.2224565,0.0005778464,0.0001431289,0.0001342885,0.000008358691,0.000005781329,0.0001545624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6853563,"threshold_uncertainty_score":0.3569709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W109312419","doi":"","title":"Retrospective on Clio: Schema Mapping and Data Exchange in Practice.","year":2007,"lang":"en","type":"article","venue":"Description Logics","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"","keywords":"IBM; Computer science; Schema (genetic algorithms); Research center; Library science; Data science; Operations research; Information retrieval; Political science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1312090230740086,"gpt":0.3333104883830632,"spread":0.2021014653090546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527556,0.00009654517,0.0001254408,0.0001714992,0.00006905119,0.0001369268,0.0005151947,0.00008539305,0.000003476685],"category_scores_gemma":[0.000787498,0.0000856876,0.00001168746,0.0003740528,0.00004705948,0.001061618,0.0004043739,0.000182133,0.0000229681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007666896,"about_ca_system_score_gemma":0.00001494614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005566204,"about_ca_topic_score_gemma":0.0001060584,"domain_scores_codex":[0.9988801,0.00005439731,0.0001834717,0.0004438129,0.0002021666,0.0002359977],"domain_scores_gemma":[0.9990278,0.0001362468,0.00009358882,0.0006396401,0.00005942119,0.00004323507],"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.0001071801,0.0004636945,0.1150039,0.00006244285,0.0000404153,0.0006991667,0.006262343,0.00001172423,0.002512293,0.6893753,0.006179698,0.1792819],"study_design_scores_gemma":[0.0008280139,0.0002812899,0.9037181,0.00008576195,0.000009839429,0.0001221186,0.002458903,0.01477848,0.0003690095,0.01417707,0.06278267,0.0003888006],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1293044,0.001105793,0.8401581,0.003401591,0.0009597935,0.0002884067,0.000004579992,0.0002602439,0.02451709],"genre_scores_gemma":[0.923174,0.0002609937,0.07517183,0.001203586,0.00008132283,0.000002440991,0.000005418058,0.000004215412,0.0000962422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7938696,"threshold_uncertainty_score":0.3494239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W38868912","doi":"10.1111/ahe.13073","title":"Specifying Event Logics for Active Databases.","year":2002,"lang":"en","type":"article","venue":"Description Logics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Active database; Computer science; Event (particle physics); Event calculus; Semantics (computer science); Action (physics); Database; Dimension (graph theory); Description logic; Theoretical computer science; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.153769469963791,"gpt":0.2870872975224822,"spread":0.1333178275586912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003221254,0.0002100804,0.0002167927,0.0001032337,0.000294676,0.0001844486,0.0006596101,0.00009412183,0.000162076],"category_scores_gemma":[0.0002437446,0.000179098,0.0001450424,0.0003209045,0.00005886441,0.0008401938,0.00022996,0.0001745647,0.0003037363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00015381,"about_ca_system_score_gemma":0.00002183307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007438608,"about_ca_topic_score_gemma":0.00001364642,"domain_scores_codex":[0.9984325,0.00007104377,0.0002726891,0.0005369728,0.0002475326,0.0004393065],"domain_scores_gemma":[0.9988216,0.0001296577,0.0001586131,0.0005681633,0.0001897121,0.0001322357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002371506,0.0005325982,0.0007183567,0.00005288951,0.00004146519,0.0000352085,0.002381786,0.0002405789,0.001435638,0.8063352,0.05063836,0.1375642],"study_design_scores_gemma":[0.001478932,0.000468058,0.004036928,0.0000509224,0.0000395206,0.00008089613,0.0003353143,0.2446476,0.002905696,0.03544924,0.7096101,0.0008967888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002888773,0.0007004507,0.9753557,0.0003790659,0.001408167,0.0003780668,0.00002451548,0.0003034292,0.01856176],"genre_scores_gemma":[0.9122593,0.0003658605,0.08252922,0.0008318253,0.0005350214,0.00007384686,0.00004028116,0.00001939165,0.003345266],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9093705,"threshold_uncertainty_score":0.7303405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406241794","doi":"","title":"Singular Referring Expressions in Conjunctive Query Answers: the case for a CFD DL Dialect.","year":2015,"lang":"en","type":"article","venue":"Description Logics","topic":"Natural Language Processing Techniques","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 Waterloo","funders":"","keywords":"Conjunctive query; Computer science; Context (archaeology); Noun phrase; Expression (computer science); Constant (computer programming); Phrase; Base (topology); Theoretical computer science; Natural language processing; Information retrieval; Programming language; Noun; Mathematics; Relational database","retraction":null,"screen_n_in":null,"score":{"opus":0.1015648086962483,"gpt":0.311220755416625,"spread":0.2096559467203767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008004335,0.000129525,0.0001351751,0.0001204894,0.0001636475,0.000233541,0.0004898536,0.0001064108,0.000001365967],"category_scores_gemma":[0.0007748806,0.0000878143,0.00004715656,0.00035763,0.00006356245,0.0007049135,0.0001849073,0.0002302813,0.000003295355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001810096,"about_ca_system_score_gemma":0.0000958484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001534272,"about_ca_topic_score_gemma":0.00010478,"domain_scores_codex":[0.9989457,0.0001454498,0.0002033249,0.000306913,0.0001540454,0.0002445439],"domain_scores_gemma":[0.999071,0.0001476809,0.0001014054,0.0003959926,0.0002108259,0.00007307662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002878955,0.000569354,0.001188025,0.0001587039,0.00005681846,0.004023176,0.04629829,0.0005831149,0.06279729,0.7303115,0.0258877,0.1278381],"study_design_scores_gemma":[0.001903337,0.000613352,0.0002035643,0.0003642755,0.0000375306,0.001766802,0.00391912,0.1330534,0.02769187,0.8073887,0.02204297,0.001015062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02861481,0.001680506,0.9672147,0.0008632531,0.0004155404,0.0004295978,0.000003881124,0.000393525,0.0003841944],"genre_scores_gemma":[0.7521825,0.000005623879,0.2470255,0.0005447147,0.00006561948,0.000084625,0.000003384194,0.000008207588,0.00007975344],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7235677,"threshold_uncertainty_score":0.3580963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}