OAI-26 family 133: The computational complexity of Weisfeiler–Leman refinement.
Documentary state: REFERENCE_ONLY. This is an indexed source record, not a reviewed explanatory article or a finding about whether the claim is true.
The question in plain language
The publisher indexes this family under: The computational complexity of Weisfeiler–Leman refinement.
Its exact theorem statement and all hypotheses have not been reconstructed or independently source-audited in this entry.
A small example
No source-checked explanatory example is admitted yet. An example must be checked against the paper's definitions before publication.
What is known
The source collection supplies the manuscripts below. Their presence in an index does not establish that their conclusions are known theorems or that a published proof has been independently validated.
GCL verification state
SOURCE_INDEXED; FAMILY_SEMANTICS_UNREVIEWED; EDITORIAL_REFERENCE_ONLY; NO_CERTIFICATION. A separate corpus-level Lean compilation/axiom replay cannot be assigned to this family without a witnessed declaration-to-family bridge.
What remains
Audit the current manuscript edition, extract its quantified claim, verify a small example and literature context, establish any Lean declaration correspondence and record separate source, semantic and mathematical verdicts. Commission an authored six-section explanation.
Sources and claim boundaries
Source collection: openai/math at pinned revision. GCL source index: MATHFORGE protected snapshot. Programme: OAI-26 #2850.
Indexed manuscripts (4):
- Parity lifts and bounded-treewidth witnesses for Weisfeiler–Leman equivalence —
preprints/Parity-lifts-and-bounded-treewidth-witnesses-for-Weisfeiler-Leman-equivalence-September-25-2026/paper.pdf - The complexity of identifying a graph by Weisfeiler–Leman refinement —
preprints/The-complexity-of-identifying-a-graph-by-Weisfeiler-Leman-refinement-September-25-2026/paper.pdf - Unconditional time lower bounds for Weisfeiler–Leman equivalence —
preprints/Unconditional-time-lower-bounds-for-Weisfeiler-Leman-equivalence-September-25-2026/paper.pdf - Variable-dimension Weisfeiler–Leman equivalence on general and subcubic graphs —
preprints/Variable-dimension-Weisfeiler-Leman-equivalence-on-general-and-subcubic-graphs-September-25-2026/paper.pdf
Boundary: source bibliographic coverage only; no paper-to-Lean semantic equivalence, mathematical correctness, novelty or MATHCERT asserted.