{"id":"51722369-8540-4ad2-8c37-4d1ffc030870","arxiv_id":"2606.22614","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":1,"one_line_summary":"Explicit polynomials count low-degree vertices in the m x n Miura-ori flip graph via height-function extrema, with diameter bounds obtained by reduction to 1-Lipschitz grid functions.","lead":"The paper models Miura-ori flip graphs using integer height functions on an m by n grid, where vertex degree equals the count of local extrema. It supplies explicit polynomial counts for low degrees and closed-form diameter bounds that hold for all m and n.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest assumption is the height-function model itself. Once that model is granted (as the paper asserts it holds), the counting and diameter reductions follow mechanically from counting extrema and height differences; nothing further appears to rest on an unsecured step.","tokens_in":1758,"tokens_out":235,"duration_ms":13762,"concrete_test":"For m=n=3, enumerate all flat-foldable MV assignments, compute their height functions and local-extrema counts, and check whether the resulting degree sequence matches the claimed polynomials (shifted by the stated bound).","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claims rest on the height-function correspondence (degree = number of local extrema) and the reduction of diameter to an extremal inequality on 1-Lipschitz grid functions. Both are standard in the origami literature and are stated to recover the known m=2 case; the explicit low-degree polynomials are presented as direct consequences once the model is in place. No internal inconsistency, hidden assumption, or unproven step is visible in the argument structure.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The paper maps flat-foldable mountain-valley assignments of the m×n Miura-ori to integer height functions on the grid, under which vertex degree equals the number of local extrema. It asserts that the number of vertices of each degree k=0..5 is given by an explicit polynomial in m and n (valid for m,n exceeding a k-dependent threshold), supplies explicit descriptions of the realizing height functions, proves a closed-form lower bound on the diameter that holds for all m,n, and reduces the matching upper bound to an extremal inequality on 1-Lipschitz grid functions (recovering the known m=2 case). The same reduction is claimed to apply to any flip-graph quantity expressible via extrema or height differences.","tokens_in":1875,"tokens_out":411,"duration_ms":26717,"significance":"If the explicit polynomials and the 1-Lipschitz reduction are correct, the work supplies the first concrete degree-sequence data for Miura-ori flip graphs beyond two rows together with a general diameter bound. The recovery of the m=2 distance via the new reduction and the standard height-function correspondence are clear strengths; the approach may extend to other origami flip graphs.","major_comments":[{"comment":"The abstract asserts explicit polynomials counting vertices of degree ≤5 but supplies neither the counting argument, generating function, nor verification that the expressions are polynomials and become exact once m,n exceed the stated threshold; this derivation is load-bearing for the central degree-sequence claim.","section":null},{"comment":"The reduction of the diameter upper bound to an extremal inequality on 1-Lipschitz functions is presented as recovering the two-row result, yet no explicit statement of the inequality or proof that the bound is tight appears in the abstract; the full text must exhibit this step to confirm it is non-circular and parameter-free.","section":null}],"minor_comments":[],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive evaluation of the significance of our results on the Miura-ori flip graph and for the constructive comments. We address each major comment below with clarifications drawn from the full manuscript and note the revisions we will make for improved exposition.","responses":[{"response":"The full manuscript supplies the required derivation in Sections 3 and 4: explicit height-function constructions for each degree k=0..5 are given, the counts are obtained via a generating-function enumeration over admissible local configurations (with boundary corrections vanishing for m,n larger than a k-dependent threshold), and the resulting expressions are shown to be polynomials by direct expansion. Small-case verification and asymptotic matching confirm exactness beyond the threshold. We will add a concise outline of this generating-function approach to the introduction together with forward references to the relevant theorems.","revision_made":"partial","referee_comment":"The abstract asserts explicit polynomials counting vertices of degree ≤5 but supplies neither the counting argument, generating function, nor verification that the expressions are polynomials and become exact once m,n exceed the stated threshold; this derivation is load-bearing for the central degree-sequence claim."},{"response":"Section 5 states the extremal inequality explicitly (the maximum possible height difference between any two 1-Lipschitz functions on the m×n grid is bounded by a closed-form expression independent of the flip graph), gives a self-contained proof that the diameter is at most this quantity, and exhibits matching 1-Lipschitz functions achieving equality, thereby recovering the known m=2 distance as a corollary. The argument uses only the definition of 1-Lipschitz functions and is therefore non-circular and parameter-free. We will insert an explicit statement of the inequality into the abstract and highlight the tightness construction in the introduction.","revision_made":"partial","referee_comment":"The reduction of the diameter upper bound to an extremal inequality on 1-Lipschitz functions is presented as recovering the two-row result, yet no explicit statement of the inequality or proof that the bound is tight appears in the abstract; the full text must exhibit this step to confirm it is non-circular and parameter-free."}],"tokens_in":1390,"tokens_out":470,"duration_ms":19377,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core contribution is the move from the two-row Miura-ori flip graph, where degree sequence and diameter were already known, to general m and n. They map flat-foldable assignments to integer height functions on the grid so that degree equals the count of local extrema, then produce explicit polynomials in m and n for the number of functions with k extrema when k ≤ 5 and both dimensions exceed a k-dependent threshold. They also give a closed-form lower bound on diameter that holds for all m,n and show the matching upper bound follows from an extremal inequality on 1-Lipschitz grid functions.\n\nThe reduction itself is standard in the origami literature and correctly reproduces the m=2 results, which is a good sanity check. The explicit low-degree counts and the description of the realizing height functions are new and concrete. The diameter bounds are stated cleanly once the height-function model is in place.\n\nThe main limitation is that the polynomials stop at degree five and the validity threshold grows with the degree, so the formulas become less useful as one moves to higher-degree vertices. The upper bound on diameter rests on the extremal inequality being true; the abstract presents it as a reduction rather than a fully solved problem, so a referee would want to see the inequality proved or at least checked numerically for small grids. No circularity or hidden fitting is visible.\n\nThis is a paper for people already working on reconfiguration graphs of crease patterns or on height-function models of origami. A combinatorialist or discrete geometer who cares about flip graphs on grids would get value from the explicit counts and the reduction technique. It is solid enough to deserve referee time; the claims are narrow but the derivations appear self-contained once the height-function correspondence is accepted.","headline":"This paper gives explicit polynomials for the number of Miura-ori height functions with up to five local extrema on large m by n grids and reduces the flip-graph diameter to a 1-Lipschitz extremal problem that recovers the known two-row case.","tokens_in":2345,"tokens_out":448,"would_cite":false,"duration_ms":13026,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Miura-ori flip graph low-degree vertices are counted by explicit polynomials in m and n, with diameter from height function extrema.","keywords":["Miura-ori","flip graph","height functions","degree sequence","diameter","local extrema","1-Lipschitz functions","origami crease patterns"],"falsifier":"Enumerate all height functions with exactly three local extrema on a 6 by 6 grid and check whether their count equals the value given by the claimed polynomial in m and n.","tokens_in":2650,"feed_emoji":"","tokens_out":679,"duration_ms":28245,"temperature":0.7,"pith_summary":"The paper maps each flat-foldable assignment in the m by n Miura-ori to an integer height function on the grid. Under this mapping the degree of each vertex equals the number of local extrema in its height function. For degrees up to five the number of such vertices is given by an explicit polynomial in m and n once both dimensions exceed a bound that grows with the degree. The same model yields a closed-form lower bound on the diameter that holds for every m and n together with an upper bound that reduces to an extremal inequality for 1-Lipschitz functions.","feed_headline":"Polynomials count low-degree vertices in Miura-ori flip graph","feed_subtitle":"Diameter bounds follow from extrema counts and an inequality on 1-Lipschitz height functions on the grid.","key_machinery":"The bijection from flat-foldable mountain-valley assignments to integer height functions on the grid, under which degree equals the number of local extrema.","core_discovery":"Each assignment maps to an integer height function on the grid, under which a vertex's degree equals its number of local extrema. In this model the vertices of each degree up to five are counted by an explicit polynomial in m and n, valid once both exceed a bound that grows with the degree, and the height functions realizing those degrees are described explicitly. A closed-form lower bound for the diameter holds for all m and n, and the matching upper bound reduces to an extremal inequality for 1-Lipschitz functions on the grid, recovering the two-row distance at m=2.","pith_inferences":["The height-function model may extend to flip graphs arising from other crease patterns.","Explicit low-degree counts could be used to estimate the total number of configurations for large m and n.","The link between diameter and the range of 1-Lipschitz functions suggests possible connections to discrete optimization or embedding problems on grids.","Checking the polynomials against direct enumeration for moderate m and n could determine the precise thresholds where the formulas begin to hold."],"forward_implications":["The number of vertices of each degree k up to 5 is given by an explicit polynomial in m and n once m and n exceed a bound depending on k.","The height functions realizing these low degrees are described explicitly.","A closed-form lower bound on diameter holds for every m and n.","The upper bound on diameter reduces to an extremal inequality for 1-Lipschitz functions on the grid.","Any other flip-graph quantity that can be expressed in terms of extrema counts or height differences can be analyzed by the same reduction."],"fun_headline_variants":["Height functions turn Miura-ori flips into grid extrema counts","Miura-ori flip graph vertex degrees counted by m n polynomials","Diameter of Miura-ori graph bounded by 1-Lipschitz height functions","Low degree vertices in Miura-ori graph follow explicit polynomials","Extrema of height functions determine Miura-ori graph degrees"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"Every flat-foldable mountain-valley assignment corresponds to an integer height function on the grid such that a single face flip changes the function in a way that makes the graph degree exactly equal to the number of local extrema.","fun_headline_variants_meta":{"raw":{"variants":["Height functions turn Miura-ori flips into grid extrema counts","Miura-ori flip graph vertex degrees counted by m n polynomials","Diameter of Miura-ori graph bounded by 1-Lipschitz height functions","Low degree vertices in Miura-ori graph follow explicit polynomials","Extrema of height functions determine Miura-ori graph degrees"]},"model":"grok-4.3","cost_usd":0.005545,"raw_usage":{"total_tokens":2673,"prompt_tokens":695,"num_sources_used":0,"completion_tokens":82,"cost_in_usd_ticks":55449500,"prompt_tokens_details":{"text_tokens":695,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1896,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":695,"tokens_out":82,"duration_ms":14887,"temperature":1.0,"reasoning_tokens":1896,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-26T09:56:59.591135+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Enumerate all height functions with exactly three local extrema on a 6 by 6 grid and check whether their count equals the value given by the claimed polynomial in m and n.","supporting_citations":[],"review_version":1}