Pith. sign in

Paper Citation Record · LEDGER

Towards Invariance to Node Identifiers in Graph Neural Networks

As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2502.13660.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.13660 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T18:10:42.661583Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-23T19:53:23.437279Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation decc80c5-193d-4961-bbd8-4aaf01e97002 · inbound

How Hard Is It for Message-Passing GNNs to Simulate One Weisfeiler-Lehman Color-Refinement Step? cites this paper.

How Hard Is It for Message-Passing GNNs to Simulate One Weisfeiler-Lehman Color-Refinement Step? Towards Invariance to Node Identifiers in Graph Neural Networks

Reference 8

Resolution
verified exact
arxiv_id, observed 2026-05-23T19:53:23.440227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-05-23T19:48:39.681300Z digest=sha256:519f1d10da3c0f9f38db3e45e945f6f38c7e80db7dd46e438d8f66f31baba1ef

Observation 39082cb2-7242-457c-aef7-9d805df23ec5 · inbound

Future Link Prediction Without Memory or Aggregation cites this paper.

Future Link Prediction Without Memory or Aggregation Towards Invariance to Node Identifiers in Graph Neural Networks

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-07T14:18:36.573294Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:18:36.573294Z digest=sha256:98caaaaebfde0a0285edb3dd2a1f79b05a7d374b5d5bad386cd5b26e0da45255

Observation e6c746dc-c6a5-4079-a867-fb94f91b585b · inbound

Temporal Misgrounding in Legal RAG: A Versioned-Corpus Benchmark for French Tax Law cites this paper.

Temporal Misgrounding in Legal RAG: A Versioned-Corpus Benchmark for French Tax Law Towards Invariance to Node Identifiers in Graph Neural Networks

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-11T18:10:42.661583Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T18:10:42.661583Z digest=sha256:983ff964d29eedd58cf9ee52dd7c5900a4fe77fe146f70b8a5e064d317265ce3