pith:NZ4OOK6H
At Most Two Infinite Blue Clusters in the CMR Representation of the Edwards-Anderson Spin Glass
The blue subgraph in the two-replica CMR representation of the Edwards-Anderson spin glass has at most two infinite connected components.
arxiv:2605.17338 v1 · 2026-05-17 · cond-mat.dis-nn · math-ph · math.MP
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{NZ4OOK6HEWZMQXFFZQA4SGR6KE}
Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge
Record completeness
Claims
For any translation-invariant joint Gibbs measure on disorder, two spin replicas, and CMR bond variables on Z^d, the blue subgraph contains at most two infinite connected components; if two exist, then they lie in a common infinite grey cluster and belong to opposite overlap-parity classes.
The blue-bond process lacks insertion tolerance and positive association, so the proof must rely on the full joint measure together with a finite-box merge operation and the mass-transport bound on ends of translation-invariant subgraphs rather than standard Burton-Keane or random-cluster arguments (abstract, paragraph on main obstacle).
Proves that the blue subgraph in the CMR representation of the short-range Edwards-Anderson model has at most two infinite clusters, which must lie in one grey cluster with opposite overlap parity if both are infinite.
References
Formal links
Receipt and verification
| First computed | 2026-05-20T00:03:52.964425Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
6e78e72bc725b2c85ca5cc01c91a3e5132aa2eff1b9f94e669fe4f4eccea9ee9
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/NZ4OOK6HEWZMQXFFZQA4SGR6KE \
| jq -c '.canonical_record' \
| python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 6e78e72bc725b2c85ca5cc01c91a3e5132aa2eff1b9f94e669fe4f4eccea9ee9
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "47bd3e21ac064883749f980709cda171fbd6a381c74c68875dde26f7090815b5",
"cross_cats_sorted": [
"math-ph",
"math.MP"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cond-mat.dis-nn",
"submitted_at": "2026-05-17T09:15:39Z",
"title_canon_sha256": "f778baab8c051b7ff29fb83fcb3d76e4f34e28b748f21b690294047683af7a1b"
},
"schema_version": "1.0",
"source": {
"id": "2605.17338",
"kind": "arxiv",
"version": 1
}
}