Research map / Graph learning / Graph algorithms and clustering
Modeling Transitivity and Cyclicity in Directed Graphs via Binary Code Box Embeddings
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Learning Representations for Hierarchies with Minimal Support (NeurIPS 2024 · similarity 0.88)
- DUPLEX: Dual GAT for Complex Embedding of Directed Graphs (ICML 2024 · similarity 0.87)
- Weighted Embeddings for Low-Dimensional Graph Representation (AAAI 2025 · similarity 0.86)
- The Generalized Skew Spectrum of Graphs (ICML 2025 · similarity 0.86)
- iN2V: Bringing Transductive Node Embeddings to Inductive Graphs (ICML 2025 · similarity 0.86)
- ReGCL: Rethinking Message Passing in Graph Contrastive Learning (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.