Polynomial-time exact ASV computation for rooted trees via topological equivalence classes, plus sampling approximation for arbitrary causal DAGs.
Title resolution pending
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
representative citing papers
Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
Hypergraph modeling of SNNs improves neuron-to-core mapping on neuromorphic hardware by exploiting hyperedge overlap and locality for better partitioning and placement than graph-based methods.
An LLM-based pipeline systematically converts the CLM-ml-v2 Fortran land surface model to JAX, delivering full differentiability, 8x fewer optimization steps, and 24x wall-clock speedup at N=2048 while releasing the code as a reusable framework.
Holos is a five-layer LLM-based multi-agent system architecture using the Nuwa engine for agent generation, a market-driven Orchestrator for coordination, and an endogenous value cycle for incentive-compatible persistence in the Agentic Web.
GraphBench is a comprehensive multi-domain benchmark suite for graph learning with standardized evaluation protocols and baselines from message-passing and transformer models.
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
citing papers explorer
-
GraphBench: Next-generation graph learning benchmarking
GraphBench is a comprehensive multi-domain benchmark suite for graph learning with standardized evaluation protocols and baselines from message-passing and transformer models.