arXiv (All)
open access
Graph Representation via Elements of Discrete Morse and Cobordism Theories
Topology is, by its nature and design, suited to structure that is nonlinear, multiscale, and nonstationary - however, within machine learning, its use remains largely confined to topological data analysis. We advocate that tools from low-dimensional topology which have remained almost exclusively c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Topological Semantics for Scoped Computational Paths#610022
- Topological Semantics for Scoped Computational Paths#608960
- The untangling number of 3-periodic tangles#1122916
- Scalable and Expressive Graph Representation Learning with Temporal, Structural, and Zero-Shot Capabilities#1071576
- A Network Science Perspective on Evaluating Deep Graph Generative Models#821005
Record · ID 1157208
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive