Preserving Discrete Morse-Smale Complexes in Error-Bounded Lossy Compression
Pith reviewed 2026-05-23 19:54 UTC · model grok-4.3
The pith
Error-bounded lossy compression preserves full Morse-Smale complexes through iterative quantized edits.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The authors extend an earlier edit-based approach that preserved only segmentations to the full discrete Morse-Smale complex by producing quantized edits that are applied iteratively to the decompressed field; each iteration alternates between correcting critical points and reconnecting them via separatrices, ensuring 100 percent preservation of the complex while the pointwise error never exceeds the prescribed tolerance.
What carries the argument
Iterative editing strategy that alternates between critical-point correction and separatrix restoration on the decompressed output of a base compressor.
If this is right
- Any error-bounded compressor such as SZ3 or ZFP can be post-processed to output fields whose MSCs are identical to the originals.
- The same workflow works for both two- and three-dimensional scalar fields from scientific simulations.
- Users can choose among several operating modes that trade compression ratio against the amount of topological correction performed.
- GPU parallelization accelerates every stage of edit generation and application.
Where Pith is reading between the lines
- The approach could be inserted directly into existing compression libraries so that downstream topology tools receive correct MSCs without any extra user intervention.
- If the iteration count remains small in practice, the method may become suitable for in-situ compression pipelines where latency matters.
- The same alternating-correction idea might apply to other topological descriptors such as Reeb graphs or contour trees once suitable edit operators are defined.
Load-bearing premise
The editing process can always reach exact MSC preservation without ever pushing any data value outside the allowed error bound and will stop after a finite number of steps.
What would settle it
A scalar field for which repeated edits within the error bound still leave at least one critical point or separatrix mismatched after every possible finite sequence of corrections.
read the original abstract
Scientific applications are generating unprecedented volumes of data that overwhelm storage and transmission systems, posing significant challenges for the design of data management tools and scientific databases. Lossy compression has emerged as a promising strategy to address this problem, but most existing compressors fail to preserve the topology of scientific data, leading to inaccuracies in downstream analyses and potentially erroneous scientific conclusions. In this work, we present a methodology for fully preserving the topology, specifically, Morse-Smale complexes (MSCs), in lossy-compressed 2D and 3D scalar field data from scientific simulations. We generalize the edit-based strategy introduced in MSz (a previous method that preserves only segmentations and cannot preserve saddles or separatrices) by extending the framework to the full MSCs, including all critical points and separatrices. Our approach corrects the MSCs in the decompressed output of any error-bounded lossy compressor (e.g., SZ3 or ZFP), referred to as the base compressor, using an iterative editing strategy that preserves all critical points and their connectivity via separatrices. During compression, we generate a sequence of quantized edits that are applied to the decompressed output, ensuring accurate preservation of topological features while maintaining the error within prescribed bounds. The strategy iteratively fixes critical points and separatrices in alternating steps until convergence is achieved in a finite number of iterations. To meet diverse application needs, our method offers flexible options that balance compression efficiency with feature preservation. To reduce computation time, we leverage GPU parallelism to accelerate each component of the workflow. Experiments on multiple datasets demonstrate that our method achieves 100% preservation of Morse-Smale complexes.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proposes a method to preserve full discrete Morse-Smale complexes (critical points and separatrices) in error-bounded lossy compression of 2D and 3D scalar fields. It generalizes the prior MSz edit-based approach by applying an iterative sequence of quantized edits to the decompressed output of any base compressor (e.g., SZ3, ZFP) until all MSCs are restored, claiming that this always converges in finite iterations while respecting the user-specified error bound and achieving 100% preservation on tested datasets.
Significance. If the preservation guarantee holds, the work would address a practical limitation of existing lossy compressors for topology-sensitive scientific analysis. The GPU-parallel implementation and flexible trade-off options are noted as implementation strengths, but the absence of any parameter-free derivation or machine-checked component limits the assessed novelty relative to prior edit-based methods.
major comments (1)
- [Abstract] Abstract: the 100% preservation claim rests on the assertion that an iterative editing sequence can always restore MSCs while remaining inside the prescribed error bound, yet the text supplies no argument that a correcting edit of admissible magnitude is guaranteed to exist (for instance when two critical points lie closer than the tolerance or the base compressor has already used nearly the full bound). This assumption is load-bearing for the central claim.
minor comments (2)
- [Abstract] Abstract: the phrase 'flexible options that balance compression efficiency with feature preservation' is stated without enumerating the options or their quantitative effects on rate-distortion or topology metrics.
- [Abstract] Abstract: the statement that edits are 'quantized' is introduced without specifying the quantization scheme or how it interacts with the error bound.
Simulated Author's Rebuttal
We thank the referee for the careful review and the identification of this important point regarding the central claim. We respond to the major comment below.
read point-by-point responses
-
Referee: [Abstract] Abstract: the 100% preservation claim rests on the assertion that an iterative editing sequence can always restore MSCs while remaining inside the prescribed error bound, yet the text supplies no argument that a correcting edit of admissible magnitude is guaranteed to exist (for instance when two critical points lie closer than the tolerance or the base compressor has already used nearly the full bound). This assumption is load-bearing for the central claim.
Authors: We agree that the abstract, as written, asserts convergence in finite iterations and 100% preservation without supplying a formal argument that an admissible correcting edit is always guaranteed to exist. The method constructs each edit to lie inside the user-specified error bound and alternates between critical-point and separatrix corrections, but this does not constitute a proof that a suitable edit of admissible magnitude will exist in every configuration (e.g., when critical points are separated by less than the bound or when the base compressor has already exhausted most of the allowed error). The reported 100% success is empirical, obtained on the evaluated datasets. We will revise the abstract to state that 100% preservation is demonstrated on the tested data and will add a limitations paragraph discussing the conditions under which the iterative process is guaranteed to succeed versus cases where it may fail to find an admissible edit. revision: yes
Circularity Check
No circularity; method is an independent editing procedure validated empirically
full rationale
The abstract describes a generalization of an edit-based strategy from prior work (MSz) applied to outputs of existing base compressors (SZ3, ZFP). The 100% MSC preservation claim is presented as an experimental outcome on multiple datasets rather than a derived result from equations or self-referential fitting. No self-definitional steps, fitted inputs renamed as predictions, or load-bearing self-citations that reduce the central claim to its own inputs appear. The iterative editing process is described as an external correction mechanism with finite convergence asserted but not derived circularly from the method itself.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Error-bounded lossy compressors produce outputs that can be corrected via edits without violating bounds
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.