{
 "artifacts": null,
 "category": "geometry",
 "description": "Replace a globally signed classifier by local logits connected through learnable plus-or-minus-one transports on the data graph. The model can represent XOR-like or periodic labelings that are inconsistent with any globally continuous sign function, while an explicit cycle penalty prevents arbitrary edge-sign memorization.",
 "formulas_latex": [
  "$$\\eta_x:=\\mathcal{C}^{\\prime}([\\gamma_x])\\cdot\\mathcal{C}([\\gamma_x])^{-1}$$",
  "$$\\mathcal{C}^{\\prime}([\\delta])=\\eta_y\\cdot\\mathcal{C}([\\delta])\\cdot\\eta_x^{-1}$$",
  "$$m_\\gamma:=\\prod_{r=0}^{L-1}s_{i_ri_{r+1}}\\in\\{\\pm1\\},\\qquad s'_{ij}=g_j s_{ij}g_i^{-1},\\quad g_i\\in\\{\\pm1\\}$$",
  "$$\\mathcal{L}=\\mathcal{L}_{\\mathrm{CE}}(\\sigma(z_i),y_i)+\\lambda_{\\mathrm{cov}}\\sum_{(i,j)\\in E}w_{ij}(z_j-s_{ij}z_i)^2+\\lambda_{\\mathrm{cycle}}\\sum_{\\gamma\\in\\mathcal{B}}(1-m_\\gamma)^2$$"
 ],
 "id": 316,
 "implementation": "Integrate this as a classification head on top of a graph neural network, point-cloud network, or transformer whose tokens have known adjacency and periodic identifications. First construct a sparse graph G=(V,E) using k-nearest neighbors or known grid edges, retain edge weights w_ij, and compute a cycle basis B from a spanning tree plus one cycle for each non-tree edge. The backbone produces scalar logits z_i=h_theta(x_i). Add one trainable scalar a_ij=a_ji per undirected edge and define a differentiable transport s_ij=tanh(alpha*a_ij), or use sign(a_ij) with a straight-through estimator. For every labeled node, apply ordinary cross-entropy to sigmoid(z_i). Add the covariant smoothness term w_ij*(z_j-s_ij*z_i)^2. For each basis cycle, compute m_gamma as the product of its edge transports and add the cycle penalty (1-m_gamma)^2. To avoid the trivial solution s_ij approximately zero, increase alpha during training or add lambda_s*(1-s_ij^2)^2. The graph transport is the learned discrete connection; cycle products are computed exactly from current edge parameters, while the cycle basis is computed once. First test on a 2D torus grid with XOR labels at 4, 16, and 100 labeled points, comparing an MLP, ordinary GNN, and this head. Success means lower test error at fixed labels and stable learned cycle parity, especially when the ordinary MLP violates periodic identification.",
 "math_summary": "The paper identifies binary label systems with functors \\(\\mathcal{C}:\\Pi_1(M)\\to B(\\mathbb{Z}_2)\\), whose equivalence classes are classified by \\(\\mathrm{Hom}(\\pi_1(M,x_0),\\mathbb{Z}_2)\\). Given two functors \\(\\mathcal{C},\\mathcal{C}'\\) with the same monodromy, the paper constructs the natural isomorphism \\(\\eta_x:=\\mathcal{C}'([\\gamma_x])\\mathcal{C}([\\gamma_x])^{-1}\\), and for a path \\(\\delta:x\\to y\\) proves \\(\\mathcal{C}'([\\delta])=\\eta_y\\mathcal{C}([\\delta])\\eta_x^{-1}\\). Here \\(\\gamma_x\\) is a reference path from a base point to \\(x\\), \\(\\mathcal{C}([\\delta])\\in\\{\\pm1\\}\\) is transport along the path, and \\(\\eta_x\\in\\{\\pm1\\}\\) is a local gauge change. Adapt this to a graph with edge transport \\(s_{ij}\\in\\{\\pm1\\}\\): a node logit \\(z_i\\) is covariantly smooth when \\(z_j\\approx s_{ij}z_i\\). The monodromy on a cycle \\(\\gamma=(i_0,i_1,\\ldots,i_L=i_0)\\) is \\(\\prod_{r=0}^{L-1}s_{i_ri_{r+1}}\\), which is gauge-invariant because vertex sign changes \\(g_i\\) transform \\(s_{ij}\\) to \\(g_js_{ij}g_i^{-1}\\).",
 "math_tags": [
  "topology",
  "algebraic-topology",
  "geometry"
 ],
 "ml_areas": [
  "graph-nn",
  "loss",
  "embedding",
  "generalization"
 ],
 "paper": {
  "arxiv_id": "2607.00999",
  "arxiv_url": "https://arxiv.org/abs/2607.00999",
  "summary_what_math_gives_to_ml": "The paper provides a concrete way to treat binary labels as sections of a possibly twisted Z2 bundle rather than as a globally defined sign function. Its transferable asset is the separation between local label compatibility and global monodromy: cycle products can encode unavoidable parity obstructions on periodic or graph-structured data, while gauge-equivalent choices of reference paths represent the same classifier. A practical neural implementation is a topology-aware graph or sequence head that learns binary edge transports and predicts logits in a twisted local frame, with explicit cycle-consistency and covariant-smoothness losses. A second, more exploratory transfer is to interpret antisymmetric attention interactions as a discrete curvature and regularize their Yang-Mills energy.",
  "title": "Yang-Mills-Higgs: A Geometric Theory of Binary Labels on Non-Contractible Spaces",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 7,
  "usefulness": 7
 },
 "solves": [
  "accuracy",
  "generalization",
  "sample-efficiency"
 ],
 "title": "Twisted Z2 classifier on graph cycles",
 "url": "https://synthcore.org/idea/316/twisted-z2-classifier-on-graph-cycles",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}