Alphabeta MathDefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite simple undirected graphs with vertex labels
Definition
Fix a set of labels . A finite vertex-labeled simple undirected graph is a triple in which is a finite set of vertices, is a set of two-element subsets of , and assigns a label to each vertex. Its neighborhood at is . Thus edges have no orientation, loops, or multiplicity. Graphs compared in one labeled-graph statement use the same label set .
Used by
- Finite-depth message-passing forward pass Algorithm
- Aggregation-based message-passing graph neural networks Definition
- Finite-round one-dimensional Weisfeiler–Leman color refinement Definition
- Label-preserving graph isomorphisms Definition
- A six-cycle and two disjoint triangles are regular but one-WL-indistinguishable Example
- One-dimensional Weisfeiler–Leman refinement is invariant under graph isomorphism Lemma
- Injective message passing matches the one-dimensional Weisfeiler–Leman test Theorem
- Message-passing GNNs cannot distinguish beyond one-dimensional Weisfeiler–Leman Theorem
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka, How Powerful are Graph Neural Networks? (standard reference, not scraped)
- Christopher Morris et al., Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks (standard reference, not scraped)
- Pan Li and Jure Leskovec, Graph Representation Learning (standard reference, not scraped)