{"id":"b26eab18-d3ac-4a98-b17c-d687726e3b00","arxiv_id":"1908.05718","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A new 16-tile curved-arc puzzle is shown to always produce an even number of loops, ruling out a single 64-arc loop and making 60 the longest possible loop.","lead":"This paper documents a new Sol LeWitt-style puzzle: 16 square tiles filled with curved arcs that form closed loops when arranged on a 4x4 torus. It proves basic facts about the loops, including a parity rule linking the number of loops to the number of crossings.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The 60-arc maximum rests on Theorem 1, whose induction excludes Case C via the Checkerboard Crossing Theorem; that lemma is only sketched and needs a rigorous proof before the central claim is fully established.","rationale":"The reader's weakest assumption is the same one I would flag: the parity theorem is load-bearing, and Theorem 2 is its unproven hinge. I agree with the reader's conditional verdict. The Theorem 3 algebraic overstatement is real but not central to the 60-arc claim, since the Section 5 four-color argument already gives divisibility by four on the even torus; I therefore do not base the verdict on it. The checkerboard gap is a proof gap, not a demonstrated falsehood; a short bipartite-graph argument repairs it, so rejection is not warranted. The recommended verdict remains conditional: accept-shaped, with the checkerboard proof (and the Theorem 3 algebra) to be corrected before the paper is treated as a rigorous reference. Because this matches the reader's assessment, no change to the verdict is needed.","tokens_in":5378,"tokens_out":11838,"duration_ms":115657,"concrete_test":"Independent re-derivation of Theorem 2: model a loop as a closed walk on the 4x4 torus grid whose moves alternate horizontal and vertical tile steps; check whether every closed walk that returns to a tile does so after an even number of steps, forcing the same entry orientation on all visits. If this derivation succeeds and covers repeated tiles and self-intersections, apply it to justify Case C and complete Theorem 1; if a walk is found that revisits a tile with opposite orientations, construct the corresponding tile assignment and exhibit the missing Case C counterexample.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central result that a single 64-arc loop is impossible depends on Theorem 1 (parity of loops and crossings), and the proof of Theorem 1 depends on Theorem 2. The checkerboard theorem is asserted in Section 4 with a short informal argument: because every arc turns 90 degrees, entry orientation flips at each tile, and 'our torus is 4x4... Therefore, the entire torus has to honor this checkerboard rule.' This does not explicitly handle loops that pass through the same tile more than once. A loop could in principle enter a tile horizontally on one visit and vertically on a later visit; the parity induction's Case C is excluded precisely by claiming this never happens. If Theorem 2 is false, a single-tile switch could change crossings without changing loop count, breaking the parity invariant and invalidating the even-loop conclusion. The gap is repairable: the tile sequence of a loop is a closed walk on the 4x4 torus grid, and since that grid is bipartite every return to a tile has even length, so the H/V orientation is the same on every visit. But that argument is not written, so the paper as submitted has an incomplete proof at the keystone of its headline claim.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper documents a puzzle proposed by Barry Cipra at MOVES 2019. Sixteen tiles, each carrying quarter-circle arcs and a four-bit label indicating which sides contain crossing points, are placed on a 4x4 torus. The authors define planar and torus loops, present configurations attaining 8 torus loops, 16 planar loops, and a 60-arc loop, and prove or sketch several structural facts. The headline claim is that, with one of each tile, the number of loops and the number of crossings have the same parity; since the portfolio has 32 crossing sides, the number of loops is even, so a single 64-arc loop is impossible and the 60-arc loop of Figure 7 is maximal. The paper also argues that all loop lengths are divisible by four, discusses a right-of-way convention that produces alternating over/under weaves, and sketches variants involving edge loops and magic squares.","tokens_in":5583,"tokens_out":15031,"duration_ms":139604,"significance":"If the proofs are made rigorous, the paper makes a modest but genuine contribution to recreational mathematics. The parity invariant is elegant and gives a sharply falsifiable prediction (the largest loop is 60), and the explicit Figure 7 example supports it. The paper is written in an inviting, exploratory style, and the online availability of the puzzle is a plus. The central derivation is not circular: Theorem 1 is an induction over tile flips and Theorem 2's checkerboard fact is a property of closed alternating walks on the torus, not an assumed conclusion. However, the proof of Theorem 2 is too sketchy to support the parity theorem as written, and the algebra in Theorem 3 is incorrect. Neither issue is fatal, since the needed repairs are short and local, but they are necessary before the claims can be regarded as proven.","major_comments":[{"comment":"The proof as written does not establish the global checkerboard because it does not treat loops that pass through the same tile more than once. The sentence \"Our torus is 4x4, or 8x8 if you were to count arc steps. Therefore, the entire torus ... has to honor this checkerboard rule\" assumes that a loop's entry direction is a well-defined label on each tile, but a loop could in principle enter a tile horizontally on one visit and vertically on a later visit. The missing step is to observe that the sequence of tile centers traversed by a loop is a closed walk on the bipartite graph C4 x C4; every closed subwalk from a tile back to itself has even length, and since each tile traversal flips horizontal/vertical entry, the entry orientation is the same on every visit. Please add this or an equivalent argument; without it, the exclusion of Case C in Theorem 1 is unjustified.","section":"Section 4, Theorem 2"},{"comment":"The derivation of the \"Solved Balancing Equations\" is invalid. The displayed equations give A+A'=C+C' and A+C=A'+C' (and the analogous B/D equations), but these imply only A=C' and A'=C (and B=D', B'=D), not the stronger A=A'=C=C' and B=B'=D=D'. The inference \"Let ... 2x ... 2y which means that x=y\" is not forced by the earlier equations. Thus the proof that the total number of arcs is divisible by four is incomplete as written. This can be repaired either by using additional properties of the transition graph (e.g., the even number of inflection points) or by relying on the four-coloring argument earlier in Section 5 for the torus setting; the 60-arc conclusion does not depend on this theorem alone.","section":"Section 5, Theorem 3"},{"comment":"The induction step is only a sketch. The authors present Cases A and B as the only ways a single-tile switch changes the loop count, and Case C as impossible, but they do not explain why these three cases exhaust all possible local configurations, nor do they formally connect a digit flip to the rewiring in Figures 8-10. A rigorous proof should either enumerate the local configurations or provide a general argument that a single crossing toggle changes the number of loops by +/-1 in the two cases shown and cannot change it in any other way. As it stands, the parity theorem should be regarded as an outline, not a complete proof.","section":"Section 4, proof of Theorem 1"}],"minor_comments":[{"comment":"The word \"termanating\" should be \"terminating\".","section":"Section 1"},{"comment":"There are several typos: \"configuartion\" should be \"configuration\", \"argments\" should be \"arguments\", \"subtracing\" should be \"subtracting\", and \"analsis\" should be \"analysis\".","section":"Sections 3-6"},{"comment":"The statement that the one-of-each portfolio has even crossing parity should be made explicit: there are 16 four-bit labels, so exactly 32 sides carry a crossing bit, hence the even parity.","section":"Section 4"},{"comment":"The decomposition of loops into Types I-IV is informal; it would help to spell out what \"decomposable\" means or to mark this classification as heuristic rather than a formal proof.","section":"Section 5"},{"comment":"The proof of Theorem 4 covers one entry case and then says the remaining four paths are similar; a short description or additional figure for the remaining cases would improve readability.","section":"Section 6"},{"comment":"Reference [3] is a Wikipedia page; a standard published reference on Gray codes would be more appropriate for a formal document.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The paper is a short recreational note, and the incomplete proof of Theorem 2 is the main obstacle. The repair is short and standard, so I see this as a major revision rather than a rejection. I would also ask the authors to fix Theorem 3's algebra or explicitly state that the four-coloring proof in Section 5 is the operative proof for the torus claim. Given the journal's audience, I would not require a fully formal case enumeration for Theorem 1, but the current three-case sketch needs at least a sentence explaining the exhaustiveness."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nQuick take: this is a genuinely fun recreational-math writeup that deserves a referee, but not as-is. The headline claim—that a single 64-arc loop is impossible, so the best you can do is 60—is probably true, and the parity theorem that carries it is a nice little result. But the proof has two soft spots that need work before I'd treat this as a rigorous reference.\n\nWhat's new: the tile set itself, the parity theorem (loop count and crossing count have the same parity), the checkerboard entry-orientation observation, the divisibility-by-four result for loop lengths, and the weave theorem for right-of-way bridges. None of that is in the cited references. The paper does a good job of inviting the reader to play, and the figures carry the exposition. For a puzzle paper, the authors are honest about what is experimental and what is proved.\n\nWhere it breaks down:\n\nTheorem 2 (Checkerboard Crossing) is the keystone. It is asserted with a short informal argument that a 4x4 torus forces a global checkerboard of H/V entries. The sketch does not explicitly handle a loop that visits the same tile more than once—could it enter horizontally on one visit and vertically on another? The gap is repairable: the tile-to-tile walk is a closed walk on a bipartite grid, so every revisit happens after an even number of steps, and since each arc flips the entry orientation, the orientation is consistent. But that argument is not in the paper, and Theorem 1's induction excludes Case C using Theorem 2, so the parity theorem is not fully proven.\n\nTheorem 3 (Net zero deflection) has an algebraic overstatement. From the balancing conditions and the bipartite condition, the paper claims A=A'=C=C'. That does not follow; the equations give A=C' and A'=C, not pairwise equality. So the \"Solved Balancing Equations\" are not solved, and the divisibility-by-four proof for these loops is incomplete. The conclusion may still be true, but the argument as written is wrong.\n\nThe parity induction in Theorem 1 is also a sketch—cases A and B are clear from the figures, but the case analysis is not formal.\n\nNone of this sinks the paper. The central claims look correct, the flaws are local and fixable, and the puzzle is worth documenting. This is exactly the sort of paper a good referee can help: send it out, ask for a real proof of Theorem 2 and a corrected Theorem 3.\n\nWho is it for? Recreational mathematicians, puzzle designers, and anyone working on Sol LeWitt-style tiling variants. If that is your area, it is worth a read; otherwise you can enjoy the figures and move on.\n\nMy recommendation: accept for peer review, with revision expected.","headline":"A fun recreational puzzle paper whose central parity theorem is probably right, but the keystone checkerboard proof is sketched and the algebra in Theorem 3 overstates what follows; worth refereeing, not desk-rejecting.","tokens_in":6084,"tokens_out":4382,"would_cite":false,"duration_ms":38611,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["00A08"],"pacs":[],"model":"deepseek-v4-flash","headline":"In this 4-by-4 toroidal tile puzzle, the number of loops and the number of crossings always have the same parity, ruling out a single 64-arc loop.","keywords":["Sol Lewitt puzzle","torus loops","parity theorem","loop length","Gray code","right-of-way weaving","combinatorial puzzle","recreational mathematics"],"falsifier":"Run an exhaustive computer search over all placements of the sixteen tiles on the $4\\times4$ torus, with the original orientations, and look for any configuration with an odd number of loops or with a single loop of length 64; any such configuration would refute the Parity Theorem and the claim that 60 is the maximum loop length.","tokens_in":5142,"feed_emoji":"🌀","tokens_out":9668,"duration_ms":87443,"temperature":0.7,"pith_summary":"This paper studies a tile puzzle inspired by Sol Lewitt's Fifteen Etchings: sixteen square tiles, each side marked as crossing or non-crossing, are placed on a $4\\times4$ torus so every curve closes into a loop. The authors prove a Parity Theorem: in any arrangement, the number of loops and the number of crossings have the same parity. Because the original tile set contains one tile of each of the sixteen binary types, the total number of crossings is even, so the number of loops is even; in particular a single loop using all 64 arcs is impossible. The paper exhibits a configuration with a 60-arc loop and a 4-arc loop, making 60 the largest possible loop length, and proves that every loop length is divisible by four. It also shows that marking crossings by a right-of-way rule makes the loops weave over-under consistently.","feed_headline":"Sol Lewitt puzzle's loops always come in pairs","feed_subtitle":"An even number of crossings forces an even number of loops, capping the longest loop at 60 arcs.","key_machinery":"The load-bearing identity is the congruence $L \\equiv C \\pmod 2$, where $L$ counts loops and $C$ counts crossings. The proof mechanism is the local tile switch: replacing non-crossed arcs with crossed arcs (or the reverse) changes both $L$ and $C$ by one in the same direction, preserving parity; the Checkerboard Crossing Theorem supplies the missing Case C exclusion by forcing a global alternation of horizontal and vertical entries once a loop direction is chosen. For divisibility by four, the machinery is a bipartite cube whose eight corners are the oriented arc types, with allowed transitions as edges; the loop's arc counts must satisfy the bipartite, zero-deflection, and balancing equations, which force $A=A'=C=C'$ and $B=B'=D=D'$, so the total length is $4x+4y$ and therefore divisible by four.","core_discovery":"The central discovery is Theorem 1, the Parity Theorem: the number of loops and the number of crossings have the same parity in every toroidal arrangement of the tiles. The proof proceeds by switching individual tiles between non-crossed and crossed arcs, using three cases: Case A merges two loops into one while adding a crossing; Case B splits one loop into two while adding a crossing; Case C, which would add a crossing without changing the loop count, is shown impossible by the Checkerboard Crossing Theorem. That theorem asserts that once a loop's direction is chosen, the loop enters tiles alternately from horizontal and vertical sides, forcing a checkerboard pattern over the whole $4\\times4$ torus. Since the portfolio has one tile of each binary type, its crossings sum to an even number, so the loop count must be even; a single 64-arc loop is therefore impossible, and the manually found 60-plus-4 configuration gives the maximum. A separate argument using a bipartite cube of the eight oriented arc types shows every zero-net-deflection loop has length divisible by four.","pith_inferences":["The same logic would predict that a different 16-tile set whose binary labels sum to an odd number must produce an odd number of loops, so a single 64-arc loop could then be possible; a search over alternative portfolios would test this.","The checkerboard theorem depends on the torus having even side lengths; on odd-sized tori the alternating horizontal/vertical pattern would fail to close, so the parity result may not transfer to other board shapes.","Reading the right-of-way markings as over/under information turns the loops into alternating links on the torus; checking how many alternating torus links are realizable by these tiles would connect the puzzle to knot theory."],"forward_implications":["No arrangement of the original sixteen tiles on the $4\\times4$ torus can produce a single loop of all 64 arcs; the largest possible loop is 60 arcs, with the remaining four arcs forming a separate small loop.","Every valid arrangement has an even number of loops, since the total number of crossings in the one-of-each-tile portfolio is even.","Every loop, whether planar or torus, has length divisible by four, because arcs alternate column and row changes and because zero-net-deflection loops satisfy balanced arc-count equations.","Marking each crossing with the right-of-way rule makes every loop alternate over and under at successive crossings, producing a consistent weave."],"supporting_citations":[],"fun_headline_variants":["Even crossings force even loops in Sol Lewitt puzzle","No single 64-arc loop: max is 60 plus 4","Sol Lewitt puzzle loops: parity caps longest loop at 60","Loop count matches crossing count in Sol Lewitt tiling","Checkerboard trick proves even loops in Sol Lewitt puzzle"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The parity proof assumes the Checkerboard Crossing Theorem: once a loop's direction is chosen, every tile it enters is entered alternately from a horizontal side and a vertical side, so the whole $4\\times4$ torus is forced to carry one checkerboard pattern and the Case C switching scenario cannot occur.","fun_headline_variants_meta":{"raw":{"variants":["Even crossings force even loops in Sol Lewitt puzzle","No single 64-arc loop: max is 60 plus 4","Sol Lewitt puzzle loops: parity caps longest loop at 60","Loop count matches crossing count in Sol Lewitt tiling","Checkerboard trick proves even loops in Sol Lewitt puzzle"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000522,"raw_usage":{"total_tokens":2455,"prompt_tokens":808,"completion_tokens":1647,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":424,"completion_tokens_details":{"reasoning_tokens":1561}},"tokens_in":424,"tokens_out":1647,"duration_ms":11675,"temperature":1.0,"reasoning_tokens":1561,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:07:02.401283+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run an exhaustive computer search over all placements of the sixteen tiles on the $4\\times4$ torus, with the original orientations, and look for any configuration with an odd number of loops or with a single loop of length 64; any such configuration would refute the Parity Theorem and the claim that 60 is the maximum loop length.","supporting_citations":[],"review_version":1}