Proof (09QN) · history · ScalingStacks

Source history

David Gepner, Moritz Groth, Thomas Nikolaus

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

The permanent identity and original source provenance are retained below.

{
  "key": "work:W000028:pdf:784dc6ddd5ac5c9481c1b3f5a19a1fea687715649ceaf1ef93dd80c99ea0f43e:page:25:bbox:72.001,589.203,539.983,603.811",
  "first_source_version": "1305.4550v1",
  "chapter": "work-w000028",
  "work": "W000028",
  "kind": "Proof",
  "number": "",
  "title": "Proof. Since the forgetful functor ModTM (S) →S preserves sifted colimits (see Proposition B.4), we see",
  "source_version": "1305.4550v1",
  "source": {
    "pdf_sha256": "784dc6ddd5ac5c9481c1b3f5a19a1fea687715649ceaf1ef93dd80c99ea0f43e",
    "page": 25,
    "bbox": [
      72.001,
      589.203,
      539.983,
      603.811
    ]
  },
  "target": "/chapters/work-w000028.html",
  "identity_basis": "pinned original PDF hash and exact page/bbox; never display number",
  "status": "active"
}