MétaCan
Menu
Back to cohort
Record W4416076278 · doi:10.48550/arxiv.2506.04864

Is Crane--Yetter fully extended?

2025· preprint· en· W4416076278 on OpenAlexfundno aff
Luuk Stehouwer

Bibliographic record

VenueArXiv.org · 2025
Typepreprint
Languageen
FieldMathematics
TopicHomotopy and Cohomology in Algebraic Topology
Canadian institutionsnot available
FundersDalhousie University
KeywordsHomotopyTopological quantum field theoryInvertible matrixEquivalence (formal languages)Quantum field theoryTensor (intrinsic definition)Equivalence relationField (mathematics)Fusion rules

Abstract

fetched live from OpenAlex

We revisit the question of whether the Crane-Yetter topological quantum field theory (TQFT) associated to a modular tensor category admits a fully extended refinement. More specifically, we use tools from stable homotopy theory to classify extensions of invertible four-dimensional TQFTs to theories valued in symmetric monoidal 4-categories whose Picard spectrum has nontrivial homotopy only in degrees 0 and 4. We show that such extensions are classified by two pieces of data: an equivalence class of an invertible object in the target and a sixth root of unity. Applying this result to the 4-category $\mathbf{BrFus}$ of braided fusion categories, we find that there are infinitely many equivalence classes of fully extended invertible TQFTs reproducing the Crane-Yetter partition function on top-dimensional manifolds, parametrized by a $\mathbb{Z}/6$-extension of the Witt group of nondegenerate braided fusion categories. This analysis clarifies common claims in the literature and raises the question of how to naturally pick out the $SO(4)$-fixed point data on the framed TQFT which assigns the input braided fusion category to the point so that it selects the Crane-Yetter state-sum.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.008
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.073
GPT teacher head0.349
Teacher spread0.276 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueArXiv.orgSame topicHomotopy and Cohomology in Algebraic TopologyFrench-language works237,207