Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2501.06444.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T23:19:45.980222Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-23T19:53:23.447374Z
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 5f066297-9c76-4c6e-bd0a-aa47e1b5ac99 · 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? On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
Reference 43
- Resolution
- verified exact
- arxiv_id, observed 2026-05-23T19:53:23.450589Z
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.
Observation 96fb51ff-ae44-424a-92cf-5426d0060f35 · inbound
Curse of Attention: A Kernel-Based Perspective for Why Transformers Fail to Generalize on Time Series Forecasting and Beyond cites this paper.
Curse of Attention: A Kernel-Based Perspective for Why Transformers Fail to Generalize on Time Series Forecasting and Beyond On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
Reference 82
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T20:09:35.075009Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2f77fe46-3262-4442-b6e3-590b9452e82f · inbound
The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity cites this paper.
The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
Reference 71
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T20:02:09.569758Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 55da20f0-c4d9-43a2-8989-4d58de06a12e · inbound
Rethinking Addressing in Language Models via Contexualized Equivariant Positional Encoding cites this paper.
Rethinking Addressing in Language Models via Contexualized Equivariant Positional Encoding On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
Reference 64
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T22:49:44.897392Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1605ebe5-d8cc-44af-9dc0-e709c90d5226 · inbound
High-Order Matching for One-Step Shortcut Diffusion Models cites this paper.
High-Order Matching for One-Step Shortcut Diffusion Models On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
Reference 38
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T18:10:53.122340Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1ebc143a-4690-4b2d-8d98-764c8624b273 · inbound
Universal Approximation of Visual Autoregressive Transformers cites this paper.
Universal Approximation of Visual Autoregressive Transformers On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
Reference 36
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T16:39:14.214668Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3ce2210d-bba0-4c29-af49-5cb70a629055 · inbound
T2VTextBench: A Human Evaluation Benchmark for Textual Control in Video Generation Models cites this paper.
T2VTextBench: A Human Evaluation Benchmark for Textual Control in Video Generation Models On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T23:19:45.980222Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 15190e46-7116-43bb-bada-dbb6eb711a62 · inbound
Minimalist Softmax Attention Provably Learns Constrained Boolean Functions cites this paper.
Minimalist Softmax Attention Provably Learns Constrained Boolean Functions On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
Reference 18
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T14:21:01.419305Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.