ScalingStacks

Corollary 4.21 (067D)

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:41:bbox:85.079,667.272,527.019,679.56",
  "first_source_version": "0902.4700v2",
  "chapter": "work-w000021",
  "work": "W000021",
  "kind": "Corollary",
  "number": "4.21",
  "title": "Corollary 4.21. Any graph whose boundary has at most one line of each color can be",
  "source_version": "0902.4700v2",
  "source": {
    "pdf_sha256": "228732489e11791f18f4fa47949b10efd22754e9ac1e1b19358cda89f6ac2071",
    "page": 41,
    "bbox": [
      85.079,
      667.272,
      527.019,
      679.56
    ]
  },
  "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.