Pith. sign in

Title resolution pending

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

1 Pith paper citing it

fields

cs.DB 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Triadic First-Order Logic Queries in Temporal Networks

cs.DB · 2025-07-23 · conditional · novelty 7.0

FOLTY is the first algorithm for thresholded FOL triadic motif queries on temporal networks, with O(m α log σ_max) running time matching the best temporal triangle counters.

citing papers explorer

Showing 1 of 1 citing paper.

  • Triadic First-Order Logic Queries in Temporal Networks cs.DB · 2025-07-23 · conditional · none · ref 2

    FOLTY is the first algorithm for thresholded FOL triadic motif queries on temporal networks, with O(m α log σ_max) running time matching the best temporal triangle counters.