Proof (06Q9) · history · ScalingStacks

Source history

Eugene Gorsky, Paul Wedrich

Original source: arXiv:1904.04481v2

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

The permanent identity and original source provenance are retained below.

{
  "key": "work:W000033:pdf:2e8be60da8417b71df3d08b9bf9d5074e4aafb8be999cd42bac7c89dc9686a21:page:33:bbox:85.08,427.709,538.564,440.471",
  "first_source_version": "1904.04481v2",
  "chapter": "work-w000033",
  "work": "W000033",
  "kind": "Proof",
  "number": "",
  "title": "Proof. We write C := JT (L)Kfr. The key idea of the proof is that annular simpliﬁcation is still possible in",
  "source_version": "1904.04481v2",
  "source": {
    "pdf_sha256": "2e8be60da8417b71df3d08b9bf9d5074e4aafb8be999cd42bac7c89dc9686a21",
    "page": 33,
    "bbox": [
      85.08,
      427.709,
      538.564,
      440.471
    ]
  },
  "target": "/chapters/work-w000033.html",
  "identity_basis": "pinned original PDF hash and exact page/bbox; never display number",
  "status": "active"
}