{"id":"beac0470-821a-4076-b416-0d8f8c3cc27d","arxiv_id":"2411.15986","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":2.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper restates the instantiation of Jerboa rule schemes using relabeling functions and orbit types, without adding new results beyond the cited prior work.","lead":"This report explains how rule schemes in the Jerboa geometric modeling platform can be unfolded into concrete graph rewriting rules using set operations and relabeling functions. It is a didactic companion to the author's earlier categorical work, aimed at readers without a heavy category theory background.","discovery_kind":"review","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Central equivalence claim unsupported: Section 5.3 omits the DPO interface and defers the Gmap-validity constraints to [11], so the set-theoretic construction is not shown to instantiate the same rules as Jerboa.","rationale":"I read the paper as an expository companion document rather than a new theorem, so the relevant standard is whether it actually explains the construction used by Jerboa. The central claim depends on an equivalence between the set-theoretic construction and the categorical instantiation of [11]. The reader identified this equivalence as the weakest assumption, and I agree: the paper asserts it without derivation, and the two concrete omissions—the missing DPO interface and the deferred Gmap-validity constraints—are visible in the text itself, not merely external worries. The corrupted Definition 5.2 makes the intended construction unverifiable from the preprint, which strengthens the need for an independent reconstruction. I do not see this as a fatal defect in the pedagogical value: the examples in Section 5.3 show the intended relabeling behavior concretely, and the missing pieces are likely recoverable from [10] and [11]. The reader's conditional verdict already reflects this balance. My concern supports the same verdict rather than moving it: the paper is conditionally acceptable as documentation, provided the formal definition of arc instantiation is repaired, the DPO interface is addressed, and the equivalence with [11] is either proved or explicitly downgraded to an informal analogy.","tokens_in":15548,"tokens_out":4966,"duration_ms":49541,"concrete_test":"Reconstruct the intended arc-instantiation formula from [10] or [11] (the printed Definition 5.2 is garbled), implement the complete set-theoretic instantiation for the vertex-insertion rule scheme in Fig. 5b, and compare its output, for both free and sewn ⟨0,2⟩-orbits, against the rules produced by the categorical instantiation of [11], including their DPO interfaces and Gmap-validity constraints. If the outputs are isomorphic and all constraints hold, the concern is resolved; if the interface differs or any output is not a Gmap subgraph, Section 5.3's equivalence claim fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing step is Section 5.3's assertion that instantiating both sides of L⟨o⟩/→R with the same orbit O yields the graph transformation rule that Jerboa implements. For this to be true, the set-theoretic construction must coincide with the categorical instantiation of [11]. The report does not prove this; it invokes an 'intrinsic proximity between presheaf topoi and sets' at an informal level. More concretely, two self-admitted or visible gaps separate the constructions. First, Section 5.3 defines a rule as a single arrow ι⟨o⟩(L,O)→ι⟨o⟩(R,O), with no DPO interface I, although Section 1 says standard DPO rules include an interface and [11] uses compositional DPO semantics; the interface determines which parts are preserved and deleted, so a bare L→R arrow does not determine the same rewrite system. Second, the final paragraph of Section 5.3 concedes that an instantiated graph scheme need not be a subgraph of a Gmap and defers the needed constraints to [11]. Those constraints are part of what makes an instantiation valid in Jerboa, so omitting them means the set-theoretic construction can produce rules that the categorical one rejects. The hook mechanism in Section 5.3 is also informal and is not proved to determine the orbit parameter uniquely. The printed Definition 5.2, the only formal statement of arc instantiation, is corrupted, so the intended construction cannot be checked from the preprint as written. These are omissions rather than internal contradictions, but they are exactly the points where the central equivalence must hold.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a set-theoretic instantiation of Jerboa rule schemes, based on relabeling functions and orbit types, as a lightweight alternative to the categorical formulation in [11]. It reviews generalized maps and orbits, defines relabeling functions, graph and rule schemes, and then gives constructions for node, arc, and rule instantiation. The central claim, stated in Section 5.3, is that instantiating both sides of a rule scheme L⟨o⟩→R with the same orbit O yields the graph transformation rule that Jerboa's categorical instantiation produces.","tokens_in":15853,"tokens_out":5470,"duration_ms":48395,"significance":"The report has clear expository value: it connects the categorical machinery of [11] to concrete examples such as vertex insertion on free and sewn edges, and the relabeling-function formalism is explained with helpful figures. However, the paper's main claim is that the set-theoretic construction faithfully explains the categorical instantiation used in Jerboa, and that claim is not backed by a proof or even a formal comparison. If the equivalence were established, the paper would be a useful companion to [11]; as it stands, the contribution is an unverified alternative description.","major_comments":[{"comment":"The central equivalence claim is not established. The paper states that ι⟨o⟩(L,O)→ι⟨o⟩(R,O) is the graph transformation rule obtained by instantiating a rule scheme, and the abstract and Section 6 invoke \"the intrinsic proximity between presheaf topoi and sets\", but no theorem or precise comparison with the categorical instantiation of [11] is given. Because that equivalence is the paper's main claim, please add a formal statement and proof of the correspondence, or explicitly present the construction as an informal exposition that may differ from the implementation in Jerboa.","section":"Section 5.3 (rule instantiation)"},{"comment":"The instantiated rule is presented as a single arrow between L and R, with no DPO interface I. As the introduction notes, DPO rules include an interface that determines preserved and deleted parts, and [11] uses compositional DPO semantics. Without an interface, the set-theoretic construction does not determine the same rewrite system as the categorical instantiation; the rule should be a diagram ι⟨o⟩(L,O) ← I → ι⟨o⟩(R,O), or the paper should explain why the interface is unnecessary in this setting.","section":"Section 5.3, Definition 4.2"},{"comment":"The displayed equation for arc instantiation is corrupted by unreadable placeholder tokens such as \"⌟⟨⟨⟪rl⟫l⟩⟩...\". As written, the formal definition cannot be checked. Please re-typeset the equation and restate the construction of ι⟨o⟩(G,O) with standard notation.","section":"Definition 5.2"},{"comment":"The paper concedes that an instantiated graph scheme \"might never be a subgraph of a Gmap\" and defers the needed validity constraints to [11]. Those constraints are part of what makes an instantiation valid in Jerboa, so the set-theoretic construction can generate rules that the categorical construction rejects. This gap must be closed if the paper claims to explain the actual instantiation used in Jerboa.","section":"Section 5.3, final paragraph"},{"comment":"The hook mechanism is informal. The paper states that the orbit type ⟨o⟩ is determined by a hook node, but no formal definition of a hook or proof of uniqueness is given. Since the choice of O is central to the instantiation procedure, the construction is underspecified for a rule scheme with several LHS nodes unless the hook is made part of the rule scheme definition.","section":"Section 5.3, hook"}],"minor_comments":[{"comment":"The cycle constraint contains the string \"/Leftr⫯g⊸tl⫯ne⇒\", apparently a corrupted implication symbol; please correct it.","section":"Definition 2.1"},{"comment":"The cell types for vertices and faces are stated inconsistently: the text first says an ⟨1,2⟩-orbit defines a vertex, but then lists vertices as ⟨0,1⟩-orbits and faces as ⟨1,2⟩-orbits; align these statements with Definition 2.2 and the caption of Figure 2.","section":"Section 2.2"},{"comment":"The caption order for the cell subfigures is confusing, with (d), (f), and (g) referring to different orbit types; please relabel or reorder the subfigures consistently with the surrounding text.","section":"Figure 2"},{"comment":"The arrow in the rule scheme notation appears as \"/leftr⫯g⊸tl⫯ne→\" in several places, presumably from a LaTeX macro rendering failure; this should be fixed throughout.","section":"Definition 4.2"},{"comment":"The paper repeatedly defers key constraints to [11] without summarizing them; since the report claims to be self-contained, at least a precise statement or a concise summary of those constraints would improve readability and checkability.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is largely an exposition of the author's previous work ([9], [10], [11]) rather than a new result, so its fit with a research journal should be carefully weighed. The main issue is not internal inconsistency but that the advertised equivalence with the categorical instantiation in [11] is unproved; if the construction is intended only as a pedagogical simplification, the paper should say so explicitly."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Thanks for the Pith Report. I read the paper, and I largely agree with your take, with one caveat: I think you are slightly harsh on novelty. There is real value in a working set-theoretic presentation of rule scheme instantiation, even if every definition is quoted from [10] and [11]. The report is explicitly pedagogical, and it succeeds at that level. The examples (vertex insertion, free vs. sewn edges) are worked in enough detail that a non-categorical reader can come away with a genuine feel for what instantiating a scheme does. The labeling of definitions as 'from [10]' is honest, and the author is upfront about deferring the Gmap-validity constraints to [11]. That is not circularity; it is a scope statement.\n\nThe soft spots are real. The load-bearing claim is that this set-theoretic construction is what Jerboa actually implements. That is asserted, not shown. Section 5.3 defines a rule instantiation as ι(L,O)→ι(R,O) with no DPO interface, even though Section 1 reminds us that standard DPO rules include an interface I. Without I, the rewrite semantics is underdetermined—you do not know which parts are preserved. The author may intend the interface to be implicit, but it is not in the report. Second, the last paragraph of Section 5.3 admits the construction can produce non-Gmap subgraphs and punts the needed constraints to [11]. Those constraints are part of what makes an instantiation valid in Jerboa, so the set-theoretic construction we are given can produce rules the categorical one rejects. Third, Definition 5.2 is corrupted in the preprint—the equation is unreadable. That is a blocking defect for a formal document, though clearly a rendering issue.\n\nOn the citation pattern: heavy self-citation is appropriate here because this is exposition of the author's own framework. No problem.\n\nWho is this for? Practitioners and students who want an accessible entry to Jerboa's rule scheme instantiation, and perhaps researchers who want a quick refresher on the construction. It is not a research contribution. With the corrupted formula fixed and the DPO interface either added or explicitly identified as implicit, it could be a useful tutorial paper. I would send it to a workshop or a journal's education track. A serious referee should see it, but the referee's main job would be to verify the intended equivalence—which is precisely what the paper does not deliver.","headline":"Honest, clearly-written tutorial that repackages the author's own categorical machinery in set terms; the central equivalence is unproven and one formal definition is corrupted, but it is a useful teaching companion.","tokens_in":16410,"tokens_out":2756,"would_cite":false,"duration_ms":26046,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A rule scheme is instantiated by relabeling both sides with one orbit graph, replacing categorical machinery with set operations.","keywords":["Graph rewriting","Rule instantiation","Topology-based geometric modeling","Generalized maps","Set-based explanation","Jerboa","Relabeling functions","Orbit types"],"falsifier":"Instantiate the rule scheme of Fig. 5b with a sewn $\\langle 0,2\\rangle$-orbit (the four-dart configuration of Fig. 6d), as the paper does, and check whether the resulting rule coincides with Fig. 4b and whether the RHS is a subgraph of a valid 2-Gmap; if the relabeled nodes generate links that violate the incidence or cycle constraints, the set-theoretic construction is not preserving Gmap structure.","tokens_in":15314,"feed_emoji":"📐","tokens_out":7719,"duration_ms":63926,"temperature":0.7,"pith_summary":"This paper argues that instantiating a Jerboa rule scheme—a compact, folded graph-rewriting rule parameterized by a topological orbit type—can be explained with elementary set operations. The construction instantiates the left and right sides of the scheme with the same orbit graph, using relabeling functions derived from the orbit types that decorate the scheme's nodes. The result is a concrete graph-transformation rule $\\iota_{\\langle o\\rangle}(L,O)\\to \\iota_{\\langle o\\rangle}(R,O)$ that reproduces the rules Jerboa's categorical machinery produces. This matters because designers of geometric modeling operations could then understand rule-scheme instantiation without mastering the category-theoretic framework. If correct, the paper gives a lightweight, checkable account of what Jerboa's rule editor does.","feed_headline":"Rule schemes unfold by relabeling a single orbit","feed_subtitle":"A folded graph rule becomes an explicit rule by relabeling both sides with the same orbit graph.","key_machinery":"Relabeling functions and orbit types. A relabeling function is a partial injective map $f\\colon \\{0,\\dots,n\\}\\to\\{0,\\dots,n\\}\\cup\\{\\_\\}$, written as an orbit-type rewriting $\\langle o\\rangle\\mapsto \\langle o'\\rangle$; applying it to an orbit graph deletes links whose label maps to $\\_$ and renames surviving links. Orbit types name the topological cells of a generalized map. These carry the whole instantiation: decorating each node of a graph scheme with an orbit type fixes a relabeling function, and instantiating nodes and arcs by copying the orbit graph and linking copies of the same dart reproduces the explicit rule.","core_discovery":"The central claim is that a rule scheme $L^{\\langle o\\rangle}\\to R$ is instantiated by instantiating both $L$ and $R$ with the same orbit $O$ of type $\\langle o\\rangle$, yielding $\\iota_{\\langle o\\rangle}(L,O)\\to \\iota_{\\langle o\\rangle}(R,O)$. Node instantiation applies the relabeling function $\\langle o\\rangle\\mapsto \\langle o_\\mu\\rangle$ to $O$; arc instantiation adds an $i$-link between the two relabeled images of each dart of $O$; the whole scheme is the union of these pieces. The vertex-insertion example shows one folded scheme with parameter $\\langle 2\\rangle$ recovering the free-edge and sewn-edge rules when unfolded with two different orbit graphs. The author asserts that this set-theoretic construction faithfully explains the categorical instantiation of Jerboa rule schemes, drawing on the closeness between presheaf topoi and sets.","pith_inferences":["If the equivalence with the categorical construction holds, the set-theoretic version gives a cheap way to simulate rule-scheme behavior on small orbit graphs before committing to a full categorical engine.","The same relabeling machinery could be applied to any typed graph-rewriting formalism that decorates nodes with orbit-like types, potentially extending rule schemes beyond generalized maps.","The report explicitly leaves the Gmap-subgraph constraints to [11]; extracting those constraints as set-theoretic conditions on relabeling functions would let instantiation itself certify that its output is a valid topological object."],"forward_implications":["A rule scheme can be unfolded into a concrete graph-transformation rule from the orbit graph at its hook alone, with no categorical machinery required.","The construction is directly implementable with graph copying and relabeling, so the same rule schemes can be instantiated in any system that manipulates labeled graphs.","Because instantiation copies the orbit graph once per node and links corresponding darts, the size and shape of the resulting rule are computable from the orbit graph and the scheme's decorations.","The vertex-insertion example shows that a single folded scheme with parameter $\\langle 2\\rangle$ reproduces both the free-edge and sewn-edge rules, so set-theoretic instantiation preserves the genericity rule schemes exist for."],"supporting_citations":[{"why":"Supplies the categorical rule-scheme instantiation that this report re-expresses in set terms, and the deferred constraints that keep instantiations as subgraphs of a generalized map.","marker":"[11]"},{"why":"Defines relabeling functions, graph schemes, and rule schemes that the set-theoretic construction is built on.","marker":"[10]"},{"why":"Introduces Jerboa, the platform whose rule-scheme instantiation this report explains.","marker":"[3]"},{"why":"Gives the combinatorial definition of generalized maps that underlies the orbit-graph representation.","marker":"[4]"},{"why":"Provides the double-pushout graph-transformation semantics that the instantiated rules are intended to obey.","marker":"[6]"}],"fun_headline_variants":["One orbit graph instantiates any Jerboa rule scheme","Same orbit on both sides: rule scheme instantiation made plain","Set-theoretic lens for Jerboa rule scheme instantiation","Fold and unfold: one orbit to instantiate rules","Rule schemes: a single orbit relabel does it"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction assumes that copying and relabeling one orbit graph captures exactly what Jerboa's category-based engine does, including the hidden constraints that keep the resulting graph a valid topological object; if that equivalence fails, the report is explaining a construction Jerboa may not actually use.","fun_headline_variants_meta":{"raw":{"variants":["One orbit graph instantiates any Jerboa rule scheme","Same orbit on both sides: rule scheme instantiation made plain","Set-theoretic lens for Jerboa rule scheme instantiation","Fold and unfold: one orbit to instantiate rules","Rule schemes: a single orbit relabel does it"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000271,"raw_usage":{"total_tokens":1603,"prompt_tokens":893,"completion_tokens":710,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":509,"completion_tokens_details":{"reasoning_tokens":630}},"tokens_in":509,"tokens_out":710,"duration_ms":6601,"temperature":1.0,"reasoning_tokens":630,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:39:51.594452+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Instantiate the rule scheme of Fig. 5b with a sewn $\\langle 0,2\\rangle$-orbit (the four-dart configuration of Fig. 6d), as the paper does, and check whether the resulting rule coincides with Fig. 4b and whether the RHS is a subgraph of a valid 2-Gmap; if the relabeled nodes generate links that violate the incidence or cycle constraints, the set-theoretic construction is not preserving Gmap structure.","supporting_citations":[{"cited_title":"Inferring topological operations on generalized maps: Application to subdivision schemes","cited_arxiv_id":null,"evidence_quote":"Defines relabeling functions, graph schemes, and rule schemes that the set-theoretic construction is built on."},{"cited_title":"Jerboa: A Graph Transformation Library for Topology-Based Geometric Modeling","cited_arxiv_id":null,"evidence_quote":"Introduces Jerboa, the platform whose rule-scheme instantiation this report explains."},{"cited_title":"Damiand and P","cited_arxiv_id":null,"evidence_quote":"Gives the combinatorial definition of generalized maps that underlies the orbit-graph representation."}],"review_version":1}