{"id":"510b22ab-ee5d-45f8-909b-1712be810a32","arxiv_id":"2509.10599","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"A backward nullification algorithm proves that any stable voxel model can be fabricated by interleaved additive and subtractive operations.","lead":"This paper presents a planning method that interleaves 3D printing and milling to fabricate voxelized shapes exactly. It plans backwards, shrinking the target shape to nothing, which automatically creates removable supports for overhangs.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The completeness proof for 3D interior cavities depends on an unproven claim that a top-layer boundary voxel can always be made erosion-feasible by ring-wise accretion; the 2D-style argument does not establish 3D tool accessibility through enclosed voids.","rationale":"The reader's weakest assumption identifies the same core issue: the completeness proof for Sec. 3.3 does not rigorously establish 3D tool accessibility in interior cavities. I agree with this assessment. The central claim is a theoretical universality result, and the proof is a sketch whose critical step is illustrated with 2D configurations (Fig. 7) that do not cover the difficult 3D case of interior cavities and narrow access. The paper itself acknowledges practical limitations with chips in enclosed cavities, which points to the same geometric accessibility concern. The implemented algorithm's local stability check and heuristic pre-processing are not proven to preserve the completeness property, and the presented lemmas (4.1 and 4.2) are about the global stability criterion, not about the local replacement. These are correctness risks for the strongest claim, and they are addressable: one can either provide a rigorous proof of the accretion feasibility step (showing that the SM tool can always access the needed ring positions inside cavities of arbitrary width given the five allowed orientations and the conservative tool occupancy sets) or relax the claim to a weaker, more carefully stated theorem and clearly mark the local-check variant as a heuristic. The concrete test I propose would either refute the claim with a small adversarial model or, if the algorithm succeeds, provide strong empirical support. Given that the paper's practical validation is substantial (scalable results, physical experiments, and open-source code on 100 Thingi10K models), the verdict should remain CONDITIONAL rather than REJECT or UNVERDICTED: the concern is real but potentially patchable with a tightened proof or a narrowed theorem statement.","tokens_in":19220,"tokens_out":2417,"duration_ms":18852,"concrete_test":"Construct a minimal 3D counterexample and test the completeness proof directly: take a model that is a closed hollow box, e.g., a 20x20x20 voxel cube with a 6x6x10 interior cavity open to the outside only through a small top opening of 2x2 voxels (so the cavity is not a closed void but has a narrow mouth). Run the nullification algorithm (with standard global stability check and L=2) on this model. If the algorithm terminates with an empty model, the test is inconclusive; if it fails to nullify the model (gets stuck at a non-erosion-feasible boundary voxel at the top of the inner cavity wall), the completeness claim is refuted. Additionally, instrument the algorithm to record, for each attempted accretion inside the cavity, whether the corresponding SM tool occupancy set T_S is collision-free; if any required accretion is infeasible, the proof's ring-wise accretion assertion fails.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper's central claim is the theoretical completeness result in Sec. 3.3: every stable voxel model can be nullified by the algorithm, hence fabricated exactly. The proof's load-bearing step is the assertion that any boundary voxel on the topmost layer can be made erosion-feasible by ring-wise accretion using an SM tool with length L>=2. The argument is geometric and is illustrated with 2D configurations (Fig. 7). The manuscript states: \"This second property can be proven by analyzing the conditions at a boundary voxel on the topmost layer - details of this proof are provided below with the help of Fig. 7.\" But the provided details only cover voxels on the outer boundary of the model/workspace. For a top-layer voxel adjacent to an interior cavity, the accretion operations must place support voxels inside that cavity. The algorithm requires each accretion to be feasible as the inverse of a feasible SM operation: the corresponding SM removal must be collision-free, and the SM tool's occupancy set (Def. 2.4, with T_S sets) must not intersect existing solid material. The 2D illustrations do not show that, inside a 3D cavity, a horizontal or vertical SM tool of length L>=2 can reach all necessary positions around the target voxel without collision, especially when the cavity entrance is smaller than the tool length or when the tool must pass through a narrow channel. The induction over layers is also only sketched: the proof assumes the topmost layer can be fully eroded, then the next layer becomes topmost, but it does not account for the fact that the accretion structures added below the current top may remain and affect the definition of the new top layer and the feasibility of subsequent accretions. Moreover, the implemented algorithm uses a localized stability check (Sec. 4.1) and a pre-processing heuristic (Sec. 4.2), and the paper does not prove that these variants preserve the completeness theorem.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a voxel-based planner for hybrid additive–subtractive manufacturing. Instead of searching forward from the empty state to the target, it searches backward by applying inverse operations: erosion (the inverse of additive deposition) and accretion (the inverse of subtractive removal). The algorithm repeatedly identifies erosion-feasible voxels on the topmost layer, uses accretion below that layer to make remaining boundary voxels erosion-feasible, and thereby reduces the model to the empty set; the reversed operation sequence is claimed to be a valid hybrid fabrication plan. The central theoretical claim is completeness: every stable voxel model can be nullified, and hence exactly fabricated, given an SM tool of length L≥2. The paper also reports a scalable implementation with a localized stability check, a pre-processing heuristic to reduce temporary supports, computational experiments on several benchmark models, and physical fabrication on a custom hybrid machine.","tokens_in":19637,"tokens_out":17926,"duration_ms":159175,"significance":"If the completeness theorem were correct, the inverse-operation approach would be a notable contribution: it would give a constructive, universal feasibility guarantee for hybrid AM/SM process planning, with practical scalability to hundreds of thousands of voxels and physical validation. The paper is clearly written, the inverse operation formulation is elegant, the implementation and data are shared (github link), and the physical experiments support the practical utility of the method for the tested geometries. However, the theoretical claim is the main advertised contribution, and it is not established as stated. The proof in Sec. 3.3 is a sketch that does not handle 3D tool accessibility in interior cavities, and there is a concrete stable model (a box with a fully enclosed internal void) for which the algorithm, as described, cannot generate a nullification sequence. Since the central claim is false in the current form, the significance of the paper is substantially reduced; the practical results remain interesting but do not compensate for the unsupported universality claim.","major_comments":[{"comment":"The completeness theorem is not valid for the stated problem domain. The proof relies on the assertion that any boundary voxel on the topmost layer can be made erosion-feasible by accretion with an SM tool of length L≥2, but this is not shown for voxels adjacent to fully enclosed interior voids. Consider the stable 5×5×5 voxel box with a 3×3×3 central void (all solid voxels connected to the base). The center voxel (3,3,5) of the top plate has no solid neighbor at height 4 (the void extends underneath), so it is not self-supported and hence not erosion-feasible. To accrete at (3,3,4) below this voxel, the corresponding inverse SM operation would require a collision-free tool path. A vertical SM tool collides with the solid voxel (3,3,5) itself; horizontal tools, with widths implied by Def. 2.4, collide with the solid side walls at x=1,5 or y=1,5. No feasible accretion exists, so the algorithm cannot erode the top layer and the nullification process gets stuck. This is not a mere gap in presentation: it is a counterexample to the claimed theorem, which states that every stable voxel model can be nullified. The authors need to either add an assumption (e.g., cavity accessibility) or prove that the algorithm can create an opening in the top layer by eroding supported perimeter voxels first and then erode the center voxel without support below; the latter contradicts Def. 3.1. As written, the central claim cannot be repaired by a local proof tightening.","section":"Sec. 3.3"},{"comment":"The completeness guarantee is proven for the abstract algorithm with a global stability check, but the implemented algorithm replaces that check with a conservative local Δ-neighborhood test. The paper claims (Sec. 4.1) that conservative misclassifications 'do not compromise manufacturability,' yet no proof is given that the local-check version inherits the completeness theorem. Since the local check can reject erosion and accretion operations that are feasible under the global criterion, the algorithm may fail to find a nullification sequence even when one exists for the abstract algorithm. The empirical verification on 100 Thingi10K models (Sec. 6.1.5) is not a formal argument. To support the claim that the implemented planner is complete, the authors must either prove that the local check preserves completeness (for example by showing that any rejected operation can be replaced by an equivalent sequence) or explicitly restrict the completeness statement to the global-check version and describe the local version as heuristic.","section":"Sec. 4.1"}],"minor_comments":[{"comment":"The algorithm description in Step 4 is ambiguous about the order of checking erosion-feasibility with respect to the growing set Λ. In particular, the footnote says 'we cannot determine the order of following erosion operators in advance,' but the pseudocode in the text is not sufficiently formal to make the dependency clear. A precise pseudocode or a formal invariant for Λ would help reproduce the method.","section":"Sec. 3.2, Step 4"},{"comment":"Fig. 7 is a 2D illustration and the proof text refers to '46 configurations' without specifying whether peach voxels are at layer k−1 or at the same layer k. This makes the self-support condition in the proof difficult to verify. A 3D statement of the lemma and a careful distinction between support from below and same-layer neighbors is needed.","section":"Sec. 3.3 and Fig. 7"},{"comment":"The occupancy set definitions of the SM tool are given in half-space form, but the physical interpretation of the tool length L̄ and the subtraction of the tool axis are not described in words. For reproducibility, the paper should state explicitly what material volumes these sets represent (e.g., the tool shank, the cutter body, and the depth of cut).","section":"Sec. 2.2, Def. 2.4"},{"comment":"The column 'Support Voxels' reports both pre-processing and total support counts, but the operational meaning of '# Operations' (e.g., whether it counts each voxel-level AM/SM action, not toolpaths) could be clarified in the caption or text.","section":"Sec. 6.1.1, Table 1"}],"recommendation":"reject","confidential_remarks":"The counterexample in major comment 1 (a 5×5×5 box with a 3×3×3 central void) appears to be a genuine counterexample to the stated completeness theorem, not just a proof gap. The paper's central contribution is the theoretical guarantee, so this is a load-bearing error. The inverse-operation planning framework and the physical experiments are promising; a revision that narrows the claim (e.g., to models with accessible internal voids, or with an explicit allowance for a final closure operation) could form a viable new submission. I therefore recommend rejection of the current manuscript, while acknowledging the practical merits of the approach."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The core idea here is genuinely nice: run the planner backwards from the target voxel model, using erosion as the inverse of deposition and accretion as the inverse of machining, so temporary supports that would be dead-ends in forward search become legal reverse steps. The implementation is also serious: local stability checks, a pre-processing heuristic, validation on 100 Thingi10K models, and actual physical parts machined on a hybrid system with a stiffness test. The code is public. That is real engineering and deserves credit.\n\nThe soft spot is the headline claim. The abstract says “any model can be fabricated exactly,” and that claim rests on the completeness proof in Sec. 3.3. As written, that proof is a 2D picture and a few sentences. It does not rigorously establish that the ring-wise accretion step is always feasible for a boundary voxel on the topmost layer when the needed support voxels lie inside an enclosed cavity. The accretion operation is only legal if the corresponding forward SM removal is collision-free, and for an interior cavity with a narrow opening that is not obviously true (indeed, with the paper's own conservative tool shapes, it can be false). The induction over layers is also sketched, not proven. On top of that, the implemented algorithm uses a localized stability check and a pre-processing step, and the paper never shows these preserve the completeness theorem; it even admits the local check can misclassify stable states as unstable, which is fine for soundness but leaves the implementation's completeness claim unsupported.\n\nI want to be fair: this is not a paper that is wrong from the ground up. The inverse formulation is new, the scalability results are convincing, and the physical demonstration is far beyond what most papers in this area do. The empirical success on a varied dataset suggests the method works well in practice. But the title's question—“Can any model be fabricated?”—is answered with a proof that does not cover the hard cases. The paper would be honest and still strong if it either fixed the proof under explicit accessibility assumptions or stated the theorem with those caveats.\n\nA serious editor should send this to peer review. The right reviewers will push on the geometry of accessibility, and the authors have enough material to respond. I would ask for a revised version that states precisely what is proven and what is heuristic, and that either strengthens Sec. 3.3 or changes the wording of the completeness claim.","headline":"Clever inverse-planning algorithm with strong demos, but the 'any model' completeness theorem is a sketch that doesn't handle 3D tool access inside cavities.","tokens_in":20153,"tokens_out":8346,"would_cite":true,"duration_ms":77542,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that any stable voxel model can be fabricated exactly by interleaved additive and subtractive operations, by planning the reversed dismantling sequence.","keywords":["hybrid manufacturing","additive-subtractive manufacturing","inverse operation planning","nullification algorithm","voxel models","manufacturing process planning","support structures","fabrication completeness"],"falsifier":"Construct a stable voxel model with a deep internal cavity whose only opening is narrower than the subtractive tool, and run the algorithm to empty; if it stops before empty or produces a reversed plan that leaves material where it should not be, the completeness claim fails.","tokens_in":19004,"feed_emoji":"🛠️","tokens_out":10698,"duration_ms":81217,"temperature":0.7,"pith_summary":"This paper tackles a fundamental question in hybrid manufacturing: given a model that cannot be printed in one pass or milled in one pass, can it still be made exactly by interleaving additive (printing) and subtractive (machining) steps? The authors answer yes for any stable voxel model, and prove it by planning the whole sequence backward. Instead of asking how to build the target from nothing, they ask how to dismantle the target to nothing using two inverse operations: erosion (removing material, the reverse of printing) and accretion (adding material, the reverse of machining). The reversed dismantling sequence is a valid fabrication plan that produces the target exactly, with temporary supports printed and later machined away. The completeness proof, the local stability check, and physical prototypes support the claim that hybrid machines can fabricate arbitrary voxel shapes, including parts from unconstrained topology optimization.","feed_headline":"Reverse planning proves any stable voxel model is manufacturable","feed_subtitle":"A backward search that dismantles a target part yields an exact print-and-mill sequence, with no over- or under-cuts.","key_machinery":"The central machinery is the nullification algorithm built from two inverse operators: erosion, the inverse of an additive-manufacturing step, which removes a voxel, and accretion, the inverse of a subtractive-manufacturing step, which adds a voxel. The algorithm repeatedly takes the current top layer, classifies voxels there as erosion-feasible or not, and for non-feasible boundary voxels grows a connected support collar ring by ring below that layer until erosion becomes feasible, then erodes the layer. The completeness argument rests on the topmost-layer rule (erosion above, accretion below) and on the ring-wise accretion claim that a boundary voxel can always be made erosion-feasible with a subtractive tool of length $\\bar{L}\\ge 2$; scalability comes from replacing the global stability flood-fill with a conservative localized check on a $\\Delta$-neighborhood.","core_discovery":"On the paper's own terms, the discovery is a completeness theorem for hybrid manufacturing planning: every stable voxel model can be reduced to empty by a finite sequence of feasible erosion and accretion operations, and the reverse of that sequence is a valid additive-manufacturing/subtractive-manufacturing fabrication plan that reproduces the target exactly, with every intermediate state stable and no over- or under-cuts. The enabling observation is that inverse planning can create temporary support material for free: accretion adds voxels that will later be eroded, which in the forward direction means supports that are printed and then machined away. The theorem is argued by restricting erosion to the topmost layer and accretion to below it, together with a ring-wise growing argument for boundary voxels; the authors report a voxel implementation that handles models up to roughly a million solid voxels, succeeds on 100 random benchmark models, and produces physical prototypes. The paper also reports that a topology-optimized MBB beam made by its hybrid plan is 30.51% stiffer than the self-support-constrained version.","pith_inferences":["Editorial extension: the completeness theorem is stated for voxel models with isotropic material, so a natural next question is whether the same inverse-planning scheme extends to multi-resolution representations or to anisotropic materials; the paper itself flags anisotropy as future work.","Editorial extension: the implemented algorithm uses a finite $\\Delta$-neighborhood stability check instead of the global check used in the proof, so the code is not formally covered by the completeness theorem; a search for a pathological voxel configuration with small $\\Delta$ would show whether the gap is real.","Editorial extension: the proof's localization to the top layer makes enclosed cavities with narrow openings the likely stress case for the claim; testing deep, tortuous voids would test whether exact fabrication of any model includes models with internal sealed chambers."],"forward_implications":["Topology-optimized parts no longer need to satisfy self-support constraints before fabrication, so designers can keep the mechanically optimal layout; the paper's MBB beam test shows a 30.51% stiffness improvement over a self-support-constrained version.","A hybrid machine can be given a fully automatic, exact plan for complex high-genus voxel models such as a TPMS structure with genus 72, including temporary supports that are removed by later subtractive steps.","Because the fabrication plan is the reverse of a verified nullification sequence, the final geometry is exact by construction, avoiding the over-cuts and under-cuts that forward-search planners can produce.","The algorithm remains usable at engineering scales: planning completed for models with up to roughly 0.98 million solid voxels, and the planned sequences were validated by physical fabrication on a five-axis hybrid machine."],"supporting_citations":[{"why":"Baseline forward-search hybrid planner whose topological dead-ends and over/under-cuts motivate the inverse-search strategy.","marker":"[Harabin and Behandish 2022]"},{"why":"Defines the self-supporting constraint used to judge whether an additive step, and therefore its inverse erosion, is feasible.","marker":"[Vanek et al. 2014]"},{"why":"Self-support-constrained topology optimization frames the motivation and provides the MBB beam comparison case.","marker":"[Langelaar 2016]"},{"why":"Supports the voxel-based representation and multi-axis printing background for additive operations.","marker":"[Dai et al. 2018]"},{"why":"A decomposition-based hybrid planning method that the paper contrasts with its own guarantee of exact final shape.","marker":"[Zhong et al. 2023]"},{"why":"Provides the large 3D model benchmark set used to test the nullification algorithm on 100 random models.","marker":"[Zhou and Jacobson 2016]"},{"why":"Supplies the tool-accessibility concept used in the subtractive feasibility condition.","marker":"[Harabin et al. 2023]"}],"fun_headline_variants":["Inverse search proves every stable voxel part is printable","Backward planning guarantees fabrication of any stable voxel model","From target to empty: inverse steps make any shape manufacturable","Hybrid proof: every stable voxel model has an exact print-and-mill plan","Dismantle to build: inverse planning fabricates any stable voxel shape"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The theorem presumes that any boundary voxel on the current topmost layer can always be made removable by adding a ring of support beneath it with a subtractive tool at least two voxels long, without requiring a full 3D accessibility analysis for enclosed pockets.","fun_headline_variants_meta":{"raw":{"variants":["Inverse search proves every stable voxel part is printable","Backward planning guarantees fabrication of any stable voxel model","From target to empty: inverse steps make any shape manufacturable","Hybrid proof: every stable voxel model has an exact print-and-mill plan","Dismantle to build: inverse planning fabricates any stable voxel shape"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000433,"raw_usage":{"total_tokens":2182,"prompt_tokens":892,"completion_tokens":1290,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":508,"completion_tokens_details":{"reasoning_tokens":1197}},"tokens_in":508,"tokens_out":1290,"duration_ms":369779,"temperature":1.0,"reasoning_tokens":1197,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T15:54:29.805441+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct a stable voxel model with a deep internal cavity whose only opening is narrower than the subtractive tool, and run the algorithm to empty; if it stops before empty or produces a reversed plan that leaves material where it should not be, the completeness claim fails.","supporting_citations":[],"review_version":1}