Collected molecules will appear here. Add from search or explore.
Provides a reference implementation for learning latent representations of nodes in dynamic graphs across time snapshots, specifically for temporal network embedding (TNE).
Defensibility
stars
64
forks
17
The project is a decade-old academic reference implementation for temporal network embedding. While it has a respectable 64 stars, the velocity is zero, indicating it is essentially a 'frozen' artifact of a specific research paper. In the modern landscape, this has been largely superseded by comprehensive graph learning frameworks like PyTorch Geometric (PyG) and Deep Graph Library (DGL), which offer more efficient and modular implementations of dynamic graph algorithms (e.g., TGNs, DySAT). The defensibility is near-zero as the codebase is likely written in Python 2 or early Python 3, lacks modern optimization, and does not have an active maintainer community. For a technical investor, this represents legacy research rather than a viable production tool. The risk from frontier labs is low only because the specific niche is too narrow for them to care about directly, but the broader capability of 'temporal graph reasoning' is already being absorbed into large-scale multimodal and graph-foundation models.
TECH STACK
INTEGRATION
reference_implementation
READINESS