Pith. sign in

Title resolution pending

2 Pith papers cite this work, alongside 331 external citations. Polarity classification is still indexing.

2 Pith papers citing it
331 external citations · OpenAlex

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Meeting times on graphs in near-cubic time

q-bio.PE · 2026-04-20 · unverdicted · novelty 7.0

An algorithm exploits the near-Sylvester structure of meeting time equations to compute all pairwise expected meeting times on graphs in O(N^4) operations.

citing papers explorer

Showing 2 of 2 citing papers.

  • Understanding Truncated Positional Encodings for Graph Neural Networks cs.LG · 2026-06-11 · unverdicted · none · ref 1

    Truncation causes different positional encoding families to have unequal expressive power in GNNs, with truncated spectral PEs limited to 1-WL strength, and mixing families improves results on real datasets.

  • Meeting times on graphs in near-cubic time q-bio.PE · 2026-04-20 · unverdicted · none · ref 4

    An algorithm exploits the near-Sylvester structure of meeting time equations to compute all pairwise expected meeting times on graphs in O(N^4) operations.