ScalingStacks

Lemma 5.23 (06FC)

Source history

Ben Elias, Geordie Williamson

Original source: arXiv:1309.0865v1

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

The permanent identity and original source provenance are retained below.

{
  "key": "work:W000027:pdf:e610a4fa938a7cc9fbe349fb60cea9118a492064b62bfd59ad18951fff491ade:page:52:bbox:85.08,174.371,507.829,195.077",
  "first_source_version": "1309.0865v1",
  "chapter": "work-w000027",
  "work": "W000027",
  "kind": "Lemma",
  "number": "5.23",
  "title": "Lemma 5.23. Every morphism in Kar(DQ) is a linear combination of graphs for which:",
  "source_version": "1309.0865v1",
  "source": {
    "pdf_sha256": "e610a4fa938a7cc9fbe349fb60cea9118a492064b62bfd59ad18951fff491ade",
    "page": 52,
    "bbox": [
      85.08,
      174.371,
      507.829,
      195.077
    ]
  },
  "target": "/chapters/work-w000027.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.