{"id":"7450b4c7-c8a1-4a7b-89fb-165d379b8073","arxiv_id":"2411.10207","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A workshop report describing three gamified research outreach activities and claiming new extremal fence results whose proofs are deferred to an unpublished companion paper.","lead":"This paper reports on three mathematics outreach activities that turn active research problems into games, including a collaborative pentomino-fence game developed at a workshop. It also states new results on extremal fence problems, with proofs deferred to an as-yet-unpublished companion paper.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Central extremal counts are unverifiable as written: Proposition 3.3 defers to an unpublished companion paper, and Appendix A's proof rests on an unproved geometric-forcing assertion.","rationale":"The paper is primarily an outreach/gamification report, and Sections 2–3.3 are honest and descriptive; the authors explicitly say they are not offering a rigorous evaluation of gamification. The tension is concentrated in Section 3.2 and Appendix A, where new extremal results are claimed. For a math.HO preprint, a conditional verdict is appropriate: the outreach narrative can stand, but the mathematical propositions are the only falsifiable content. The single most load-bearing assumption is the geometric forcing in the tetromino proof, because the appendix is presented as the accessible proof of the method and is the only mathematical argument actually contained in the paper. If that assertion is unjustified, the paper gives no reason to trust the deferred pentomino proof either. I do not see an internal contradiction that forces REJECT: the claimed counts are plausible and the appendix points to a real search. The right move is to keep the reader's CONDITIONAL verdict and require either full proofs or clear status as summaries of [14] before the mathematical claims are treated as verified.","tokens_in":11327,"tokens_out":10028,"duration_ms":102570,"concrete_test":"Perform an independent exhaustive search over all rook-connected configurations of the five tetrominoes in an 8×8 grid (enforcing the two-neighbour rule), compute the maximum enclosed area and count of optima, and compare with area 9 and 21. In parallel, obtain [14] or the ILP solver and verify that Proposition 3.3's proof contains a complete derivation of Lemma 3.2 and reproduces exactly 1440 solutions of area 128. If either check fails, the extremal claims should be downgraded until a complete proof is available.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's strongest mathematical content is Proposition 3.3: the pentomino fence problem has 1440 optimal solutions with area 128. The proof is not in this manuscript: it is deferred entirely to the unpublished companion paper [14], and the lemma on which the board size rests (Lemma 3.2, isotopy to a circle/20×20 board) is quoted without proof. The appendix intended to illustrate the method (Proposition A.1) also does not constitute a proof. After summing piece 'lengths' to 18, the argument asserts without derivation that the only circumscribing rectangles to consider are 5×4, 4×4, 5×3, and 3×4, and that 'due to the geometry of the pieces o and n, there will always be 3 tiles from the perimeter inside the inner area.' This geometric forcing is the load-bearing step separating area 9 from area 12; if a different rectangle or a different placement of o/n escapes the stated classification, the maximum and the count of 21 could change. The 'brute force' enumeration of the 21 solutions is also not described or made reproducible. The claims may be true, but the preprint does not allow a reader to verify them.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript reports on the authors' experiences turning active research topics in discrete and computational geometry and topology into outreach games, presenting three case studies: DominatriX (domination on polyominoes), Cubical Sliding Puzzles, and the Fence Challenge with the collaboratively designed game Le Carré du Diable. In addition to the outreach narrative, the paper states two mathematical results: Proposition 3.3, asserting that the pentomino fence problem has 1440 optimal solutions with enclosed area 128, and Proposition A.1, asserting that the tetromino fence problem has 21 maximal-area solutions with area 9. The proof of the pentomino result is deferred entirely to the unpublished companion paper [14], while Appendix A attempts a proof of the tetromino case. The outreach sections are detailed and include publicly accessible games and software.","tokens_in":11612,"tokens_out":7467,"duration_ms":70259,"significance":"If the stated extremal results are correct, Proposition 3.3 provides a complete enumeration of optimal pentomino fences, strengthening Shimauchi's maximal-area proof, and the tetromino count in Proposition A.1 is a small but novel extremal result. The gamification narrative is a genuine strength: the paper gives concrete, reproducible outreach materials (web games, an area-computation tool, and a workshop protocol) and it is explicit about design principles such as accessibility and horizontality. However, the mathematical content as written is not verifiable: the main pentomino proof is absent, the supporting lemma is unproved, and the appendix's proof contains unsubstantiated geometric assertions and an undocumented brute-force count. The outreach contribution alone could sustain a paper, but the mathematical claims need to be either fully proved and reproducible or explicitly separated from the paper's own contributions.","major_comments":[{"comment":"Lemma 3.2 and Proposition 3.3 are the load-bearing mathematical claims of the paper, but neither is proved in the manuscript. The lemma (any optimal pentomino fence isotopic to a circle fits on a 20×20 board) is quoted without proof, and the proof of Proposition 3.3 is deferred entirely to the unpublished companion paper [14]. As written, a reader cannot verify the claimed 1440 optimal solutions or the board-size bound, and the self-citation to work in preparation makes the central result uncheckable. The authors should include a full proof, make [14] publicly available and cited with a stable reference, or clearly label these as external results from work in preparation rather than as new results of this paper.","section":"§3.2"},{"comment":"The computation of the maximum perimeter of a tetromino fence as 18, obtained by summing per-piece 'lengths', is not rigorously justified. The definitions of 'progression' and 'protrusion' are informal, and the text does not prove that the perimeter of any valid assembled fence is bounded by the sum of these per-piece quantities. Since the bound 18 is the starting point of the entire upper-bound argument, this step needs a precise statement and proof before the subsequent area bound can be accepted.","section":"Appendix A"},{"comment":"The proof asserts without derivation that the only circumscribing rectangles to consider are 5×4, 4×4, 5×3, and 3×4. The text does not define whether 'circumscribing rectangle' refers to the bounding box of the fence, of the enclosed area, or of the entire configuration, and it does not explain why other rectangles with the same perimeter, such as 6×3, are excluded. This ambiguity makes the enumeration of cases incomplete and prevents the reader from checking that all possible geometries have been considered.","section":"Appendix A"},{"comment":"The two steps that separate the upper bound 9 from the possible 12 are the geometric-forcing assertion and the brute-force enumeration. The claim that 'due to the geometry of the pieces o and n, there will always be 3 tiles from the perimeter inside the inner area' is stated without proof, and the subsequent statement that the 21 solutions were found by brute force does not describe the algorithm, the search space, or the verification procedure (footnote 3 defers to [14]). Both steps are load-bearing and must be substantiated for Proposition A.1 to be considered proved.","section":"Appendix A"}],"minor_comments":[{"comment":"In Definition 3.1, 'poly-ements' appears to be a typo for 'poly-elements'.","section":"§3.2"},{"comment":"The name 'Shimaushi' on page 7 is a typo for 'Shimauchi', as used in references [20] and [21].","section":"§3.1 and references"},{"comment":"The appendix title contains 'explantations', which should be 'explanations'.","section":"Appendix B"},{"comment":"Figure 11 is referenced in Section 3.1 but appears only in Appendix B; consider adding an explicit cross-reference at the first mention.","section":"§3.1"}],"recommendation":"major_revision","confidential_remarks":"The paper's main mathematical claims are deferred to a self-cited unpublished work [14], and the appendix proof has gaps that are not cosmetic but central to the claimed results. The outreach contribution is solid and could justify publication after the mathematical claims are either fully proved within the manuscript or clearly repositioned as external/context. I would advise the editor to request the complete proof or a verifiable computational artifact (code with exact counts) before considering acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take on arXiv:2411.10207. The paper is a workshop report on gamifying three research topics. The strongest part is the honest, concrete description of the outreach activities—DominatriX, Cubical Sliding Puzzles, and The Fence Challenge—and the collaborative game Le Carré du Diable. The authors clearly state they are not doing a rigorous evaluation of gamification, and they give useful design principles. That part is credible and worth reading if you do math outreach.\n\nThe mathematical core is the problem. Proposition 3.3 (1440 solutions, area 128 for the pentomino fence) is a real-sounding result, but the proof is entirely in the authors' unpublished companion paper [14], and the supporting Lemma 3.2 is quoted without proof. The appendix on the tetromino fence is meant to illustrate the method, and it does contain a new result (21 solutions, area 9), but the proof has a gap. After bounding the perimeter by 18, the argument asserts without derivation that the only circumscribing rectangles to consider are 5×4, 4×4, 5×3, and 3×4, and that the geometry of pieces o and n forces 3 tiles of the perimeter inside the inner area. That forcing is the step that separates area 9 from area 12, and it is not proven. The brute-force count of 21 solutions is also not documented or made reproducible.\n\nNone of this means the results are false. The tetromino claim might well be right; the pentomino count is consistent with Shimauchi's maximum. But as written, the central math claims are unverifiable without going to [14], and even the appendix's sketch has a load-bearing assertion. The stress-test note is fair; I don't think it's overstated.\n\nThe paper would be much better if Section 3.2 were explicitly framed as a summary of [14] (with the proof deferred and clearly marked as such), and if the tetromino proof were expanded to justify the rectangle classification and the o/n forcing step, with the enumeration described or archived. The outreach content doesn't need that level of rigor, and the authors are appropriately modest about it.\n\nWho is this for? People who do math outreach and want concrete, well-documented activities; recreational mathematicians interested in polyform fence problems. It deserves a serious referee, but the referee should ask for major revision on the math side. I would not cite it in my own work until the companion paper is available.","headline":"An honest outreach write-up with a small new tetromino result that the preprint doesn't actually prove, and a pentomino result deferred to an unpublished companion paper.","tokens_in":12086,"tokens_out":2279,"would_cite":false,"duration_ms":22587,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["00A08","05B50","52C20"],"pacs":[],"model":"deepseek-v4-flash","headline":"Research-level geometry can be packaged as collaborative games, and the Fence Challenge in particular yields exact extremal counts: 1440 optimal pentomino fences enclosing 128 tiles and 21 optimal tetromino fences enclosing 9.","keywords":["gamification of research","polyomino fence","tetromino fence problem","pentomino fence problem","isoperimetric problem","outreach mathematics","Le Carré du Diable","extremal combinatorics"],"falsifier":"Run an exhaustive computer search over all rook-connected placements of the five tetrominoes on a $6 \\times 6$ or larger grid: if any fence encloses 10 or more unit squares, Proposition A.1 is false; if the number of distinct 9-tile fences is not 21, the enumeration claim fails. The same search could independently verify the pentomino count by enumerating optimal configurations inside a $20 \\times 20$ board.","tokens_in":1780,"feed_emoji":"🧩","tokens_out":1872,"duration_ms":80913,"temperature":0.7,"pith_summary":"This paper argues that research-level mathematics and computer science can be turned into games that let the public touch open problems, and that the exercise can feed new mathematics back into the research process. Its concrete evidence is the Fence Challenge, a collaborative isoperimetric puzzle in which players arrange polyominoes to enclose the largest possible area. The paper reports two extremal results from this line of work: the classic pentomino fence problem has exactly 1440 optimal solutions, each enclosing 128 grid cells, and the five-tetromino version posed in the introduction has exactly 21 optimal solutions, each enclosing 9 cells. If the results hold, the pentomino count completes the Japanese-language maximality proof with a full enumeration, and the tetromino result becomes a small new extremal theorem in polyform geometry. The paper also presents design principles for turning open research questions into accessible outreach activities.","feed_headline":"Pentomino fence puzzle: 1,440 optimal solutions, 128 tiles each","feed_subtitle":"The same fence game, played with five tetrominoes, is proved to max out at 9 enclosed tiles.","key_machinery":"The central object is a fence: a polyform made from all poly-elements of a given size in which every piece has two edge-neighbours, enclosing a set of grid cells; the paper also imposes that optimal fences be isotopic to a circle so they enclose one area with no spurious topology. The argument-carrying mechanism in the tetromino proof is a length/protrusion accounting: each tetromino is assigned a direction, a progression (how many tiles it extends in that direction), and a protrusion (how many tiles extend sideways), whose sum gives the piece's contribution to the perimeter. Summing the five contributions caps the perimeter at 18, which forces any enclosing rectangle to be among $5 \\times 4$, $4 \\times 4$, and $5 \\times 3$; the geometric forcing of the o and n pieces then cuts the naive 12-tile interior of the $5 \\times 4$ rectangle down to 9.","core_discovery":"The paper's central discovery is that a deceptively simple fence-building puzzle, in which a fixed set of tetrominoes or pentominoes must form a rook-connected closed fence around the largest possible enclosed area, carries real extremal geometry. It states that the pentomino fence problem has 1440 distinct optimal solutions, all enclosing 128 tiles, with the proof deferred to the companion manuscript [14]; and it gives a self-contained proof that the five tetrominoes i, l, n, o, t enclose at most 9 tiles, with exactly 21 optimal configurations. The tetromino proof bounds the total perimeter achievable by the pieces at 18, restricts the circumscribing rectangle to $5 \\times 4$, $4 \\times 4$, or $5 \\times 3$, and argues that the geometry of the o and n pieces always sacrifices three perimeter tiles to the interior, leaving 9 as the maximum enclosed area. The same problem becomes a collaborative game, Le Carré du Diable, whose $20 \\times 20$ board is justified by the lemma that any optimal pentomino fence isotopic to a circle fits on such a board.","pith_inferences":["As an editorial extension, the same perimeter/protrusion accounting could be turned into a general upper-bound recipe for polyform fences on triangular and hexagonal tessellations, which the paper mentions but does not carry through.","As an editorial extension, the hand-waved geometric forcing in the tetromino proof is a natural target for a machine-checkable certificate, replacing the verbal step with an exhaustive finite verification.","As an editorial extension, the collaborative game could serve as a human-guided search heuristic for hard fence instances, and game logs could be mined for near-optimal patterns that an ILP solver might miss.","As an editorial extension, the feedback-loop claim suggests a testable prediction: systematically recording participant-generated configurations in Fence Challenge sessions should occasionally yield variants that prompt new research questions, not just new game levels."],"forward_implications":["If the pentomino count is right, the 128-tile maximum has a complete enumeration of all 1440 optimal fences, settling the count for the classic pentomino farm puzzle.","The tetromino fence maximum of 9 with 21 solutions becomes a new small extremal result, and the length/protrusion perimeter-bounding technique can be applied to other small polyform sets.","The $20 \\times 20$ board bound justifies the physical game board: any optimal pentomino fence can be played on a standard Blokus-sized board, making the research problem directly playable.","The game Le Carré du Diable gives a concrete collaborative format in which players collectively search for optimal fences, with 128 as the maximum score and 125 described as exceptional.","The feedback loop described in the paper, from research questions to game design and back to algorithmic tools, suggests that outreach activities can steer research directions."],"supporting_citations":[{"why":"The companion manuscript where the pentomino proof, the ILP solver, and the computational enumerations are presented.","marker":"[14]"},{"why":"Contains the original Japanese maximality proof that the companion paper translates and adapts.","marker":"[20]"},{"why":"Introduced the pentomino farm problem in 1968, the historical starting point of the Fence Challenge.","marker":"[7]"},{"why":"The Mathematical Games column that popularized the puzzle and reported the maximal solution that the paper's count confirms.","marker":"[9]"},{"why":"A later book version of the same Japanese proof, cited as another source for the translation.","marker":"[21]"}],"fun_headline_variants":["Fence puzzle: 1,440 ways to enclose 128 tiles exactly","Tetromino fence puzzle caps enclosed area at 9 tiles","Le Carré du Diable board size proven via optimal pentomino fence","Gamified geometry: pentomino fence yields 1,440 perfect solutions"],"cache_read_input_tokens":14208,"weakest_assumption_plain":"The load-bearing premise is the unproved geometric forcing that the o and n tetrominoes always push three perimeter tiles into the interior of a $5 \\times 4$ rectangle, and, for the pentomino result, the unproved lemma that any optimal fence can be assumed circular and placed on a $20 \\times 20$ board.","fun_headline_variants_meta":{"raw":{"variants":["Fence puzzle: 1,440 ways to enclose 128 tiles exactly","Tetromino fence puzzle caps enclosed area at 9 tiles","Le Carré du Diable board size proven via optimal pentomino fence","Gamified geometry: pentomino fence yields 1,440 perfect solutions"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001419,"raw_usage":{"total_tokens":5744,"prompt_tokens":976,"completion_tokens":4768,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":592,"completion_tokens_details":{"reasoning_tokens":4686}},"tokens_in":592,"tokens_out":4768,"duration_ms":36831,"temperature":1.0,"reasoning_tokens":4686,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T19:50:38.472947+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run an exhaustive computer search over all rook-connected placements of the five tetrominoes on a $6 \\times 6$ or larger grid: if any fence encloses 10 or more unit squares, Proposition A.1 is false; if the number of distinct 9-tile fences is not 21, the enumeration claim fails. The same search could independently verify the pentomino count by enumerating optimal configurations inside a $20 \\times 20$ board.","supporting_citations":[{"cited_title":"Langlois-Rémillard, M","cited_arxiv_id":null,"evidence_quote":"The companion manuscript where the pentomino proof, the ILP solver, and the computational enumerations are presented."},{"cited_title":"Pentomino farm","cited_arxiv_id":null,"evidence_quote":"Contains the original Japanese maximality proof that the companion paper translates and adapts."},{"cited_title":"Pentomino farms","cited_arxiv_id":null,"evidence_quote":"Introduced the pentomino farm problem in 1968, the historical starting point of the Fence Challenge."},{"cited_title":"Mathematical Games","cited_arxiv_id":null,"evidence_quote":"The Mathematical Games column that popularized the puzzle and reported the maximal solution that the paper's count confirms."},{"cited_title":"Shimauchi","cited_arxiv_id":null,"evidence_quote":"A later book version of the same Japanese proof, cited as another source for the translation."}],"review_version":1}