The DOI matches its DataCite record; 2 of the 2 references it cites were found in a registry or an index.
Information Retrieval Service Aspects of the Open Research Knowledge Graph
Abstract
Information Retrieval (IR) takes a fresh perspective in the context of the next-generation digital libraries such as the Open Research Knowledge Graph (ORKG). As scholarly digital libraries evolve from document-based to knowledge-graph-based representations of content, there is a need for their information technology services to suitably adapt as well. The ORKG enables a structured representation of scholarly contributions data as RDF triples - in turn, it fosters FAIR (Findable, Accessible, Interoperable, and Reusable) scholarly contributions. This thesis has practically examined three different IR service aspects in the ORKG with the aim to help users: (i) easily find and compare relevant scholarly contributions; and (ii) structure new contributions in a manner consistent to the existing ORKG knowledge base of structured contributions. In the first part, it will evaluate and enhance the performance of the default ORKG “Contributions Similarity Service.” An optimal representation of contributions as documents obtains better retrieval performance of the BM25 algorithm in Elasticsearch. To achieve this, evaluation datasets were created and the contributions search index reinitialized with the new documents. In its second part, this thesis will introduce a “Templates Recommendation Service.” Two approaches were tested. A supervised approach with a Natural Language Inference (NLI) objective that tries to infer a contribution template for a given paper if one exists or none. And an unsupervised approach based on search that tries to return the most relevant template for a queried paper. Our experiments favoring ease of practical installation resulted in the conclusion that the unsupervised approach was better suited to the task. In a third and final part, a “Grouped Predicates Recommendation Service” will be introduced. Inspired from prior work, the service implements K-Means clustering with an IR spin. Similar structured papers are grouped, their in-cluster predicate groups computed, and new papers are semantified based on the predicate groups of the most similar cluster. The resulting micro-averaged F-measure of 65.5% using TF-IDF vectors has shown a sufficient homogeneity in the clusters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“It also applies NLP tools for suggesting relevant predefined input templates to users”
From Rosetta Statements: simplifying FAIR knowledge graph construction with a user-centred approach (2026) · cites this paper as [55]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Test Collection Based Evaluation of Information Retrieval Systems
Sanderson, M. (2010) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000009 · Cited by 485
Cited by
Rosetta Statements: simplifying FAIR knowledge graph construction with a user-centred approach
Vogt, L., Farfar, K. E., Karanth, P., Konrad, M., Oelen, A., Prinz, M., & Strömert, P. (2026) · Database · doi:10.1093/database/baag030 · Cited by 4
Metadata
- Authors
- Arab Oghli, O.
- Venue
- Hannover : Gottfried Wilhelm Leibniz Universität
- Publisher
- Hannover : Gottfried Wilhelm Leibniz Universität
- Published
- 2022-01-14
- References
- 2
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Information Retrieval Service Aspects of the Open Research Knowledge Graph. https://app.cochat.ai/papers/10.15488/11834
- The paper
- Arab Oghli, O. (2022). Information Retrieval Service Aspects of the Open Research Knowledge Graph. Hannover : Gottfried Wilhelm Leibniz Universität. https://doi.org/10.15488/11834
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.