The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Binary RDF representation for publication and exchange (HDT)
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
Linked Data - The Story So Far
Bizer, C., Heath, T., & Berners-Lee, T. (2009) · International Journal on Semantic Web and Information Systems · doi:10.4018/jswis.2009081901 · Cited by 4,525
Prud’hommeaux, E. (2008) · Medical Entomology and Zoology · Cited by 3,097
Key words for use in RFCs to Indicate Requirement Levels
Bradner, S. (1997) · doi:10.17487/rfc2119 · Cited by 2,997
Data Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
The webgraph framework I: compression techniques
Boldi, P., & Vigna, S. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988752 · Cited by 1,201
Semantics and complexity of SPARQL
Pérez, J., Arenas, M., & Gutierrez, C. (2009) · ACM Transactions on Database Systems · doi:10.1145/1567274.1567278 · Cited by 1,134
Hypertext Transfer Protocol -- HTTP/1.0
Berners‐Lee, T., Fielding, R. T., & Nielsen, H. F. (1996) · doi:10.17487/rfc1945 · Cited by 774
Scalable Semantic Web Data Management Using Vertical Partitioning
Abadi, D. J., Marcus, A., Madden, S. R., et al. (2007) · Cited by 653
Weiß, C., Karras, P., & Bernstein, A. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453965 · Cited by 637
Cited by
Hogan, A., Blomqvist, E., Cochez, M., D’amato, C., Melo, G. D., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., et al. (2022) · ACM Computing Surveys · doi:10.1145/3447772 · Cited by 1,904
Self-citationSemantics for the Internet of Things: Early Progress and Back to the Future
Barnaghi, P., Wang, W., Henson, C., & Taylor, K. (2012) · International Journal on Semantic Web and Information Systems · doi:10.4018/jswis.2012010101 · Cited by 522
Triple Pattern Fragments: A low-cost knowledge graph interface for the Web
Verborgh, R., Vander Sande, M., Hartig, O., Van Herwegen, J., De Vocht, L., De Meester, B., Haesendonck, G., & Colpaert, P. (2016) · Journal of Web Semantics · doi:10.1016/j.websem.2016.03.003 · Cited by 265
Querying Datasets on the Web with High Availability
Verborgh, R., Hartig, O., De Meester, B., Haesendonck, G., De Vocht, L., Vander Sande, M., Cyganiak, R., Colpaert, P., Mannens, E., & Van de Walle, R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11964-9_12 · Cited by 85
Message Passing for Complex Question Answering over Knowledge Graphs
Vakulenko, S., Fernandez Garcia, J. D., Polleres, A., de Rijke, M., & Cochez, M. (2019) · Proceedings of the 28th ACM International Conference on Information and Knowledge Management · doi:10.1145/3357384.3358026 · Cited by 14
Self-citationBeris, T., & Koubarakis, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93417-4_6 · Cited by 11
Interoperability of Semantically-Enabled Web Services on the WoT: Challenges and Prospects
Bennara, M., Zimmermann, A., Lefrançois, M., & Messalti, N. (2020) · Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services · doi:10.1145/3428757.3429199 · Cited by 3
Symmetry-Aware Knowledge Graph Compression for LLM Grounding via Symbolic Retrieval
Prakash, V., & Dontabhaktuni, J. (2026) · doi:10.2139/ssrn.6826298
Metadata
- Authors
- Fernández, J. D., Martínez-Prieto, M. A., Gutiérrez, C., Polleres, A., & Arias, M.
- Venue
- Journal of Web Semantics
- Publisher
- Elsevier BV
- Published
- 2013-03
- Volume
- 19
- Pages
- 22-41
- ISSN
- 1570-8268 (ISSN-L)
- OpenAlex
- W2013667086
- Cited by
- 316
- References
- 30
- FWCI
- 29.08
- Type
- journal article
- Language
- en
- Open access
- green
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
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.