{"id":"d462e8b2-6b0f-4475-8147-36f4c1e455f4","arxiv_id":"2411.12998","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every snowflake graph is conservative exactly when its edge count is 0 or 3 modulo 4, and large two-nested-cycle graphs admit matching graceful or near-graceful labelings.","lead":"The paper proves a complete balance-labeling rule for snowflake trees, and constructs explicit number labelings for a family of two-layered cycle graphs. The significance is mostly within graph labeling theory, where Eulerian graphs that admit graceful labelings are rare and valuable.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 4.16's decomposition of arbitrary non-even snowflakes is asserted without proof; as written it does not cover stars of size 1 or 2, so Theorem 4.17 is not established for all snowflakes.","rationale":"The reader's weakest-assumption analysis identifies Lemma 4.16's decomposition claim as load-bearing for Theorem 4.17, and I agree. My stress-test adds a sharper point: the decomposition is not merely unproved; it has an unstated feasibility condition. For star sizes at least 3, the decomposition is elementary and should be stated as a lemma; for sizes 1 or 2 it is false. Since Theorem 4.17 inherits Lemma 4.16, the full characterization of arbitrary snowflakes is conditional on either excluding small stars or supplying a different reduction. This does not by itself show the motivating semidual result is false, because a semidual of two nested cycles has no degree-2 vertices; it shows the written proof is incomplete. The separately flagged issue that Theorem 2.1 leaves Cases 2-4 to 'similar' arguments is also real, but it is secondary to the snowflake characterization. I therefore keep the reader's CONDITIONAL verdict rather than moving to ACCEPT or REJECT.","tokens_in":17807,"tokens_out":12071,"duration_ms":124513,"concrete_test":"Construct the snowflake C_{2,3} (one star of size 2 and one star of size 3, with a leaf of each identified at the center) and check whether it admits a representation as a minimum snowflake C_{3n1,5n2,6n3,4n4} with stars of sizes divisible by 4 attached at non-center vertices. If no such representation exists, Lemma 4.16 is false under the stated definitions, and Theorem 4.17 needs either a corrected decomposition or an explicit restriction of 'snowflake' to stars of size at least 3. As a second check, supply a short proof for n_i >= 3 by writing each n_i = r_i + 4q_i with r_i in {3,4,5,6} and verifying all residue classes.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 4.17 is the main structural result, and its proof sends every non-even snowflake through Lemma 4.16. That lemma asserts, without proof, that any non-even snowflake is obtained by attaching to a minimum snowflake C' = C_{3n1,5n2,6n3,4n4} a galaxy of stars whose sizes are multiples of 4, at vertices other than the center. The natural justification would be to reduce each star size n_i modulo 4, writing n_i = r_i + 4q_i with r_i in {3,4,5,6}; this works only when every n_i is at least 3. Definition 4.1, however, defines a snowflake from an arbitrary galaxy and places no lower bound on star sizes. If a star of size 1 or 2 is present, its size cannot be obtained from {3,4,5,6} by adding a multiple of 4, so the decomposition is false as stated. For example, C_{2,3} is a non-even snowflake but cannot be written as a minimum snowflake plus attached stars of sizes divisible by 4. If the authors intended to exclude size-1 and size-2 stars, that restriction is unstated, and it goes beyond the explicit definition of snowflake. The proof of Theorem 4.17 therefore rests on an unproved, domain-dependent decomposition claim. In the semidual setting of two nested cycles, degree-2 vertices are indeed absent, so the main motivating application may survive, but the theorem as stated for all snowflakes is not fully proved.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper addresses two related graph-labeling questions. Theorem 2.1 asserts that for every m1 ≥ 3 and every m2 ≥ m1(2m1−1), there is a two nested cycles plane graph that is graceful if m1+m2 ≡ 0 or 3 (mod 4) and near-graceful if m1+m2 ≡ 1 or 2 (mod 4). The second main result, Theorem 4.17, asserts that every snowflake (a tree obtained by identifying one leaf from each of a disjoint family of stars) of size M is conservative when M ≡ 0 or 3 (mod 4) and near-conservative otherwise. The proofs are constructive and rely on Skolem systems and attachment lemmas from the literature, connecting conservativeness of snowflakes with gracefulness of two nested cycles via the semidual construction.","tokens_in":18226,"tokens_out":7701,"duration_ms":111965,"significance":"If completed, the results would provide a clean semidual obstruction and a new infinite family of graceful Eulerian plane graphs, which is notable because most previously studied graceful cycles with chords are non-Eulerian. The paper is explicitly a first approach and has the virtue of giving explicit labelings in the written cases. The reliance on [13] and [16] is not circular: the new statements are existence results with explicit constructions. However, the manuscript as submitted does not establish the full theorems, because several load-bearing case analyses are omitted and one decomposition lemma is false on its stated domain.","major_comments":[{"comment":"Only Case 1 of the four-case construction is proved. Cases 2, 3, and 4 are dismissed with the statement that the analysis is similar and omitted; but the theorem's near-graceful conclusions for m ≡ 1, 2 (mod 4) rest on Cases 2 and 4, and Case 3 covers a parity subcase of the graceful conclusion. The examples in Figures 2–5 illustrate only m1 = 3 and m1 = 4 and do not constitute a proof for all parameters. The omitted cases must be written out or replaced by a uniform argument that covers all four parity combinations.","section":"Section 2, proof of Theorem 2.1"},{"comment":"The decomposition used in the proof of Lemma 4.16 is not valid for all snowflakes allowed by Definition 4.1. Definition 4.1 permits stars of any positive size, while a minimum snowflake uses only sizes 3, 4, 5, 6 and the attached stars are required to have sizes divisible by 4. A snowflake containing a star of size 1 or 2 cannot be represented in this form: for instance C_{2,3} has size 5, is non-even (it has an internal vertex of degree 3), and admits no decomposition into a minimum snowflake plus stars of sizes divisible by 4. Since Lemma 4.16 is the entire input to Theorem 4.17, the classification of snowflakes is not proved for the full class stated. The authors should either restrict Definition 4.1 and Theorem 4.17 to exclude sizes 1 and 2, or provide an additional argument covering those cases.","section":"Section 4, Lemma 4.16"},{"comment":"Several lemmas used in the proof of Theorem 4.17 omit essential subcases. Lemma 4.7 Case 2, Lemma 4.8 Case 2, Lemma 4.10 Case 3.2, and Lemma 4.15 Case 1.2 are all declared analogous and not proved; Lemma 4.12 is dismissed as easy. These omissions are load-bearing: Lemmas 4.7 and 4.8 together prove Theorem 4.9 for even snowflakes, and Lemma 4.15 is needed for the non-odd minimum snowflakes in Lemma 4.16. A revised manuscript should either supply the omitted arguments or clearly reduce them to the proved cases with explicit justification.","section":"Section 4, Lemmas 4.7, 4.8, 4.10, 4.12, 4.15"}],"minor_comments":[{"comment":"In the sentence describing the attachment, 'aforth' should be 'aforementioned' and 'most be identified' should be 'must be identified'.","section":"Section 4, Lemma 4.16"},{"comment":"In the bullet points, the expressions 'M + k − t + 2' appear where 'M + k + t + 2' seems intended; please check the consistency of the signs.","section":"Section 4, Lemma 4.14"},{"comment":"The notation 'sC2(z2)' lacks the arrow over C2 and should be written as 's_{\\vec{C}_2}(z_2)' as in the rest of the paper.","section":"Section 4, Lemma 4.15"},{"comment":"The intervals defining f(e_i) may appear empty for small values of m2; a sentence confirming that the hypothesis m2 ≥ m1(2m1−1) guarantees all intervals are nonempty in all four cases would help the reader.","section":"Section 2, proof of Theorem 2.1"}],"recommendation":"major_revision","confidential_remarks":"The paper is not circular, and the self-citations to [13] and [16] are legitimate uses of published results. The central problem is completeness: a large number of subcases are omitted, and Lemma 4.16 has a genuine domain error for stars of sizes 1 and 2. I would ask the authors to provide the missing case analyses or a short verification that they reduce to the proved cases, and to correct the decomposition statement. If the omitted arguments are supplied and the domain of Lemma 4.16 is fixed, the paper may become acceptable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dave—quick take: this paper has a solid core idea and two plausible new existence results, but the written proof of the main structural theorem is incomplete, and one key lemma is false as stated. I wouldn't accept it as is, but I'd send it to a referee.\n\nWhat's new: Theorem 2.1 gives explicit graceful/near-graceful labelings for large two nested cycles in all four congruence classes. That's a new family of Eulerian plane graphs—previously known graceful cycles with chords were non-Eulerian—so it's a real step beyond Rosa's obstruction. The semidual trick (graceful plane graph ⇒ conservative tree) is used well, and the snowflake classification in Theorem 4.17 would extend the galaxy result from [13] and the conservative-tree results from [16] to a new family. The reliance on [13] and [16] doesn't bother me; they're published, and the new statements don't collapse into them.\n\nWhere it falls down: Lemma 4.16 is load-bearing for Theorem 4.17 and is asserted without proof. Worse, it's false as stated. Definition 4.1 allows stars of any positive size—Remark 4.2 even uses size-1 stars—but the lemma claims every non-even snowflake is a minimum snowflake (sizes 3–6) plus attached stars of sizes divisible by 4. A snowflake with a size-2 star, like C_{2,3}, can't be written that way, since 2 is not 3,4,5,6 plus a multiple of 4. So Theorem 4.17, as a statement about all snowflakes, is not established. The natural fix is to restrict the domain (semiduals of two nested cycles have no degree-two vertices, so size-2 stars are absent) and handle size-1 stars separately, but that restriction is unstated.\n\nTheorem 2.1 has a similar but milder issue: only Case 1 is proved; Cases 2–4 are dismissed as 'similar.' Given the messy fw definition and four parity cases, that's not a throwaway detail. The examples are helpful but not a proof. Several lemmas in Section 4 (4.7, 4.8, 4.12) also skip subcases.\n\nOverall: the ideas look right, the constructions are explicit, and I see no evidence of a false conclusion in the intended application. The gaps are incompleteness, not incoherence. A careful referee could likely get the missing cases written up. The paper deserves review, not a desk reject, but it needs revision before anyone should rely on Theorems 2.1 and 4.17 as proven. I wouldn't cite the snowflake theorem in its current form.\n\nThis is for graph-labeling people who work with Skolem systems and conservative trees. Bring it to a reading group if you want a case study in proof gaps, but I'd wait for the repair before citing.","headline":"Plausible new constructions for graceful two nested cycles, but the snowflake classification is not proven as stated because Lemma 4.16 fails for stars of sizes 1 and 2.","tokens_in":18660,"tokens_out":7764,"would_cite":false,"duration_ms":72374,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C78","05C05","05C21"],"pacs":[],"model":"deepseek-v4-flash","headline":"Two nested cycles admit graceful labelings in every congruence class that parity allows, once the outer cycle is sufficiently long.","keywords":["graceful graph","near-graceful graph","conservative graph","tree labeling","semidual","two nested cycles","snowflake","Skolem system"],"falsifier":"A concrete test: exhaustively search all snowflakes with up to, say, 20 edges and check whether every one with $M \\equiv 0,3 \\pmod 4$ admits a zero-sum labeling with zero vertex-sum at each internal vertex; the first failure would refute Theorem 4.17, while a full pass would isolate any remaining gap to the missing decomposition proof.","tokens_in":17619,"feed_emoji":"","tokens_out":14628,"duration_ms":136315,"temperature":0.7,"pith_summary":"The paper proves that the semidual of a plane graph made of two nested cycles is a snowflake, and that every snowflake with $M$ edges is conservative when $M \\equiv 0,3 \\pmod 4$ and near-conservative otherwise. It then builds graceful labelings directly: for every inner cycle length $m_1 \\ge 3$ and every outer cycle length $m_2 \\ge m_1(2m_1-1)$, a graceful two nested cycles graph exists when $m_1+m_2 \\equiv 0,3 \\pmod 4$, and a near-graceful one exists when $m_1+m_2 \\equiv 1,2 \\pmod 4$. This matters because a long-known parity obstruction forbids graceful labelings of graphs whose vertices all have even degree when the edge count is $1$ or $2$ mod $4$, and the paper shows that, for long outer cycles, that obstruction is the only obstacle. The proof works by translating graceful vertex labelings into zero-sum edge labelings of the semidual, where the problem reduces to signing numbers on the branches of a star tree.","feed_headline":"Nested cycles get graceful labelings when edge count allows","feed_subtitle":"For outer cycles beyond a threshold, every permitted edge count yields a graceful or near-graceful labeling.","key_machinery":"The central object is the snowflake, the tree obtained from a galaxy of stars by identifying one leaf from each star at a single vertex; this is exactly the semidual of a two nested cycles graph. The labeling machinery is built from $t$-Skolem sequences, partitions of $\\{1,2,\\dots,2n-1\\}\\cup\\{2n+t\\}$ into $n$ pairs whose differences are $1,2,\\dots,n$, repackaged as zero-sum Skolem systems that assign signed edge labels to each star so that every internal vertex has zero sum. Attachment lemmas (Proposition 3.6, Lemmas 4.6--4.15) show how to glue a conservative or near-conservative snowflake to stars that admit balanced (Eulerian) conservative labelings, by matching vertex-sums at the joining vertex. The proof of Theorem 4.17 splits snowflakes into even snowflakes, handled by parity cases, and non-even snowflakes reduced to a minimum snowflake with star sizes $3,4,5,6$ plus extra stars of sizes divisible by $4$; the reduction is Lemma 4.16.","core_discovery":"On its own terms, the paper establishes a complete congruence classification for snowflakes: a snowflake of size $M$ is conservative exactly when $M \\equiv 0,3 \\pmod 4$, and near-conservative when $M \\equiv 1,2 \\pmod 4$ (Theorem 4.17). Since the semidual of a two nested cycles graph is a snowflake, this characterizes when that semidual is conservative or near-conservative. The second result is an existence theorem for the original graphs: for any $m_1 \\ge 3$, whenever $m_2 \\ge m_1(2m_1-1)$ and $m_1+m_2 \\equiv 0,3 \\pmod 4$, the set $N_g(m_1,m_2)$ of graceful two nested cycles graphs is nonempty, and when $m_1+m_2 \\equiv 1,2 \\pmod 4$ the set $N_{n-g}(m_1,m_2)$ of near-graceful ones is nonempty (Theorem 2.1).","pith_inferences":["The same star-attachment machinery, if the decomposition lemma is proved in full, would likely extend the conservative and near-conservative classification to other trees whose internal degrees are controlled, not just snowflakes.","The threshold $m_1(2m_1-1)$ is probably not the true minimum; the omitted 'similar' cases suggest the construction may work for much smaller $m_2$, and small-case computation could reveal the actual bound.","Because conservative snowflake labelings correspond to zero-sum families of signed integer sequences (Skolem systems), the construction doubles as an existence proof for design-theoretic objects such as cyclic cycle decompositions or Heffter arrays with prescribed branch sizes.","A computational search over small two nested cycles graphs could turn the paper's closing question into a conjecture: check whether every graph with $M \\equiv 0,3 \\pmod 4$ is graceful, using Theorem 4.17 to filter semiduals that admit conservative labelings first."],"forward_implications":["Every snowflake with $M \\equiv 0,3 \\pmod 4$ edges admits a conservative labeling, and every other snowflake admits a near-conservative labeling, so this tree family is fully classified.","For each $m_1 \\ge 3$ and $m_2 \\ge m_1(2m_1-1)$, the congruence of $m_1+m_2$ alone determines whether a graceful or near-graceful two nested cycles graph exists.","The known parity obstruction for graphs whose vertices all have even degree is sharp in this family: in the excluded residue classes the near-graceful labeling is the best possible outcome.","The semidual viewpoint reduces a problem about vertex labelings of even-degree plane graphs to a problem about signed edge labelings of star trees, giving a template for studying other plane cycles with chords.","The paper leaves open whether every two nested cycles graph with an allowed total size is graceful, not just those with a sufficiently long outer cycle."],"supporting_citations":[{"why":"It supplies the classical result that graphs whose vertices all have even degree and with $1$ or $2$ mod $4$ edges cannot be graceful, giving the congruence split.","marker":"[24]"},{"why":"It establishes that a graceful plane graph has a conservative dual, linking graceful labelings to conservative semiduals.","marker":"[5]"},{"why":"It provides the conservative star results and the Skolem-system lemmas used to build snowflake labelings.","marker":"[13]"},{"why":"It shows the semidual of a plane cycle with chords is a tree without degree-two vertices and supplies the attachment lemmas for combining conservative trees.","marker":"[16]"},{"why":"It supplies t-Skolem sequences for the congruence classes needed in the odd-snowflake constructions.","marker":"[26]"},{"why":"It supplies the hooked variant of Skolem sequences used for the remaining congruence classes.","marker":"[22]"}],"fun_headline_variants":["Mod 4 edge sums allow graceful nested cycles","Edge sum mod 4 decides graceful nested cycles","Nested cycles: edge count mod 4 predicts gracefulness","Graceful nested cycles exist when edge sum is 0 or 3 mod 4"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof depends on the claim, stated without a detailed demonstration, that every non-even snowflake can be obtained by gluing stars whose sizes are multiples of four onto a small 'minimum' snowflake, and Theorem 2.1's four-case construction is only written out for one case, with the other three described as similar.","fun_headline_variants_meta":{"raw":{"variants":["Mod 4 edge sums allow graceful nested cycles","Edge sum mod 4 decides graceful nested cycles","Nested cycles: edge count mod 4 predicts gracefulness","Graceful nested cycles exist when edge sum is 0 or 3 mod 4"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.002213,"raw_usage":{"total_tokens":8561,"prompt_tokens":936,"completion_tokens":7625,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":552,"completion_tokens_details":{"reasoning_tokens":7555}},"tokens_in":552,"tokens_out":7625,"duration_ms":60036,"temperature":1.0,"reasoning_tokens":7555,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T16:56:54.330222+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete test: exhaustively search all snowflakes with up to, say, 20 edges and check whether every one with $M \\equiv 0,3 \\pmod 4$ admits a zero-sum labeling with zero vertex-sum at each internal vertex; the first failure would refute Theorem 4.17, while a full pass would isolate any remaining gap to the missing decomposition proof.","supporting_citations":[{"cited_title":"Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (In- ternational Symposium , Rome, July 1966), Gordon and Breach, N","cited_arxiv_id":null,"evidence_quote":"It supplies the classical result that graphs whose vertices all have even degree and with $1$ or $2$ mod $4$ edges cannot be graceful, giving the congruence split."},{"cited_title":"Bange, A","cited_arxiv_id":null,"evidence_quote":"It establishes that a graceful plane graph has a conservative dual, linking graceful labelings to conservative semiduals."},{"cited_title":"Goldfeder and J","cited_arxiv_id":null,"evidence_quote":"It provides the conservative star results and the Skolem-system lemmas used to build snowflake labelings."},{"cited_title":"Licona and J","cited_arxiv_id":null,"evidence_quote":"It shows the semidual of a plane cycle with chords is a tree without degree-two vertices and supplies the attachment lemmas for combining conservative trees."},{"cited_title":"Skolem, On certain distributions of integers in pairs with given differences, Math","cited_arxiv_id":null,"evidence_quote":"It supplies t-Skolem sequences for the congruence classes needed in the odd-snowflake constructions."},{"cited_title":"O’Keefe, Verification of a conjecture of Th","cited_arxiv_id":null,"evidence_quote":"It supplies the hooked variant of Skolem sequences used for the remaining congruence classes."}],"review_version":1}