ScalingStacks

Claim 4.14 (0IYC)

Source history

Ben Elias, Mikhail Khovanov

Original source: arXiv:0902.4700v2

Detailed backend records are private. Public author/source status appears above.

The permanent identity and original source provenance are retained below.

{
  "key": "work:W000021:pdf:228732489e11791f18f4fa47949b10efd22754e9ac1e1b19358cda89f6ac2071:page:39:bbox:85.08,199.353,527.025,211.321",
  "first_source_version": "0902.4700v2",
  "chapter": "work-w000021",
  "work": "W000021",
  "kind": "Claim",
  "number": "4.14",
  "title": "Claim 4.14. Consider diagrams which are disjoint unions of simple trees, with an arbi-",
  "source_version": "0902.4700v2",
  "source": {
    "pdf_sha256": "228732489e11791f18f4fa47949b10efd22754e9ac1e1b19358cda89f6ac2071",
    "page": 39,
    "bbox": [
      85.08,
      199.353,
      527.025,
      211.321
    ]
  },
  "target": "/chapters/work-w000021.html",
  "identity_basis": "pinned original PDF hash and exact page/bbox; never display number",
  "status": "active"
}

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.