Paper Citation Record · LEDGER

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

As of 23 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1908.05268.

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

pith.paper-citation-record.v1
1908.05268 v2

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T13:24:53.037132Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

36 of 36 outbound references displayed

verified exact1
verified fuzzy28
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 428cfc6a-f77f-46bc-99cb-33798a27624f · outbound

This paper cites Corneil, and Andrzej Proskurow ski.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Corneil, and Andrzej Proskurow ski

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.601634Z

Source-reported events for the cited work

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

Observation 7019c09a-5ed7-4ea2-924e-d7000427e3bd · outbound

This paper cites On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties

Reference 2

Resolution: verified exact; local_arxiv, observed 2026-08-14T13:24:53.120712Z

Source-reported events for the cited work

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

Observation 05ebdf26-0551-4da3-9e9a-48ca24e0bc81 · outbound

This paper cites an unresolved cited work.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Unresolved cited work

Reference 3

Resolution: unresolved; raw_fallback, observed 2026-08-14T13:24:53.584661Z

Source-reported events for the cited work

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

Observation 6f8801fa-52f5-438a-be62-d442242de3ac · outbound

This paper cites Graph isomorphism in quasipolynomial tim e [extended abstract].

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Graph isomorphism in quasipolynomial tim e [extended abstract]

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.564980Z

Source-reported events for the cited work

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

Observation 0c560d2f-dfcf-4fb4-85b0-457f8532db05 · outbound

This paper cites Faster canonical forms for strongly regular graphs.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Faster canonical forms for strongly regular graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.549216Z

Source-reported events for the cited work

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

Observation 724edb09-2417-4d79-b371-7eb2447bacb9 · outbound

This paper cites an unresolved cited work.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-14T13:24:53.536497Z

Source-reported events for the cited work

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

Observation 97cb39a4-31a8-43e5-93e8-df284fb04bc3 · outbound

This paper cites Brouwer and Jack H.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Brouwer and Jack H

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.522740Z

Source-reported events for the cited work

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

Observation a4348810-5ed8-47dc-a5a5-234ecacc66b1 · outbound

This paper cites Brouwer and Dale M.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Brouwer and Dale M

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.506961Z

Source-reported events for the cited work

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

Observation 73999d3e-b758-470b-88f3-125249a10a67 · outbound

This paper cites An optimal l ower bound on the number of variables for graph identiﬁcations.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs An optimal l ower bound on the number of variables for graph identiﬁcations

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.488702Z

Source-reported events for the cited work

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

Observation f5f5f74b-9c41-491a-8388-927575403342 · outbound

This paper cites The power of counting log ics on restricted classes of ﬁnite structures.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs The power of counting log ics on restricted classes of ﬁnite structures

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.468475Z

Source-reported events for the cited work

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

Observation 8e9d5acf-558b-4029-b003-95fa8a5812ec · outbound

This paper cites Lovász me ets Weisfeiler and Leman.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Lovász me ets Weisfeiler and Leman

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.452441Z

Source-reported events for the cited work

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

Observation 0ca4e856-b07c-49b7-ae11-41f8edb8e9ff · outbound

This paper cites On the vertex co nnectivity of a relation in an association scheme.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs On the vertex co nnectivity of a relation in an association scheme

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.438716Z

Source-reported events for the cited work

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

Observation f881e3a5-0de9-4794-974a-77017da556df · outbound

This paper cites On the combinatorial power of the weisfei ler-lehman algorithm.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs On the combinatorial power of the weisfei ler-lehman algorithm

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.423777Z

Source-reported events for the cited work

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

Observation 24c6724c-f50d-4145-b210-3e161f952b8c · outbound

This paper cites Fixed-point deﬁnability and polynomial time on graphs with excluded minors.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Fixed-point deﬁnability and polynomial time on graphs with excluded minors

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.412010Z

Source-reported events for the cited work

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

Observation e0d92a92-678c-4343-81e2-4ec1efc06fab · outbound

This paper cites Descriptive Complexity, Canonisation, and Deﬁnable Graph S tructure The- ory.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Descriptive Complexity, Canonisation, and Deﬁnable Graph S tructure The- ory

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.400697Z

Source-reported events for the cited work

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

Observation 264f0951-c211-48a4-b54b-17ba7f1e2fbe · outbound

This paper cites A linear upper bound on t he weisfeiler-leman dimension of graphs of bounded genus.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs A linear upper bound on t he weisfeiler-leman dimension of graphs of bounded genus

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.386366Z

Source-reported events for the cited work

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

Observation 991be5c8-dfed-4c43-933e-7c67a1343fe2 · outbound

This paper cites Deﬁnability and descri ptive complexity on databases of bounded tree-width.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Deﬁnability and descri ptive complexity on databases of bounded tree-width

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.370607Z

Source-reported events for the cited work

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

Observation 9d63f364-e7ac-4c45-8fc8-5dedd3ef82e3 · outbound

This paper cites Canonisation and deﬁnab ility for graphs of bounded rank width.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Canonisation and deﬁnab ility for graphs of bounded rank width

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.356197Z

Source-reported events for the cited work

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

Observation 11f8eadf-706f-4190-9c1c-5b598b19ebd8 · outbound

This paper cites Pebble games and linear eq uations.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Pebble games and linear eq uations

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.342541Z

Source-reported events for the cited work

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

Observation 0497ba19-7630-4353-9feb-ae8d8e9245a9 · outbound

This paper cites Logical hierarchies in PTIME.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Logical hierarchies in PTIME

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.330571Z

Source-reported events for the cited work

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

Observation 404c2574-8168-4f80-b2e8-cd469d13a376 · outbound

This paper cites Hopcroft and Robert Endre Tarjan.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Hopcroft and Robert Endre Tarjan

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.314681Z

Source-reported events for the cited work

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

Observation 519e1832-737b-48ed-900c-6fc16c016d5f · outbound

This paper cites Hopcroft and Robert Endre Tarjan.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Hopcroft and Robert Endre Tarjan

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.301921Z

Source-reported events for the cited work

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

Observation 7cf5b1a2-c019-4c38-852f-4379b127f807 · outbound

This paper cites Hopcroft and Robert Endre Tarjan.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Hopcroft and Robert Endre Tarjan

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.287381Z

Source-reported events for the cited work

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

Observation 6957bfc1-79ae-4345-baec-2053f562594d · outbound

This paper cites Hopcroft and Robert Endre Tarjan.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Hopcroft and Robert Endre Tarjan

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.274644Z

Source-reported events for the cited work

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

Observation fe09a306-c03f-4286-b32e-87e54e239989 · outbound

This paper cites Hopcroft and J.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Hopcroft and J

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.261128Z

Source-reported events for the cited work

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

Observation 10a33e15-ab1d-4b5b-997c-c19c0d202b21 · outbound

This paper cites Describing Graphs: A First-Order Approach to Graph Canonization, pages 59–81.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Describing Graphs: A First-Order Approach to Graph Canonization, pages 59–81

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.246584Z

Source-reported events for the cited work

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

Observation bf65c8a5-b797-40f8-85b0-ec86aa8009f9 · outbound

This paper cites The Weisfeiler-Leman dimension of planar graphs is at most 3.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs The Weisfeiler-Leman dimension of planar graphs is at most 3

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.232149Z

Source-reported events for the cited work

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

Observation eda61667-adb5-49f2-addc-85e3f0c7804f · outbound

This paper cites Treewidth, Computations and Approximations , volume 842 of Lecture Notes in Computer Science.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Treewidth, Computations and Approximations , volume 842 of Lecture Notes in Computer Science

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-14T13:24:53.003351Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c90f913-7997-4ce4-8a10-b2b3cc4a98d9 · outbound

This paper cites Kodalen and William J.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Kodalen and William J

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.210737Z

Source-reported events for the cited work

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

Observation 56f6bda7-e1b8-4ae4-a211-66235d5f35ee · outbound

This paper cites an unresolved cited work.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Unresolved cited work

Reference 30

Resolution: unresolved; raw_fallback, observed 2026-08-14T13:24:53.198682Z

Source-reported events for the cited work

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

Observation 638b86e1-bcb2-41a1-af05-25cd7fc3507e · outbound

This paper cites McKay and Adolfo Piperno.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs McKay and Adolfo Piperno

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.185548Z

Source-reported events for the cited work

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

Observation d3c14b3d-f194-46b5-963b-fba40d7b0075 · outbound

This paper cites Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings

Reference 32

Resolution: metadata mismatch; local_arxiv, observed 2026-08-14T13:24:53.099336Z

Source-reported events for the cited work

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

Observation 141c721e-a9ba-4172-abdf-50745f187f39 · outbound

This paper cites Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-14T13:24:53.024417Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f075e3e-4f85-407c-afd3-ec9133f8b587 · outbound

This paper cites Graph isomorphism for unit square graphs.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Graph isomorphism for unit square graphs

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.168399Z

Source-reported events for the cited work

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

Observation 40ab9fe9-8814-49b6-9f3e-f1cce103a579 · outbound

This paper cites an unresolved cited work.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Unresolved cited work

Reference 35

Resolution: unresolved; raw_fallback, observed 2026-08-14T13:24:53.152354Z

Source-reported events for the cited work

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

Observation 4a960e79-d268-4f14-bac7-29769310485d · outbound

This paper cites The reduction of a gr aph to canonical form and the algebra which appears therein.

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs The reduction of a gr aph to canonical form and the algebra which appears therein

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T13:24:53.138509Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.