{"paper":{"title":"Algorithmic Reconstruction of the Fiber of Persistent Homology on Cell Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"cs.CG","authors_text":"Gregory Henselman-Petrusek, Jacob Leygonie","submitted_at":"2021-10-27T18:01:05Z","abstract_excerpt":"Let $K$ be a finite simplicial, cubical, delta or CW complex. The persistence map $\\mathrm{PH}$ takes a filter $f:K \\rightarrow \\mathbb{R}$ as input and returns the barcodes $\\mathrm{PH}(f)$ of the associated sublevel set persistent homology modules. We address the inverse problem: given a target barcode $D$, computing the fiber $\\mathrm{PH}^{-1}(D)$. For this, we use the fact that $\\mathrm{PH}^{-1}(D)$ decomposes as complex of polyhedra when $K$ is a simplicial complex, and we generalise this result to arbitrary based chain complexes. We then design and implement a depth first search algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14676","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.14676/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}