Recipe:propagate_embeddings · Theory: graph signal processing — low-pass filtering on the graph (Stanković et al. 2020, Part II) = SGC/APPNP decoupled propagation · Rail: measurement (does propagation help retrieval?).
Tier 01 produced raw text embeddings. Tier 02 propagates them over the declared citation graph — smoothing each paper’s vector toward its neighbours’. In graph-signal-processing terms this is a low-pass filter on the graph: it attenuates the high-frequency component (idiosyncratic per-paper noise) and keeps the low-frequency component (the shared topic signal a citation cluster agrees on).
raw embedding rows: 4000
propagated embedding rows: 4000
same dimension preserved: True
5.1 The measurement rail: propagation as a denoiser
The honest test of a low-pass filter is whether it improves a downstream measurement. We compare same-subject retrieval recall@10 before and after propagation. Both numbers were measured by the keystone on the GPU server (search over each embedding table) and frozen; the delta is the denoising gain.
5.2 Bridge note (a signature chapter — deepened in the bridge chapters)
Propagation = one low-pass graph filter = one SGC/APPNP layer = the vector-agg over neighbours. One equation, three names, one propagate_embeddings call — and the weighting knob is the method choice:
weighting="uniform" = the random-walk operator \(\tilde{D}^{-1}\tilde{A}\) (SGC-flavoured, Wu et al. 2019);
weighting="degree_normalized" + alpha = symmetric-normalized propagation with a teleport restart, \((1-\alpha)\hat{A}\,H + \alpha\,X^{(0)}\) — this is APPNP (Gasteiger/Klicpera et al. 2019), which the keystone used;
output="jumping_knowledge" = concatenating the signal at every hop.
The propagation is deterministic by construction — a fixed (group, neighbour) f64 fold order, byte-identical across threads, no seeding — so it is the reproducible point on the construct→learn spectrum.
6 Air Routes — propagation over the route graph
The same low-pass filter runs on Air Routes. The keystone propagated the raw airport embeddings over the declared route graph (the airport↔︎airport flight network) and committed the result; here we read it and measure whether smoothing a node toward its flight-neighbours improves a label-target retrieval.
Neptune-contrast. Neptune Analytics ships pageRank/degree/wcc as CALLs over the Air Routes graph; here, propagation-as-low-pass-filter is a Jammi recipe — the same operation over the same route graph, expressed as substrate computation.
raw airport embedding rows: 3504
propagated airport embedding rows: 3504
same dimension preserved: True
6.1 The measurement rail: raw → propagated
The honest test is a downstream measurement. We compare same-continent retrieval recall@10 before and after propagation. The relevance target is the continent label — independent of the embedding similarity — so a gain is a real denoising result. Continent is near-solved by lat/lon, so this is honestly a teaching label, not a literature benchmark; but the raw→propagated delta over it is a legitimate measured number.
This is where the Air Routes on-ramp stops (tier 02). Its text is too thin and its label too near-deterministic for a credible learn/predict tier — those live on the ogbn-arxiv keystone above. The on-ramp’s job is done: two graphs constructed and contrasted, a low-pass filter measured, and the tenancy rail made vivid.