{"id":"cb568740-e447-4404-bda2-3dd1a3868a24","arxiv_id":"2507.16934","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"Rigidity percolation in general origami is controlled by triangular facet ratio, selection rule, and number of choices, but the proposed predictive formula is an empirical fit without out-of-sample validation.","lead":"Researchers simulated how nine origami patterns stiffen when facet-planarity constraints are added one by one under different selection rules, and found the fraction of triangular facets is the main control variable. They fit a simple curve to predict the density at which a pattern becomes rigid, but the curve is fitted to the same simulations it claims to predict, not tested on new data.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The t-only unified model cannot support the high-resolution prediction claim: Miura-ori has t=0 at every resolution yet simulated ρ* shifts strongly with resolution (Table S1), so Eq. (21) lacks a mechanism for the resolution effect.","rationale":"The paper's qualitative contribution—a systematic numerical survey of DOF evolution across nine origami patterns under two selection rules, plus hypergeometric bounds identifying the triangular facet ratio as a key structural variable—is plausible and useful. The quantitative headline, however, rests on Eq. (21), and the weakest point is not merely the absence of a held-out test; it is that the model's only structural input, t, is constant across resolutions for Miura-ori while the reported ρ* values change systematically with resolution. Table S1 shows t=0.00 at 100, 225, and 400 facets; under Most Efficient selection, ρ* at k=16 is 0.3900, 0.3111, and 0.2550. Because Eq. (21) contains no resolution-dependent term and the constants in Table S4 are fitted jointly over all three resolutions, the model averages over this trend and cannot support prediction for new resolutions. A concrete hold-out test—fit on two resolutions, predict the third—would settle this. If the prediction error is large, the central claim must be revised to include a resolution variable or be limited to in-sample interpolation. I therefore keep the reader's CONDITIONAL verdict: the paper needs a resolution-aware model and out-of-sample validation before the predictive claim can be accepted.","tokens_in":22298,"tokens_out":9709,"duration_ms":108158,"concrete_test":"Use Miura-ori data in Table S1: hold out the 400-facet row (11 ρ* values, both rules, k=1..32). Fit Eq. (21) to the 100- and 225-facet rows only (22 points, all with t=0); since d*t=0, the model has no resolution term. Predict the 400-facet ρ* values and compute the mean absolute error. If it exceeds 0.05 (the reported in-sample RMSE for Miura-ori is 0.0356), the t-only model fails to transfer, directly falsifying the high-resolution prediction claim.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central predictive claim (Eq. 21) is that for a given pattern, ρ* can be predicted at any resolution from the triangular facet ratio t, with structure-specific constants fitted once. But the paper's own data contradict the premise that t is sufficient. For Miura-ori, Table S1 lists t = 0.00 at all three resolutions (100, 225, and 400 facets). Under the Most Efficient rule, ρ* for k=16 falls from 0.3900 to 0.3111 to 0.2550 as resolution increases, and for k=32 from 0.3700 to 0.2667 to 0.2200. Since Eq. (21) depends only on t, r, and k, and the constants in Table S4 are fitted jointly over all three resolutions, the model returns the same ρ* for every resolution of Miura-ori. Fitting all 33 points averages over a real resolution trend, so there is no basis for extrapolating to a new, higher-resolution structure. A resolution-aware term (e.g., number of facets) and a held-out test are therefore required; without them, the headline 'efficient prediction for high-resolution structures' is unsupported.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies rigidity control of nine general origami structures by sequentially imposing facet-planarity constraints under two stochastic selection rules (Most Efficient and Least Efficient) with varying numbers of candidates k. The authors formulate a rigidity matrix for arbitrary polygonal facets, simulate DOF evolution at three resolutions per pattern, define a critical transition density rho*, derive hypergeometric bounds that identify the initial triangular facet ratio t as a key structural variable, and fit a tanh-based model (Eq. 21) to rho* as a function of (-1)^r log(k) and t. They claim this model enables efficient prediction of rho* for high-resolution origami structures without direct simulation.","tokens_in":22586,"tokens_out":8642,"duration_ms":93323,"significance":"If the predictive claim were supported, the paper would offer a practical design tool for choosing selection rules and candidate-set sizes to achieve a target rigidity in large origami structures. The hypergeometric bounds in Section II.C are a concise and useful formalization of why triangular facets matter under the two selection rules, and the numerical study is broad, covering periodic, rotational, and perforated patterns at multiple resolutions. The paper also includes physical paper models and a sensitivity check over folding percentages, which strengthen the empirical part. However, the central high-resolution prediction claim is not currently supported: the model is fit in-sample to the same data it is claimed to predict, and the paper's own tables contain resolution trends that Eq. (21) cannot represent.","major_comments":[{"comment":"Equation (9) states d = 3E - rank(A) - 6, but the rigidity matrix A has 3V columns, so the nullity of A is 3V - rank(A) and the correct expression after removing the six trivial motions is d = 3V - rank(A) - 6. The subsequent Eq. (10) uses 3V, confirming that Eq. (9) is internally inconsistent. Since the DOF computation underpins all simulation results, please correct the formula and verify that the numerical implementation used 3V rather than E.","section":"Section II.A, Eq. (9)"},{"comment":"The central predictive claim for high-resolution structures is not supported by the evidence presented. Eq. (21) depends only on r, k, and t, with per-structure fitted constants a, b, c, d, f. For Miura-ori, t = 0.00 at all three resolutions, yet Table S1 shows that rho* under the Most Efficient rule at k = 16 changes from 0.3900 (100 facets) to 0.3111 (225 facets) to 0.2550 (400 facets). The model therefore cannot reproduce this resolution dependence, and fitting it jointly to all 33 points per structure averages over the trend rather than explaining it. No held-out or out-of-sample test is reported, so the claim that one can use the fitted model to predict rho* for high-resolution structures is unjustified. A resolution-aware variable (e.g., number of facets or a t-resolution interaction) and a validation protocol that excludes a target resolution from the fit are needed.","section":"Section III.C, Eq. (21), Table S1"},{"comment":"The rank of the rigidity matrix A is described as approximated by counting non-zero diagonal entries of the upper triangular matrix R from a QR factorization, but no numerical tolerance is specified. The resulting DOF values, and hence all critical densities rho*, depend on this threshold. Please report the exact rank-revealing criterion used, demonstrate that the results are insensitive to reasonable threshold choices, or replace the heuristic with a documented rank-revealing decomposition. This is also necessary for reproducibility.","section":"Section III, rank estimation"},{"comment":"Several entries in the critical-density tables appear inconsistent with the paper's own definitions and warrant verification. At k = 1 the Most Efficient and Least Efficient rules are identical, and in every other row of Tables S1-S3 their rho* values are close; however, in the Kirigami Honeycomb 276-facet row the reported values are 0.8711 and 0.4200, a discrepancy of about 0.45 that cannot be explained by the rules being identical. In addition, the Perforated Triangle 225-facet row reports t = 0.00 while the 49- and 106-facet rows report t = 0.46 and t = 0.43; this abrupt change in the central structural variable would strongly affect the fitting in Eq. (21). Please check these entries and correct any transcription errors.","section":"Appendix C, Tables S1-S3"}],"minor_comments":[{"comment":"The indexing in the description of the edge constraints reads {g_ej}_{i=1}^E; the summation index should be j = 1, ..., E.","section":"Eq. (7)"},{"comment":"The main text says the model is fit 'to each origami structure and resolution,' while Appendix C states that the five parameters are fit to all 33 points (3 resolutions x 11 selection parameters) for each structure. Please make this consistent.","section":"Section III.C and Appendix C"},{"comment":"Calling Eq. (21) a 'unified model' is potentially misleading because the five parameters are structure-specific (Table S4). The functional form is unified, but the parameters are not. Please clarify this in the text.","section":"Section III.C, Eq. (21)"},{"comment":"The phrase 'the 3 x 4 plots on the right' in the discussion of Fig. S2 is unclear; please specify the number of panels and what each panel shows.","section":"Appendix A"},{"comment":"There is a typographical spacing error in the caption of Fig. S2 ('Huffman W aterbombs' in the following figure caption as well); please correct it.","section":"Supplementary captions"}],"recommendation":"major_revision","confidential_remarks":"The paper's headline claim of efficient high-resolution prediction is currently an in-sample curve fit, and the Miura-ori t = 0 resolution trend in Table S1 is the clearest counterexample. Adding a resolution-dependent term and performing a genuine held-out test would substantially strengthen the paper. The data anomalies in Table S3 (Kirigami Honeycomb 276 facets at k=1, and Perforated Triangle 225 facets t=0.00) should be resolved before resubmission."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe useful part of this paper is the systematic numerical study of rigidity percolation for nine origami patterns beyond Miura-ori, plus a simple theoretical argument that the triangular facet ratio t is a key control variable. The hypergeometric bounds in Eqs. (15)-(18) are correct as far as they go, and the n-3 constraint count for imposing planarity on an n-gon is a nice generalization with a clean proof. The simulation campaign is thorough: three resolutions per pattern, 100 runs per setting, and a check that the results are robust to folding percentage. If you work on origami mechanics, this is a useful reference for how the Most Efficient vs Least Efficient rules behave on mixed polygon patterns.\n\nThe soft spot is the headline predictive claim, Eq. (21). The five-parameter tanh model is fitted to all 33 simulated rho* values per pattern (Table S4), so the 'prediction' is the fit itself. There is no held-out test. The stress-test note points to a sharper problem: for Miura-ori, t=0 at every resolution, yet the simulated rho* for k=16 drops from 0.39 to 0.31 to 0.255 as the facet count goes 100->225->400. Eq. (21) has no resolution dependence when t is constant, so it cannot predict that trend; it just averages over it. The paper states that resolution 'has little effect' on periodic structures, which is contradicted by its own Table S1 for Miura-ori. So the claim that the model enables efficient prediction for high-resolution structures is not supported. A resolution-aware term or an explicit restriction to patterns where t actually changes with resolution, plus a genuine out-of-sample test (fit on two resolutions, predict the third) would be needed to substantiate it.\n\nTwo smaller issues: Eq. (9) writes d = 3E - rank(A) - 6, but A has 3V columns and Eq. (10) uses 3V; this looks like a typo for 3V. And the rank of A is computed by counting nonzero diagonal entries of R from a QR decomposition, but the numerical tolerance is never stated, which is a reproducibility gap. Neither is fatal, but both should be fixed.\n\nBottom line: the numerical phenomenology and the bounds are worth publishing, and a serious referee should engage with the paper, but the unified model as stated overreaches. I would accept it for review with the expectation of major revision: hold out data, address the Miura-ori resolution problem, and correct the DOF formula.","headline":"Useful numerical survey and a correct hypergeometric bound, but the unified predictive model is a fit to its own data and cannot account for the Miura-ori resolution trend.","tokens_in":23105,"tokens_out":4750,"would_cite":true,"duration_ms":45246,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["74K99"],"pacs":["46.70.-p"],"model":"deepseek-v4-flash","headline":"A single formula predicts the critical density of rigidity in general origami structures.","keywords":["origami rigidity","rigidity percolation","degrees of freedom","hypergeometric model","triangular facet ratio","power-of-choices","mechanical metamaterials","facet planarity constraint"],"falsifier":"Take a pattern not among the nine studied, compute its triangular facet ratio $t$, predict $\\rho^*$ from the fitted constants of the closest family, and run rigidity-percolation simulations at high resolution; a systematic deviation beyond the reported RMSE would show the tanh-plus-linear form or the $t$-transfer assumption does not generalize.","tokens_in":1407,"feed_emoji":"📐","tokens_out":1725,"duration_ms":27563,"temperature":0.7,"pith_summary":"The paper reports that the critical transition density of rigidity percolation in a wide range of origami structures—periodic, rotational, and perforated—is controlled by only three quantities: the selection rule, the number of candidate facets considered at each step, and the fraction of triangular facets in the pattern. Starting from a floppy state where all facets may bend, the authors enforce facet planarity one facet at a time and track the degrees of freedom. Their hypergeometric analysis bounds the probability of a DOF-decreasing step at any density in terms of the triangular facet ratio, and their numerical simulations identify a smooth dependence of the critical density on the rule and the number of choices. They propose a five-parameter hyperbolic-tangent-plus-linear model that reproduces the simulated critical density for each pattern and resolution, and they argue this allows prediction and design of high-resolution origami rigidity without expensive simulation.","feed_headline":"One formula predicts when any origami pattern turns rigid","feed_subtitle":"Only the facet selection rule, number of choices, and triangular facet ratio set the floppy-to-rigid transition density.","key_machinery":"The central mechanism is the hypergeometric model of facet selection, which bounds the probability $P_1(\\rho)$ that a DOF-decreasing step occurs at density $\\rho$ by $(1-t(\\rho))^k$ under the Least Efficient rule and by $1-t(\\rho)^k$ under the Most Efficient rule, where $t(\\rho)$ is the fraction of triangular facets remaining. This bounds the rigidity percolation process in terms of $t$ and $k$, making the triangular facet ratio a structural control parameter. The unified tanh-plus-linear fit in Eq. (21) then connects this to the critical density $\\rho^*$.","core_discovery":"The paper establishes that the rigidity percolation transition in general origami structures is governed by the ratio of triangular facets and the power-of-choices selection process. By defining the critical density $\\rho^*$ as the smallest planarity constraint density at which at least half of the simulations reach the minimum DOF, the authors show that the simulated $\\rho^*$ values for nine origami patterns across three resolutions each collapse onto a tanh-based functional form $\\rho^*_{\\text{fit}} = a \\tanh(b \\cdot (-1)^r \\log(k) + c) + d t + f$, where $r$ distinguishes the Most Efficient from the Least Efficient selection rule, $k$ is the number of candidate facets, and $t$ is the initial triangular facet ratio. They also prove that $n-3$ sub-planarity constraints are necessary and sufficient to enforce the planarity of an $n$-sided polygonal facet, generalizing earlier Miura-ori-specific treatments to arbitrary polygonal facets.","pith_inferences":["If the tanh-form transfer to unobserved patterns holds, one could extend the same fitted constants to any pattern that shares the same $t$, a transfer the paper does not explicitly test with held-out data.","The hypergeometric bounds suggest that a more refined stochastic differential equation model of the selection process could yield an analytic mean and variance for $\\rho^*$, a direction the authors propose but do not carry out.","A direct experimental test would rigidify facets in paper or sheet prototypes of the studied patterns and compare the measured transition density to the predicted value, something the paper does not include.","The identification of $t$ as a master variable may extend to other structural assemblies that reduce to a percolation of local geometric constraints, though the paper does not claim this."],"forward_implications":["For any given origami pattern and resolution, the critical transition density can be predicted directly from the triangular facet ratio $t$, the rule $r$, and the number of choices $k$, without running high-resolution simulations.","Designers can invert the model to choose the rule $r$ and number of choices $k$ needed to reach a target critical density, effectively programming a desired floppy-to-rigid transition in a physical origami structure.","The $n-3$ sub-planarity constraint result extends the rigidity-control framework to facets with any number of edges, lifting the earlier quadrilateral-only limitation.","The simulations show that resolution affects the critical density only when it changes the triangular facet ratio; patterns whose facet composition is scale-invariant have resolution-independent transitions.","The study highlights that the Most Efficient and Least Efficient rules act as near-mirror controls, with the power of choices affecting each in opposite but complementary ways."],"supporting_citations":[{"why":"Establishes the planarity-constraint approach for quadrilateral Miura-ori and the floppy baseline, which the present work generalizes to arbitrary polygons.","marker":"[19]"},{"why":"Prior work by the same group on explosive rigidity percolation in Miura-ori, providing the power-of-choices and critical-density methodology extended here.","marker":"[20]"},{"why":"Supplies the infinitesimal rigidity matrix formulation used to compute DOF ranks in all simulations.","marker":"[37]"},{"why":"Provides the numerical rank-computation approach (colamd and QR) used to assess the rigidity matrix in the simulations.","marker":"[39]"}],"fun_headline_variants":["Triangular facet ratio sets origami's rigidity transition","New formula tells when origami goes from floppy to stiff","Facet selection and tri-ratio govern origami stiffness jump","Origami rigidity switch: one formula fits all patterns"],"cache_read_input_tokens":25216,"weakest_assumption_plain":"The five fitted parameters in Eq. (21) are trained on all 33 simulated points per pattern and are then assumed to transfer to other resolutions and patterns of the same family through the single variable $t$, with no held-out test to confirm that transfer.","fun_headline_variants_meta":{"raw":{"variants":["Triangular facet ratio sets origami's rigidity transition","New formula tells when origami goes from floppy to stiff","Facet selection and tri-ratio govern origami stiffness jump","Origami rigidity switch: one formula fits all patterns"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00022,"raw_usage":{"total_tokens":1478,"prompt_tokens":1010,"completion_tokens":468,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":626,"completion_tokens_details":{"reasoning_tokens":401}},"tokens_in":626,"tokens_out":468,"duration_ms":5785,"temperature":1.0,"reasoning_tokens":401,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T15:02:08.955997+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a pattern not among the nine studied, compute its triangular facet ratio $t$, predict $\\rho^*$ from the fitted constants of the closest family, and run rigidity-percolation simulations at high resolution; a systematic deviation beyond the reported RMSE would show the tanh-plus-linear form or the $t$-transfer assumption does not generalize.","supporting_citations":[{"cited_title":"Rigidity percolation and geometric information in floppy origami,","cited_arxiv_id":null,"evidence_quote":"Establishes the planarity-constraint approach for quadrilateral Miura-ori and the floppy baseline, which the present work generalizes to arbitrary polygons."},{"cited_title":"Explosive rigidity percolation in origami,","cited_arxiv_id":null,"evidence_quote":"Prior work by the same group on explosive rigidity percolation in Miura-ori, providing the power-of-choices and critical-density methodology extended here."},{"cited_title":"The stiffness of prestressed frameworks: a unifying approach,","cited_arxiv_id":null,"evidence_quote":"Supplies the infinitesimal rigidity matrix formulation used to compute DOF ranks in all simulations."},{"cited_title":"Deterministic and stochastic control of kirigami topology,","cited_arxiv_id":null,"evidence_quote":"Provides the numerical rank-computation approach (colamd and QR) used to assess the rigidity matrix in the simulations."}],"review_version":1}