{"id":"9c5027c8-1c4a-4af8-81dc-3bbff78d7604","arxiv_id":"1908.04409","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"Cyclic oritatami systems cannot fold infinite Koch or Minkowski curves, and sufficient conditions are given for when a cyclic OS cannot fold any infinite aperiodic curve.","lead":"This paper proves that a class of RNA-inspired folding models called cyclic oritatami systems cannot draw infinite fractal curves like the Koch curve. The result delimits what periodic biological self-assembly models can build, adding a new impossibility result to the oritatami systems literature.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The Koch/Minkowski impossibility proofs depend on an unproved exhaustive case analysis (Figs. 10/16) and a self-similar emptiness lemma; without a written or machine-checked derivation, the local-dependence bound is not established.","rationale":"The reader's weakest_assumption focused on the locality condition in Definition 1, which is a genuine scope limitation and is explicitly acknowledged in the paper as 'crucial.' I agree that the abstract overstates the unconditional nature of the result. However, the more immediate technical risk to the correctness of Theorems 1 and 2 is the unproved finite case analysis: the proofs reduce the problem to a small set of geometric configurations and then rely on figures instead of written verification. If the classification is incomplete in either theorem, the claimed contradiction from aperiodicity does not follow. The concern is not that the results are likely false; the self-similarity of the Koch and Minkowski curves makes the case analysis plausible, and the pigeonhole structure is sound assuming those cases. But a conditional verdict is appropriate because the manuscript does not currently supply the needed verification. My proposed check, an exhaustive enumeration or formalization of the base cases, would settle this directly: success would substantially raise confidence in the theorem, while failure would require revising the constants or the theorem statement. Since the reader already reached CONDITIONAL, my read does not change that verdict, hence UNCHANGED.","tokens_in":41,"tokens_out":9972,"duration_ms":359750,"concrete_test":"Write an exhaustive enumerator (or a proof-assistant formalization) for the base step of Theorem 1: fix the base delay interval, say delta = 3d+3l+1, generate every possible placement of the Koch shapes Sp/Sl whose boundaries intersect the radius-(delta+1) hexagon around Spl[i] while respecting the self-similar emptiness lemma, and verify that each placement is congruent to one of the nine cases in Figure 10. If any non-congruent case appears, the bound 'beads from Sp[i-4] to Sl[i-1]' is false and the pigeonhole step is invalid. Run the same check for the eleven cases in Figure 16 for the Minkowski curve.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 3's proof of Theorem 1 has two load-bearing steps that are asserted by inspection rather than proved. First, the 'self-similar emptiness' statement says that for a point q0 on the Koch curve with q1,q2 at distance 3^n on the curve, no segment within 3^n unit distances from q0 is used except the curve between q1 and q2. This property is needed to guarantee that the event horizon E(i) contains only the shapes from Sp[i-4] to Sl[i-1], which is the basis for the finite pigeonhole bound. Second, the nine cases in Figure 10 are claimed to exhaust every possible overlap of these shapes with E(i); the Minkowski proof uses eleven cases in Figure 16. The proof text only says 'We can observe,' but the entire argument that two event horizons repeat, and hence that the turn sequence becomes eventually periodic, fails if a single case is missing or if one of the drawn shapes can intrude into a claimed empty region. The figures show representative orientations, but the Koch curve has six orientations on the triangular lattice, and rotations/reflections are not discussed, so exhaustiveness is not established by the figures alone. A related gap is that equality of event horizons is used to conclude equal future partial conformations, which presumes that the stabilization rule in Eq. 1 is invariant under the congruence used to identify event horizons; this is plausible but unstated. These gaps are probably fixable, but they are the load-bearing geometric content of the impossibility theorem, not a peripheral detail.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the oritatami system (OS), a model of cotranscriptional RNA folding, and asks whether an infinite fractal curve can be drawn by a cyclic OS, i.e., one whose transcript is ultimately periodic. It defines a local drawing relation (Definition 1) in which a curve is represented by alternating point and segment shapes, and each shape must be covered by a partial transcript that folds within that shape. Under this convention and additional modular-design assumptions (constant numbers of beads per point/segment shape, period equal to the sum of those counts), the paper claims two negative results: Theorem 1 states that no deterministic cyclic OS can draw the infinite Koch curve, and Theorem 2 states the analogous statement for a tilted Minkowski curve. The proofs combine a delay-bounded event horizon with a self-similarity observation about the curves, then use a pigeonhole argument over a finite set of possible conformations to force a periodic repetition of turn sequences, contradicting aperiodicity. Sections 4--5 generalize the approach and state sufficient conditions (Theorems 3--5) under which an infinite aperiodic curve cannot be drawn by a cyclic OS. The paper concludes with the conjecture that all fractal curves made by edge replacement are not foldable, while noting that self-touching curves such as Heighway dragons require a different approach.","tokens_in":11267,"tokens_out":5785,"duration_ms":66059,"significance":"If the main theorems are fully established, this would be a valuable negative result for the oritatami literature: it would show that a very natural class of infinite self-similar structures cannot be generated by periodic transcripts under the modular, local drawing semantics used in prior OS constructions. The proof strategy is original and the paper is self-contained: the Koch and Minkowski curves are given by standard L-systems, and the impossibility arguments do not rely on fitting parameters or on earlier claims by the authors. The paper also explicitly identifies the locality assumption in Definition 1 as crucial, which is honest about the scope of the results. However, the current manuscript does not yet provide a complete written proof of the geometric case analyses that carry the main impossibility arguments; those analyses are instead delegated to figures and phrases such as 'We can observe.' Because those observations are load-bearing for Theorems 1 and 2, the paper needs a major revision in which the case enumerations are either proved in full or supplied as machine-checked code.","major_comments":[{"comment":"The proof of Theorem 1 rests on two assertions that are stated as observations rather than proved: (i) the self-similar emptiness property for a point q0 with q1 and q2 at distance 3^n, and (ii) the exhaustiveness of the nine cases in Figure 10. The Koch curve has six orientations on the triangular lattice, but Figure 10 shows representative configurations and does not discuss rotations or reflections, so the figures do not themselves establish that every possible overlap of Sp and Sl shapes with the event horizon E(i) is one of the nine cases. This exhaustiveness is load-bearing because it yields the conclusion that all beads in E(i) come from Sp[i−4] through Sl[i−1], which in turn gives the finite pigeonhole bound that forces periodic turn sequences. Please replace these observations with a written derivation or a machine-checked exhaustive enumeration.","section":"§3, Figure 10 and the surrounding text"},{"comment":"The proof of Theorem 2 has the same gap: the properties illustrated in Figure 15 and the eleven cases in Figure 16 are asserted by inspection, but no argument is given that the cases cover all possible relative positions of the event horizon. Moreover, the text first says that the relevant shapes range 'from Sp[i−5] to Sp[i+6]' and then concludes that a partial conformation in Spl[i] is dependent on shapes 'from Sp[i−61] to Sl[i−1]'; this numeric mismatch needs clarification. Since the local-dependence bound is the geometric core of Theorem 2, the case analysis must be proved or algorithmically verified before the theorem is established.","section":"§4, Figure 16 and the surrounding text"},{"comment":"The argument that two equal event horizons E(i) and E(j) force the same stabilized partial conformation, and hence the same turn sequence, presumes that the stabilization rule in Eq. (1) is invariant under the congruence used to identify event horizons and that beads outside the horizon cannot influence the choice. This is plausible given the delay bound, but it is not stated as a formal lemma. Because it is the bridge between equality of horizons and equality of future conformations, it should be proved explicitly.","section":"§3, §4, equality of event horizons"},{"comment":"The proof of Theorem 3 asserts that 'it takes 1 + gcd(po,ppl) · 5^{Di,n ppl}' to find two shapes with the same previous Di,n beads, but this counting bound is not derived. In particular, the role of gcd(po,ppl) and the reason that a repeated pair necessarily appears within that interval are unexplained. The condition of Theorem 3 is therefore not established as written. Please provide a proof of this claim, or state and prove it as a separate lemma.","section":"§5, Theorem 3"}],"minor_comments":[{"comment":"There are several typos: 'an useful' in the abstract, 'Academic Pres' in the bibliography, and 'fist' for 'first' in the proof of Theorem 2. These should be corrected.","section":"Abstract and Section 2"},{"comment":"The theorem is stated as 'There is no deterministic OS that can draw the Koch curve,' but the proof depends on the drawing convention of Definition 1 and on the modular assumptions listed before the theorem (constant bead counts pp and pl, and initially the period assumption). The statement and the abstract should explicitly qualify the result as holding under those assumptions, since an OS that covers shapes with partial transcripts that fold across shape boundaries is outside the scope of the theorem.","section":"§3, Theorem 1 statement"},{"comment":"In the paragraph dealing with delays 3l+3d+2 ≤ δ < 12l+12d+11, the text says 'at most 32 Sp's and Si's' where 'Si' should presumably be 'Sl'. Please correct this typo.","section":"§3, proof of Theorem 1"}],"recommendation":"major_revision","confidential_remarks":"The reported gaps are likely fixable: the self-similar emptiness properties and the finite case analyses are the kind of claim that can be turned into lemmas with explicit geometric proofs or verified by a small program enumerating lattice configurations. I therefore recommend major revision rather than rejection. If the authors can supply a machine-checked enumeration for Figures 10 and 16, or a fully written case analysis with the symmetry reductions spelled out, the paper would be substantially strengthened. I would not recommend acceptance while the main impossibility proofs rest on unverified 'we can observe' statements."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the Koch and Minkowski impossibility theorems are new and the pumping argument is sound in outline, but the key geometric verifications are \"we can observe\" case analyses, and the abstract oversells the result as unconditional when it depends on the locality-based drawing relation. I'd send it to a serious referee with a request for a written or machine-checked case analysis.\n\nWhat's new: earlier work built finite fractals and proved Turing completeness for OS, but nobody proved you cannot draw an infinite fractal with a periodic transcript. The paper does that for two canonical curves, and the sufficient conditions in Theorems 3–5 are a useful first generalization. The proofs are self-contained, no parameters are fitted to data, and the authors are honest in Section 3 that the locality of partial configurations is crucial to the design perspective. The overall strategy—bound the event horizon, use self-similar emptiness to restrict which shapes can intrude, pigeonhole over possible local paths, then derive periodic turns that contradict aperiodicity—is elegant and, I think, repairable.\n\nWhere it's soft: the \"self-similar emptiness\" lemma (for q0 with q1, q2 at distance 3^n, no segment within 3^n is used except the curve between q1 and q2) is stated and illustrated, not proved. The nine cases in Figure 10 and eleven in Figure 16 are presented with \"We can observe,\" but exhaustiveness is not argued across the six orientations of the triangular lattice, and rotations and reflections are not discussed. If even one case is missing, the periodicity conclusion collapses. Similarly, the step from \"same event horizon\" to \"same future partial conformation\" assumes the stabilization rule in Eq. 1 is invariant under the congruence used to identify horizons; that is plausible but unstated. These are fixable gaps, but they are the heart of the impossibility proof, not peripheral details. The abstract's claim that the curves are \"impossible to make\" should be qualified: impossible under the locality-based drawing model of Definition 1, which is doing real work.\n\nCitation pattern looks fine: it builds on Geary et al., Masuda et al., and Rogers–Seki without overclaiming relative to those papers. Section 5's generalization is underdeveloped but acceptable as a first pass.\n\nWho it's for: researchers working on oritatami systems, and more broadly on limits of periodic transcripts in self-assembly models. It deserves peer review; I'd recommend conditional acceptance with a request to turn the visual case analyses into an explicit, exhaustive derivation or a formal proof.","headline":"A genuinely new impossibility result for cyclic oritatami systems, probably correct in outline, but the load-bearing geometry is asserted by inspection of figures rather than proved, so the right verdict is conditional.","tokens_in":11766,"tokens_out":1769,"would_cite":false,"duration_ms":21166,"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":"No deterministic cyclic oritatami system can draw the infinite Koch curve or the tilted Minkowski curve.","keywords":["oritatami system","cotranscriptional folding","cyclic transcript","Koch curve","Minkowski curve","infinite aperiodic curves","self-assembly","event horizon"],"falsifier":"Refute Theorem 1 by exhibiting a deterministic cyclic oritatami system with explicit transcript, ruleset, delay, period, arity, and seed whose fold covers an infinite sequence of shapes representing the Koch curve, each shape covered by its assigned partial transcript as required by Definition 1; alternatively, refute Theorem 5 by folding an infinite aperiodic curve that satisfies the stated lookback condition with such a system.","tokens_in":10725,"feed_emoji":"🧬","tokens_out":9960,"duration_ms":103680,"temperature":0.7,"pith_summary":"This paper is about what infinite shapes a cyclic oritatami system—a model in which a periodic string of beads folds on a triangular lattice as it is read out, as in RNA cotranscriptional folding—can draw. The authors prove that no deterministic system of this kind can draw the infinite Koch curve or the tilted Minkowski curve, no matter what delay or period it uses. The reason is that each bead is stabilized using only a bounded window of past and future beads, the event horizon, while the transcript repeats; hence two blocks far along the fold must eventually see the same window and produce the same pattern of turns, forcing the drawn curve to be eventually periodic. Since these fractal curves are aperiodic, the forced repetition contradicts the target. The paper then gives sufficient conditions under which an infinite aperiodic curve cannot be drawn by a cyclic oritatami system.","feed_headline":"Periodic RNA folding cannot trace Koch or Minkowski fractals","feed_subtitle":"Theorems on oritatami systems rule out infinite fractal curves for cyclic transcripts, regardless of delay or period.","key_machinery":"The load-bearing object is the event horizon. In a delay-$\\delta$ oritatami system, stabilizing bead $w[i]$ can only be influenced by beads within a hexagonal neighborhood of radius $\\delta+1$ centered near $w[i-1]$, and the partial conformation in that hexagon is the event horizon of $w[i]$; identical event horizons produce congruent stabilizations. Because the transcript is periodic, beads separated by the period have identical surrounding transcript, and the paper's shape-dependent counting shows that among enough consecutive blocks some two must have identical event horizons. From that point the fold is forced to draw the same sequence of turns again and again, contradicting the aperiodicity of the target. The drawing relation of Definition 1, which requires each target shape to be covered by a partial transcript folded inside it, is what ties these local repetitions to a global curve.","core_discovery":"The central discovery is a pair of impossibility theorems plus a generalization. Theorem 1 states that there is no deterministic oritatami system that can draw the Koch curve, and Theorem 2 states the same for the tilted Minkowski curve, with both proofs covering every possible delay $\\delta$ and every transcript period. The proofs assume a modular drawing relation: the curve is represented by alternating point shapes $S_p$ and segment shapes $S_l$, and the system covers each shape with the corresponding block of its periodic transcript, folded inside that shape. Within one such block the beads see only a finite maximum event horizon, and because the transcript is periodic, identical partial transcripts repeat; a pigeonhole argument over the finitely many possible paths in a bounded shape forces two blocks with identical event horizons, after which the fold repeats the same segment turns forever. A fractal's turn sequence never repeats periodically, so the assumption that such a system exists is false. Theorems 3–5 formalize the mechanism as sufficient conditions on the lookback $D_{i,n}$ that make a given infinite aperiodic curve undrawable by any cyclic OS regardless of delay and period.","pith_inferences":["The proof's reliance on the curve staying away from itself suggests that aperiodicity alone is not the true obstruction: self-touching aperiodic curves such as the Heighway dragon evade the argument, and a different technique, or a different conclusion, may hold for them.","If the locality assumption of Definition 1 is relaxed so that one transcript block may fold across several target shapes, the pigeonhole repetition could in principle be broken; formalizing such long-range drawing is a natural next step, and the paper's theorems would not apply to it.","The counting bound may be improvable: instead of the coarse path counts used in the proof, one could derive tight bounds from the actual ruleset and arity, which would turn the sufficient conditions into a practical decision procedure for small systems."],"forward_implications":["For the Koch curve and the tilted Minkowski curve, the impossibility is absolute within the model: changing the delay, the period, the ruleset, the bead alphabet, the arity, or the seed cannot make a deterministic cyclic oritatami system draw the curve.","The sufficient conditions of Theorems 4 and 5 give a reusable test: for any infinite aperiodic curve, if the event horizon reaches back only a bounded number of shapes so that $D_{i,n}$ is independent of $i$, then no cyclic oritatami system can draw it, regardless of delay and period.","Infinite periodic curves remain constructible—the glider example from the paper folds an infinite straight periodic conformation—so the obstruction is specifically aperiodicity rather than infinite length.","Any successful construction of an infinite fractal in this model would have to use a non-cyclic transcript or replace the local shape-by-shape drawing relation with one that permits long-range coordination."],"supporting_citations":[{"why":"introduces the oritatami system and the greedy cotranscriptional stabilization rule that defines deterministic folding.","marker":"[2]"},{"why":"provides the cyclic transcript convention and the glider, the running example of an infinite periodic conformation.","marker":"[1]"},{"why":"constructs a finite fractal (Heighway dragon) with a cyclic OS, the finite case that this paper contrasts with infinite fractals.","marker":"[10]"},{"why":"documents a contrasting positive result in tile assembly, showing that certain discrete Sierpinski-like fractals can be assembled infinitely, which motivates the question for the OS model.","marker":"[9]"}],"fun_headline_variants":["Cyclic RNA folding can't trace Koch or Minkowski fractal curves","No periodic transcript can draw Koch or Minkowski fractals","Cyclic oritatami systems fail to fold Koch or Minkowski fractals","Oritatami cyclic transcripts cannot produce Koch or Minkowski curves","No periodic fold for Koch or Minkowski fractals"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that a drawing must be local: the beads assigned to a point or segment of the curve fold entirely within the shape representing that point or segment, so no transcript block may reach across several shapes or coordinate distant parts of the curve.","fun_headline_variants_meta":{"raw":{"variants":["Cyclic RNA folding can't trace Koch or Minkowski fractal curves","No periodic transcript can draw Koch or Minkowski fractals","Cyclic oritatami systems fail to fold Koch or Minkowski fractals","Oritatami cyclic transcripts cannot produce Koch or Minkowski curves","No periodic fold for Koch or Minkowski fractals"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001438,"raw_usage":{"total_tokens":5814,"prompt_tokens":977,"completion_tokens":4837,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":593,"completion_tokens_details":{"reasoning_tokens":4744}},"tokens_in":593,"tokens_out":4837,"duration_ms":34756,"temperature":1.0,"reasoning_tokens":4744,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:12:00.146855+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Refute Theorem 1 by exhibiting a deterministic cyclic oritatami system with explicit transcript, ruleset, delay, period, arity, and seed whose fold covers an infinite sequence of shapes representing the Koch curve, each shape covered by its assigned partial transcript as required by Definition 1; alternatively, refute Theorem 5 by folding an infinite aperiodic curve that satisfies the stated lookback condition with such a system.","supporting_citations":[{"cited_title":"Geary, P","cited_arxiv_id":null,"evidence_quote":"introduces the oritatami system and the greedy cotranscriptional stabilization rule that defines deterministic folding."},{"cited_title":"Proving the Turing Universality of Oritatami Co-Transcriptional Folding (Full Text)","cited_arxiv_id":"1508.00510","evidence_quote":"provides the cyclic transcript convention and the glider, the running example of an infinite periodic conformation."},{"cited_title":"Masuda, S","cited_arxiv_id":null,"evidence_quote":"constructs a finite fractal (Heighway dragon) with a cyclic OS, the finite case that this paper contrasts with infinite fractals."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"documents a contrasting positive result in tile assembly, showing that certain discrete Sierpinski-like fractals can be assembled infinitely, which motivates the question for the OS model."}],"review_version":1}