A standardized pipeline converts time series to graphs, computes persistence diagrams, and extracts features that classify UCR benchmarks, with diffusion distance outperforming shortest-path metrics and performance varying by graph type.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Quantum teleportation using noisy top-quark pairs stays above the classical fidelity threshold of 2/3.
citing papers explorer
-
Persistent Homology of Time Series through Complex Networks
A standardized pipeline converts time series to graphs, computes persistence diagrams, and extracts features that classify UCR benchmarks, with diffusion distance outperforming shortest-path metrics and performance varying by graph type.
-
Characterizing quantum correlations and quantum teleportation in $gg \to t\bar{t}$ and $q\bar{q} \to t\bar{t}$ processes under noisy channels
Quantum teleportation using noisy top-quark pairs stays above the classical fidelity threshold of 2/3.