Disentangled Graph Recurrent Network for Document Ranking
Research article (Data Science and Engineering, 2022) · cited 12× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ Disentangled Graph Recurrent Network for Document Ranking — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 Cite this page
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA
4ort.xyz Knowledge Graph. (2026). Disentangled Graph Recurrent Network for Document Ranking. Retrieved May 24, 2026, from https://4ort.xyz/entity/disentangled-graph-recurrent-network-for-document-ranking
MLA
“Disentangled Graph Recurrent Network for Document Ranking.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/disentangled-graph-recurrent-network-for-document-ranking.
BibTeX
@misc{4ortxyz_disentangled-graph-recurrent-network-for-document-ranking_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Disentangled Graph Recurrent Network for Document Ranking}}, year = {2026}, url = {https://4ort.xyz/entity/disentangled-graph-recurrent-network-for-document-ranking}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Disentangled Graph Recurrent Network for Document Ranking — https://4ort.xyz/entity/disentangled-graph-recurrent-network-for-document-ranking (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/disentangled-graph-recurrent-network-for-document-ranking · Last refreshed: