Pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.LG 1

years

2025 1

verdicts

REJECT 1

representative citing papers

Unsupervised Learning for the Elementary Shortest Path Problem

cs.LG · 2025-08-03 · reject · novelty 6.0

The authors propose ESPP-NNAA, an unsupervised GNN that learns node values and edge probabilities to decode near-optimal elementary paths, though the stated certificate does not cover the full trained objective.

citing papers explorer

Showing 1 of 1 citing paper.

  • Unsupervised Learning for the Elementary Shortest Path Problem cs.LG · 2025-08-03 · reject · none · ref 7

    The authors propose ESPP-NNAA, an unsupervised GNN that learns node values and edge probabilities to decode near-optimal elementary paths, though the stated certificate does not cover the full trained objective.