{"meta":{"query_hash":"666f4a6656e9","filters":{"venue":"Description Logics"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/666f4a6656e9","api":"https://metacan.xera.ac/api/v1/cohort?venue=Description+Logics"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13120902307400858,"score_gpt":0.33331048838306315,"score_spread":0.20210146530905457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109312419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1293044,0.001105793,0.8401581,0.0034015905,0.0009597935,0.0002884067,0.0000045799925,0.00026024386,0.024517093],"genre_scores_gemma":[0.92317396,0.00026099372,0.07517183,0.0012035865,0.000081322825,0.0000024409906,0.000005418058,0.0000042154124,0.0000962422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99888015,0.000054397307,0.00018347167,0.0004438129,0.0002021666,0.00023599766],"domain_scores_gemma":[0.99902785,0.00013624676,0.00009358882,0.00063964014,0.000059421185,0.00004323507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527556,0.00009654517,0.00012544084,0.00017149917,0.00006905119,0.00013692678,0.0005151947,0.00008539305,0.0000034766852],"category_scores_gemma":[0.000787498,0.0000856876,0.000011687458,0.00037405285,0.000047059475,0.0010616175,0.00040437386,0.00018213302,0.0000229681],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001071801,0.00046369445,0.11500387,0.00006244285,0.000040415296,0.0006991667,0.0062623434,0.00001172423,0.0025122932,0.6893753,0.006179698,0.1792819],"study_design_scores_gemma":[0.00082801393,0.0002812899,0.90371805,0.00008576195,0.000009839429,0.00012211857,0.002458903,0.014778478,0.0003690095,0.014177073,0.06278267,0.0003888006],"about_ca_topic_score_codex":0.000055662036,"about_ca_topic_score_gemma":0.000106058396,"teacher_disagreement_score":0.79386955,"about_ca_system_score_codex":0.000076668955,"about_ca_system_score_gemma":0.000014946139,"threshold_uncertainty_score":0.3494239},"labels":[],"label_agreement":null},{"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,"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; Generalization; Satisfiability; Axiom; Binary number; Terminology; Algorithm; Theoretical computer science; Boolean satisfiability problem; Mathematics; Arithmetic","score_opus":0.042971282876839316,"score_gpt":0.24806192918027783,"score_spread":0.2050906463034385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183822441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18489435,0.00050043495,0.811127,0.0006100865,0.00080563553,0.00039712142,0.000004424002,0.0003860769,0.0012748723],"genre_scores_gemma":[0.8777766,0.000024362542,0.12122158,0.00038237628,0.00012945721,0.000090073,0.000049195078,0.0000127121275,0.00031362876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815136,0.00010763813,0.00044706432,0.00054332026,0.00026320084,0.00048743453],"domain_scores_gemma":[0.99906164,0.0001093939,0.0001896834,0.000431962,0.00015771047,0.00004959195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326062,0.00022526759,0.00025988815,0.00031845775,0.00018360457,0.00030500657,0.00048896065,0.00021801845,0.000011378941],"category_scores_gemma":[0.00016147898,0.00021136756,0.00011151265,0.0005562511,0.00006803894,0.0009481789,0.00007254438,0.00016490296,0.000034684996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024561468,0.0010797622,0.064963974,0.00021641023,0.000018773026,0.00011222482,0.0004891443,0.061744425,0.06605568,0.7631006,0.016204707,0.02576868],"study_design_scores_gemma":[0.0018978348,0.00043723278,0.19177681,0.00011646784,0.000019438912,0.000024070512,0.00020323753,0.7035773,0.002614872,0.085547335,0.013156551,0.00062887406],"about_ca_topic_score_codex":0.00033919487,"about_ca_topic_score_gemma":0.00022613292,"teacher_disagreement_score":0.69288224,"about_ca_system_score_codex":0.0002224632,"about_ca_system_score_gemma":0.00007312373,"threshold_uncertainty_score":0.8619319},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0428340268826681,"score_gpt":0.26561226165681395,"score_spread":0.22277823477414585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142128908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09115369,0.000048336617,0.9016456,0.0025680219,0.003143229,0.00024850504,0.000004057562,0.0005851584,0.0006033844],"genre_scores_gemma":[0.77651,0.000009483957,0.22245653,0.0005778464,0.00014312894,0.00013428854,0.000008358691,0.0000057813295,0.00015456244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991745,0.000021549564,0.00016584629,0.00027276503,0.00014081782,0.00022456261],"domain_scores_gemma":[0.9992406,0.00012302598,0.00007870287,0.00040014597,0.00010677411,0.000050797633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033665434,0.00010195977,0.00011903174,0.000078964746,0.00015596885,0.000207327,0.00040593388,0.00011588484,0.000022644905],"category_scores_gemma":[0.00023498226,0.00008753832,0.0000726195,0.00015793032,0.00004343729,0.00055446126,0.000031513802,0.00012503291,0.000041345847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004689844,0.000932514,0.014250422,0.00011483658,0.000029508687,0.000017031905,0.0005598349,0.0012367679,0.05283919,0.60183954,0.07543372,0.25269973],"study_design_scores_gemma":[0.0016221359,0.00044934836,0.055615384,0.000019273235,0.000033697153,0.00004266409,0.00010506427,0.4182838,0.046143338,0.06817242,0.40887675,0.00063612993],"about_ca_topic_score_codex":0.000016885931,"about_ca_topic_score_gemma":0.00003762461,"teacher_disagreement_score":0.6853563,"about_ca_system_score_codex":0.000019494464,"about_ca_system_score_gemma":0.0000444225,"threshold_uncertainty_score":0.3569709},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10156480869624833,"score_gpt":0.31122075541662503,"score_spread":0.20965594672037668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406241794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028614812,0.0016805059,0.9672147,0.0008632531,0.00041554036,0.0004295978,0.0000038811245,0.000393525,0.0003841944],"genre_scores_gemma":[0.75218254,0.0000056238787,0.24702553,0.00054471474,0.00006561948,0.000084625,0.0000033841936,0.000008207588,0.000079753445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989457,0.00014544983,0.0002033249,0.000306913,0.00015404535,0.00024454386],"domain_scores_gemma":[0.999071,0.00014768085,0.000101405436,0.00039599263,0.0002108259,0.00007307662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080043345,0.00012952495,0.00013517508,0.00012048937,0.00016364749,0.00023354098,0.0004898536,0.00010641084,0.0000013659673],"category_scores_gemma":[0.00077488064,0.0000878143,0.00004715656,0.00035762996,0.00006356245,0.00070491346,0.00018490729,0.00023028132,0.0000032953553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028789547,0.000569354,0.0011880248,0.00015870386,0.000056818462,0.0040231757,0.04629829,0.00058311486,0.062797286,0.7303115,0.0258877,0.12783813],"study_design_scores_gemma":[0.0019033374,0.000613352,0.0002035643,0.00036427547,0.0000375306,0.001766802,0.00391912,0.13305344,0.027691867,0.80738866,0.022042971,0.0010150619],"about_ca_topic_score_codex":0.00015342723,"about_ca_topic_score_gemma":0.00010478003,"teacher_disagreement_score":0.7235677,"about_ca_system_score_codex":0.00018100963,"about_ca_system_score_gemma":0.0000958484,"threshold_uncertainty_score":0.3580963},"labels":[],"label_agreement":null},{"id":"W38868912","doi":"10.1111/ahe.13073","title":"Specifying Event Logics for Active Databases.","year":2002,"lang":"en","type":"article","venue":"Description Logics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Active database; Computer science; Event (particle physics); Event calculus; Semantics (computer science); Action (physics); Database; Dimension (graph theory); Description logic; Theoretical computer science; Programming language; Mathematics","score_opus":0.15376946996379104,"score_gpt":0.28708729752248224,"score_spread":0.1333178275586912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38868912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028887733,0.00070045074,0.97535574,0.00037906587,0.0014081672,0.00037806676,0.000024515477,0.0003034292,0.01856176],"genre_scores_gemma":[0.9122593,0.00036586053,0.08252922,0.0008318253,0.00053502136,0.00007384686,0.000040281164,0.000019391655,0.0033452662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843246,0.00007104377,0.0002726891,0.0005369728,0.0002475326,0.0004393065],"domain_scores_gemma":[0.9988216,0.00012965772,0.00015861305,0.0005681633,0.00018971213,0.00013223574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032212536,0.00021008038,0.00021679266,0.0001032337,0.000294676,0.0001844486,0.00065961014,0.00009412183,0.00016207603],"category_scores_gemma":[0.00024374461,0.000179098,0.0001450424,0.00032090445,0.00005886441,0.00084019377,0.00022996005,0.00017456475,0.0003037363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023715058,0.0005325982,0.0007183567,0.00005288951,0.000041465195,0.0000352085,0.002381786,0.00024057885,0.0014356379,0.8063352,0.050638363,0.13756421],"study_design_scores_gemma":[0.0014789315,0.00046805802,0.004036928,0.0000509224,0.000039520604,0.000080896134,0.0003353143,0.24464758,0.0029056957,0.035449244,0.7096101,0.0008967888],"about_ca_topic_score_codex":0.000007438608,"about_ca_topic_score_gemma":0.000013646424,"teacher_disagreement_score":0.90937054,"about_ca_system_score_codex":0.00015381005,"about_ca_system_score_gemma":0.000021833072,"threshold_uncertainty_score":0.7303405},"labels":[],"label_agreement":null}]}