{"id":"78d0f418-48f2-4d25-80d8-60c92c4d3f34","arxiv_id":"1908.07015","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The space of digital Jordan curves in a Khalimsky digital plane is path-connected, and among the topologies studied, only the Khalimsky topology makes this space path-connected.","lead":"Digital images can be modeled as finite topological spaces, and this paper studies the space of all simple digital loops, called Jordan curves, inside such a screen. It proves this space is path-connected, so a finite set of continuous rules can morph any digital loop into any other, and it argues the Khalimsky topology is the only one with this property.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 3.8's proof has an unjustified distance claim and a non-rigorous existence step; a counterexample would break the shrinking algorithm behind Theorem 1.1.","rationale":"The reader's weakest-assumption diagnosis is correct: Lemma 3.8 is the structural fact on which the shrinking algorithm depends. My stress-test confirms that the lemma's proof contains specific unproved or internally inconsistent claims, especially the distance-n−1 assertion in part (a) and the n−2 claim in part (c). These are proof gaps rather than demonstrated counterexamples; the lemma itself is plausible and likely repairable, and the paper has independent supporting structure in the explicit parameterizations, the fence of homotopies in Proposition 3.16, and the hand-checked small-plane enumerations. The recommended verdict therefore remains CONDITIONAL, i.e., no change from the reader's verdict: the paper should be accepted only after Lemma 3.8 is either rigorously repaired or machine-checked on enough small planes to rule out a hidden counterexample. I do not see a reason to move to REJECT, because no concrete counterexample to the central theorem has been identified; the concern is about rigor of the proof, not a demonstrated false conclusion.","tokens_in":40626,"tokens_out":14718,"duration_ms":164759,"concrete_test":"Exhaustively enumerate all COTS-Jordan curves in the 5×5 and 6×6 Khalimsky digital planes (the 5×5 case has 87 curves, so this is straightforward by generating simple cycles in the adjacency graph of D). For each non-minimal Jordan curve J and each pure interior point p, compute the shortest COTS-arc distance within Int(J) by BFS, choose every point q at maximal distance, and verify the three conclusions of Lemma 3.8: A(q)∩J is connected; |A(q)∩J|≥3 when q is pure; and |A(q)∩J|≥3 when q is mixed and no pure point is at maximal distance. If one configuration violates the lemma, Theorem 3.15's Shrink step can fail and Theorem 1.1 is not established; if the check passes on all enumerated curves, it supplies the missing confidence in the lemma's practical content.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The connectedness of J(D) rests on Theorem 3.15, whose Shrink step is valid only if Lemma 3.8 holds: for a maximal-distance interior point q, A(q)∩J is connected and has at least three points. The lemma's proof is where the argument is least secure. In part (a), after choosing b in another component of A(q)−J, the text asserts without proof that \"a_{n−1} and b are both of distance n−1 from p.\" While a_{n−1} has distance n−1 by Proposition 2.7, for b the displayed reasoning only forces d(p,b) ∈ {n−1, n}. If d(p,b)=n, then β∪{q} has length n+1, which is not a contradiction to maximality, and the subsequent construction no longer has two equal-distance points from which to derive the contradiction. A parity/proposition 2.11 argument may repair this, but it is absent. The proof also contains the unsubstantiated existence step \"By performing this construction for every choice of j0, we will eventually arrive at a choice of j0 such that b∈(A(q)−J)∩Int(K),\"; no argument is given that some choice works. Finally, part (c) states that one of the adjacent pure points has distance n−2, but adjacency to q forces all such points to have distance at least n−1; the intended contradiction with Proposition 2.11 repairs the argument, but the written proof is inconsistent. These gaps sit exactly at the load-bearing step: if Lemma 3.8 fails in some configuration, Shrink may fail to produce a smaller Jordan curve and the proof of Theorem 1.1 collapses.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper defines the space J(D) of all digital Jordan curves in a finite Khalimsky digital plane as a finite T0 topological space, using S1-parameterizations and the pointwise order on maps. The central claim is Theorem 1.1, that J(D) is path-connected, which would imply that the unreduced topological complexity TC(J(D)) is finite. The proof strategy is to show via an explicit shrinking algorithm that every Jordan curve can be connected by a fence of homotopies to a minimal Jordan curve about one of its pure interior points (Theorem 3.15), and then to connect minimal Jordan curves by explicit homotopies (Proposition 3.16). The paper also proves auxiliary results on COTS-distance in finite spaces, claims Theorem 1.2 that among several digital topologies only the Khalimsky topology makes J(D) path-connected, and gives enumerations and topological-complexity computations for small digital planes.","tokens_in":40851,"tokens_out":16859,"duration_ms":186289,"significance":"If the central results hold, this is an original and potentially useful contribution: it treats digital images as points in a configuration space and connects image morphing to topological complexity. The paper contains explicit algorithms (Algorithm 3.6), explicit homotopies between minimal Jordan curves, and useful auxiliary facts about COTS-distance such as Proposition 2.11 and Proposition 2.12. It also gives concrete small-plane enumerations that are valuable for testing conjectures. The main weakness is that the proof of the load-bearing structural lemma, Lemma 3.8, contains substantial unjustified steps, and the proof of Theorem 1.2 contains a graph-theoretic assertion that is not valid as stated. With repaired proofs, the paper would be a meaningful contribution to digital topology and finite-space topological complexity.","major_comments":[{"comment":"This is the structural fact on which the Shrink step of Theorem 3.15 depends, and its proof is not complete. After constructing β=β'∪{q}, the text asserts that 'a_{n−1} and b are both of distance n−1 from p.' For a_{n−1} this follows from Proposition 2.7, but for b the preceding argument only gives b∈A(q)−J and, in the branch under consideration, that a shortest arc from p to b does not run through q. This does not force d(p,b)=n−1; d(p,b)=n is possible, in which case β is a p-to-q path of length n+1 and the claimed contradiction with maximality does not apply. The proof also contains the existence assertion 'By performing this construction for every choice of j0, we will eventually arrive at a choice of j0 such that b∈(A(q)−J)∩Int(K),' with no argument that some choice works. The companion assertion that a_{n−1} lies in Ext(K)∩Int(J) is likewise not derived from the construction. Since Lemma 3.8 is the input that guarantees |A(q)∩J|≥3 and hence that Shrink produces a smaller Jordan curve, the proof of Theorem 3.15 and therefore of Theorem 1.1 is incomplete as written.","section":"§3.1, Lemma 3.8(a)"},{"comment":"The final inequality in part (c) is misstated. The text says that if a point of A(q) has distance n−2 from p, then 'd(p,q)=n−1<n, a contradiction.' What follows is only d(p,q)≤n−1, not equality. This is enough to contradict the choice of q as a point of maximal distance n, provided one uses the inequality rather than the displayed equality. The repair is local, but as written the sentence contains a false assertion inside the proof of a key lemma.","section":"§3.1, Lemma 3.8(c)"},{"comment":"The proof that no path exists between distinct Jordan curves in a non-Khalimsky T_{1/2} digital plane relies on the assertion that two distinct 1-chains outside a spanning tree determine different homotopy classes in the wedge of circles. This is not valid in general: in a graph-thickened digital plane, distinct simple cycles can be homologous (e.g., the two bounding cycles of a theta-shaped subgraph), so the displayed comparison of the chosen 1-chains does not imply that |K(f)| and |K(f')| lie in different classes of π1. The argument would need to compare the actual 1-cycles, not just a single outside edge for each curve. As written, Theorem 1.2 is therefore unproved. There is also a sign issue in the same proof: for a connected graph the number of circles in a wedge decomposition is 1−χ(D), not χ(D)−1.","section":"§4.1, proof of Theorem 1.2"}],"minor_comments":[{"comment":"The sentence 'but q∉Int(J)' is false because q is chosen in Int(J); the intended statement is that q∉Int(K) for the new Jordan curve K.","section":"§3.2, Theorem 3.15, step (3)"},{"comment":"The proof of Proposition 2.3 would benefit from a precise definition of the 'loop' and of the elimination procedure; as written, the existence of the lowest index i and the verification that the resulting set is a COTS-arc are only sketched.","section":"§2.1, Proposition 2.3"},{"comment":"There are numerous spelling and typographical errors that should be corrected in revision, for example 'conntected', 'Futhermore', 'reperesent', and 'worth nothing' for 'worth noting'.","section":"Throughout"},{"comment":"The notation 'J1(D)' for the space of minimal Jordan curves is introduced and used before the subsection where it is formally defined; consider defining it earlier for readability.","section":"§3.3"}],"recommendation":"major_revision","confidential_remarks":"The main risk is Lemma 3.8: the proof is intricate and the gaps sit exactly at the shrinking step that drives Theorem 1.1. I recommend asking the author to supply a fully detailed proof of Lemma 3.8, and to repair or replace the graph-theoretic argument in Theorem 1.2, before the paper is accepted."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Sam—quick take on Kandola, 1908.07015. The genuinely new thing is the setup: treating the set of COTS-Jordan curves in a Khalimsky plane as a finite space, with topological complexity as a measure of image-morphing cost. That is a real idea, and the paper makes it concrete with explicit parameterizations and a shrinking algorithm. The small-plane census and the link to Tanaka's combinatorial complexity give useful data. The novelty is not dressed-up old machinery.\n\nWhat is good: the path-connectedness claim comes with an explicit iterative shrink-to-minimal curve, and the minimal-curve homotopies in Proposition 3.16 are worked through by hand. The paper also honestly flags places where it is guessing, notably the converse of Proposition 3.22 and contractibility of interiors.\n\nThe soft spots are real. Lemma 3.8 is load-bearing, and its proof has gaps. The stress-test note is right: part (a) asserts that a_{n-1} and b both have distance n-1 from p, but the text only forces b to have distance n-1 or n, and if n then the maximality contradiction does not go through. The step where the construction is repeated over all choices of j0 until b lands in the right region is asserted, not argued. Part (c) states that an adjacent pure point has distance n-2 when adjacency would force distance at least n-1; a parity argument probably repairs it, but that repair is absent. The homotopy step in Theorem 3.15 also needs more care: for pure q, comparability works globally, but for mixed q the proof checks only the single replaced point and then claims g and f are comparable everywhere.\n\nTheorem 1.2 has its own problems. The wedge-of-circles count has a sign issue, and the claim that distinct Jordan curves give distinct homology classes in the wedge is asserted without proof. The strong conclusion that Khalimsky is the only topologically correct digital topology is not established at the paper's current level of rigor. The 5x5 enumeration is hand-drawn and should be machine-checked before anyone relies on it.\n\nWho is this for: people working in digital topology, finite spaces, or topological complexity. The core idea is sound enough that I would send it to peer review, but I would insist on a repaired Lemma 3.8, a tightened homotopy argument in Theorem 3.15, and verification of the enumerations before publication.","headline":"Original and worth engaging, but the main connectivity proof leans on a lemma with gaps that need closing before Theorem 1.1 and Theorem 1.2 can be trusted.","tokens_in":41453,"tokens_out":1834,"would_cite":false,"duration_ms":20058,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["55M30"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that the space of digital Jordan curves in a Khalimsky digital plane is path-connected, so a finite set of motion-planning rules can morph any segmented image into any other.","keywords":["digital topology","Khalimsky topology","digital Jordan curves","COTS","topological complexity","motion planning","finite topological spaces","path-connectedness"],"falsifier":"Search exhaustively through all Jordan curves of a small Khalimsky digital plane, e.g. $5\\times5$ or $6\\times6$, for a non-minimal $J$ and a pure $p\\in\\operatorname{Int}(J)$ such that some $q$ maximizing $d_{\\operatorname{Int}(J)}(p,q)$ has $A(q)\\cap J$ disconnected or of size $1$ or $2$; one such example would disprove Lemma 3.8 and with it Theorem 1.1.","tokens_in":40315,"feed_emoji":"🖼️","tokens_out":7635,"duration_ms":69911,"temperature":0.7,"pith_summary":"This paper claims that the collection of all digital Jordan curves in a sufficiently large Khalimsky digital plane forms a path-connected finite topological space, $J(D)$. If that is right, the topological complexity $TC(J(D))$ is finite: a finite list of continuous motion-planning rules is enough to transform any Jordan-curve-segmented image into any other. The proof has two steps: every Jordan curve can be shrunk through homotopies to a minimal Jordan curve surrounding one of its pure interior points, and any two minimal Jordan curves are connected by a fence of homotopies. The paper also claims that the Khalimsky topology is the only digital topology among those it considers for which the space of Jordan curves is path-connected.","feed_headline":"All digital Jordan curves morph into each other","feed_subtitle":"Path-connectedness means a finite set of motion rules can morph any segmented image into any other.","key_machinery":"The central object is the finite $T_0$ space $J(D)$ of COTS-Jordan curves in a Khalimsky digital plane, where a COTS (connected ordered topological space) is a finite model of a line segment with alternating open and closed points. The space is given a topology through the pointwise order on $S^1$-parameterizations of curves, which recovers the compact-open topology on the mapping space. The load-bearing mechanism is the shrink algorithm: fixing a pure interior point $p$, choose $q$ of maximal COTS-distance from $p$ inside the interior; Lemma 3.8 guarantees that $A(q)\\cap J$ is connected and has at least three points, which allows replacing a segment of $J$ by $q$ to produce a smaller Jordan curve homotopic to the original. Iterating reaches a minimal Jordan curve, and Proposition 3.16 supplies homotopies between minimal curves, yielding the fence that proves path-connectedness.","core_discovery":"On the paper's own terms, the central discovery is Theorem 1.1: for a sufficiently large digital plane $D$ equipped with the Khalimsky topology, the space $J(D)$ of digital Jordan curves, topologized through the pointwise order on their standard $S^1$-parameterizations, is path-connected. A path in $J(D)$ is a finite fence of homotopies, so any two Jordan curves are connected by a sequence of continuous deformations that stay inside $J(D)$; consequently $TC(J(D))$ is finite. The path is constructed algorithmically: shrink a given curve to a minimal curve $A(p)$ around a pure interior point $p$, then move between minimal curves by the homotopies of Proposition 3.16. Theorem 1.2 states that this path-connectedness fails for the Marcus-Wyse topology and for the alternative digital topologies considered, so the Khalimsky topology is the unique one among them that supports the morphing picture.","pith_inferences":["The shrink algorithm itself is an explicit motion planner: it produces a path between any two Jordan curves whose length is controlled by the size of the interior, so a practical morphing pipeline could be built directly from the proof rather than from an abstract section of the path space.","The same parameterize-and-shrink strategy might extend to digital 3-space, where the analogue of Lemma 3.8 would need a surface-adjacency condition; a failure there would mark a genuine boundary of the method.","The polyomino correspondence suggests that the number of maximal elements of $J(D)$ grows rapidly with the plane, so the finite value of $TC(J(D))$ is likely to be large even for modest image sizes.","A finite-space version of efficient topological complexity that minimizes height travelled in the Hasse diagram could turn the theorem into motion planners that produce visually intuitive morphs."],"forward_implications":["For any sufficiently large Khalimsky digital plane, $TC(J(D))$ is finite, so a finite set of local motion-planning rules suffices to morph any Jordan-curve-segmented image into any other.","Every digital Jordan curve is homotopic to a minimal Jordan curve around one of its pure interior points, and the interior of every Jordan curve is weakly contractible.","The space of minimal Jordan curves is contractible, and for the $4\\times4$ and $5\\times5$ digital planes the full space $J(D)$ is contractible with $TC(J(D))=1$.","Under the Marcus-Wyse topology and the other alternative digital topologies considered, the corresponding space of digital Jordan curves is not path-connected, which the paper takes as evidence that the Khalimsky topology is the topologically correct setting.","The exact count of Jordan curves in a $3\\times n$ digital plane is $(n-1)(n-2)/2$, and the maximal and minimal elements of $J(D)$ correspond to polyominoes, giving combinatorial bounds on the size and complexity of the space."],"supporting_citations":[{"why":"Defines the Khalimsky digital plane, COTS, and the digital Jordan curve theorem that supplies the objects studied.","marker":"[27]"},{"why":"Provides the order-topology dictionary: continuity as order-preserving maps, homotopies from comparable maps, and beat and weak point results.","marker":"[39]"},{"why":"Defines topological complexity and the motion-planning problem, giving the invariant the paper aims to show is finite.","marker":"[13]"},{"why":"Proves combinatorial complexity agrees with topological complexity for finite connected spaces, justifying the finite-space computations.","marker":"[40]"},{"why":"Supplies the background results on finite $T_0$ spaces, cores, weak points, and weak homotopy equivalences used in the shrink proof.","marker":"[3]"},{"why":"Introduces the alternative digital topologies and the $T_{1/2}$ Jordan-curve framework used in Theorem 1.2.","marker":"[41]"},{"why":"Supplies the Marcus-Wyse topology, one of the non-Khalimsky digital topologies shown to fail path-connectedness.","marker":"[32]"}],"fun_headline_variants":["Any two digital Jordan curves are connected by a path","Digital curve space: connected, so finite motion rules","Khalimsky topology uniquely enables all digital curve morphs","Morph every digital Jordan curve into every other"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof rests on Lemma 3.8, which says that from a fixed pure interior point, a farthest interior point $q$ must meet the Jordan curve in a connected set of at least three adjacent points; if that structural fact fails for some curve, the shrinking step cannot produce a smaller homotopic Jordan curve and the path-connectedness proof collapses.","fun_headline_variants_meta":{"raw":{"variants":["Any two digital Jordan curves are connected by a path","Digital curve space: connected, so finite motion rules","Khalimsky topology uniquely enables all digital curve morphs","Morph every digital Jordan curve into every other"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00039,"raw_usage":{"total_tokens":2062,"prompt_tokens":965,"completion_tokens":1097,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":581,"completion_tokens_details":{"reasoning_tokens":1042}},"tokens_in":581,"tokens_out":1097,"duration_ms":11303,"temperature":1.0,"reasoning_tokens":1042,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:30:51.775137+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Search exhaustively through all Jordan curves of a small Khalimsky digital plane, e.g. $5\\times5$ or $6\\times6$, for a non-minimal $J$ and a pure $p\\in\\operatorname{Int}(J)$ such that some $q$ maximizing $d_{\\operatorname{Int}(J)}(p,q)$ has $A(q)\\cap J$ disconnected or of size $1$ or $2$; one such example would disprove Lemma 3.8 and with it Theorem 1.1.","supporting_citations":[{"cited_title":"36 (1990), no","cited_arxiv_id":null,"evidence_quote":"Defines the Khalimsky digital plane, COTS, and the digital Jordan curve theorem that supplies the objects studied."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the order-topology dictionary: continuity as order-preserving maps, homotopies from comparable maps, and beat and weak point results."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines topological complexity and the motion-planning problem, giving the invariant the paper aims to show is finite."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Proves combinatorial complexity agrees with topological complexity for finite connected spaces, justifying the finite-space computations."},{"cited_title":"Barmak, Algebraic topology of finite topological spaces and applications, Lecture Notes in Mathematics, vol","cited_arxiv_id":null,"evidence_quote":"Supplies the background results on finite $T_0$ spaces, cores, weak points, and weak homotopy equivalences used in the shrink proof."},{"cited_title":"153 (2006), no","cited_arxiv_id":null,"evidence_quote":"Introduces the alternative digital topologies and the $T_{1/2}$ Jordan-curve framework used in Theorem 1.2."},{"cited_title":"10, 1119–1119","cited_arxiv_id":null,"evidence_quote":"Supplies the Marcus-Wyse topology, one of the non-Khalimsky digital topologies shown to fail path-connectedness."}],"review_version":1}