{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreide6brl5dsvxjkfcx2lsa2fav47m35cs6aldqr6sl4hytuj5j6uva",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mnkrfurtvof2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2606.06310v1",
  "publishedAt": "2026-06-05T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Chris Kapulkin",
    "Nathan Kershaw"
  ],
  "textContent": "**Authors:** Chris Kapulkin, Nathan Kershaw\n\nWe introduce a new algorithm for computing persistent homology of Vietoris--Rips filtrations, which in many cases offers a considerable speedup over the existing implementation of the persistence pairing algorithm. The key innovation, called active enumeration, is made possible by a new theoretical framework of Reduction to Zero Differentials (hence RedZeD) in which to view persistent homology.",
  "title": "RedZeD: Computing persistent homology by Reduction to Zero Differentials"
}