{"id":"75a81225-9fb2-4a64-ae47-1fcb3c808392","arxiv_id":"1908.10923","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"Symmetry groups of the C. elegans locomotion circuits factorize into subgroups whose neuron sets match known functional classes, and finer imprimitive blocks form circulant 'filter' matrices.","lead":"This paper finds that the neurons that drive forward and backward movement in the roundworm C. elegans can be grouped into functional classes by the symmetries of their wiring diagram, and that these symmetry groups break into smaller building blocks that resemble image-processing filters. A generalist might read it to see a mathematical 'symmetry-first' proposal for how a nervous system's wiring encodes its jobs.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The factorization in Eq. (4) presumes a group, but Sec. II.B concedes that the pseudosymmetry set is not closed under composition; without defining the generated group and verifying closure, the central group-theoretic claim lacks a formal base.","rationale":"The reader's weakest-assumption diagnosis is correct and is the single most load-bearing concern in the paper. The paper's novelty rests on the claim that the symmetry groups of locomotion circuits factorize into normal subgroups whose sectors match functional categories. That claim is only meaningful if the object being factorized is actually a group. The text itself undermines this at the point of definition: Sec. II.B states that the pseudosymmetry set does not satisfy the composition law, and Sec. II.C then proceeds to use group-theoretic vocabulary and direct-product factorization for Fgap, Bgap, Fch, and Bch. No definition is given for how these groups are constructed from the raw epsilon-threshold sets, and no closure check is reported. This is an internal tension, not merely a disagreement with external consensus. The concern is concrete: either the groups are generated groups, in which case closure under composition must be verified computationally, or they are raw sets, in which case the direct-product theorem cannot be invoked. The same issue propagates to the imprimitivity and circulant-matrix claims, since blocks of imprimitivity are defined relative to a group action. I give credit where it is due: the reported agreement between symmetry-derived sectors and WormAtlas functional categories is an empirical observation on public data, and the p-values in Table I provide some evidence against a purely random origin. However, the formal interpretation of that observation depends on the unresolved group-object question. The paper should either prove closure for generated subgroups, explicitly restrict the factorization to exact symmetries of the idealized epsilon=0 circuits and justify the idealization procedure, or soften the group-theoretic claims substantially. Because this is precisely the condition already identified by the reader, my assessment does not move the verdict: CONDITIONAL remains appropriate, with the stated requirement for major revision or explicit softening.","tokens_in":24421,"tokens_out":3318,"duration_ms":36717,"concrete_test":"For the forward gap-junction circuit, enumerate the raw pseudosymmetry set R = {P : ||[P,A]|| < 0.25*M} over all permutations of the 22 neurons (or use the quadratic-assignment heuristic if exhaustive search is infeasible). Then compute the subgroup G generated by the generators of the claimed factors C2, C2, S5, D1, C2, C2. Check three things: (i) is every element of G contained in R, i.e., does every generated product satisfy the epsilon bound? (ii) does G equal the raw set R, or is R strictly larger or smaller? (iii) do the claimed factors have pairwise disjoint supports and decompose G as a direct product? If products of the listed pseudosymmetries violate the epsilon bound, Eq. (4) is not a factorization of pseudosymmetries; if all generated elements remain below epsilon, the reader's concern is resolved.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing weak point is the undefined group object underlying Eq. (4). Section II.B explicitly states that \"the set of pseudosymmetries does not form a group by itself\" because the composition of two pseudosymmetries can exceed the epsilon threshold. Despite this, Sec. II.C immediately treats Fgap as a group and factorizes it as Fgap = [C2 x C2] x [S5 x D1 x C2 x C2]. It is never specified whether Fgap is (a) the raw set of permutations with epsilon < 25%, in which case the direct-product factorization is mathematically undefined, or (b) the subgroup generated by the listed pseudosymmetries, in which case the authors must prove that every element of the generated subgroup also satisfies ||[P,A]|| < epsilon*M. Table I lists epsilon values for the individual listed permutations, not for their products. Without closure, the terms \"normal subgroup,\" \"direct product,\" and \"block of imprimitivity\" do not apply in their standard group-theoretic sense. Because the paper's central claim is that symmetry group factorization reveals the structure-function relation, this is not a cosmetic ambiguity: if the underlying object is not a well-defined group, then Eqs. (4), (28), (32), (36), and (41) and the subsequent imprimitivity and circulant-filter interpretation lose their formal foundation. The empirical sector-function correspondence might survive correction, but the group-theoretic mechanism would not.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript analyzes the gap-junction and chemical-synapse circuits underlying forward and backward locomotion in C. elegans. It introduces pseudosymmetries as permutations whose commutator with the weighted adjacency matrix has norm below a threshold epsilon, with the experimental 25% animal-to-animal variability as the relevant bound. The authors claim that the pseudosymmetry sets of each circuit form symmetry groups that factorize uniquely as direct products of normal subgroups, that the neuron sectors supporting these factors match the WormAtlas functional categories (command interneurons, motor neurons, touch neurons), and that finer structures inside the subgroups form systems of imprimitivity whose adjacency blocks are circulant matrices interpreted as high-pass, low-pass, and sampling filters. The paper also reports p-values against degree-preserving random null models and compares the symmetry sectors with Louvain modularity and eigenvector centrality, arguing that the symmetry-based partition is biologically more faithful.","tokens_in":24729,"tokens_out":5132,"duration_ms":53806,"significance":"If the group-theoretic scaffolding were sound, the paper would offer a genuinely novel structural principle: functional sectors of a connectome emerge from factorization of an approximate symmetry group without fitting any parameter to functional labels. The use of WormAtlas categories as external ground truth, rather than as target variables for parameter fitting, is a methodological strength, and the reported sector-to-function correspondence across four circuits is empirically striking. A systematic appearance of circulant and block-circulant blocks in a biological network would also connect connectomics to a well-developed signal-processing formalism. However, the manuscript does not supply machine-checked proofs or fully reproducible code for the main computation, and the formal basis of the central factorization claim is not currently well defined.","major_comments":[{"comment":"The paper explicitly states in §II.B that the set of pseudosymmetries does not form a group because composition can violate the epsilon threshold, yet §II.C and Eq. (4) treat Fgap as a group and factorize it as a direct product of normal subgroups. It must be specified whether the object being factorized is (a) the raw set of permutations with epsilon below 25%, in which case the terms 'normal subgroup,' 'direct product,' and 'block of imprimitivity' are not defined, or (b) the subgroup generated by the listed pseudosymmetries, in which case the authors must prove that every element of the generated subgroup satisfies the same epsilon bound. Table I lists epsilon values only for individual listed permutations, not for their products; without closure, Eqs. (28), (32), (36), and (41) lose their formal foundation.","section":"§II.B–II.C, Eq. (4)"},{"comment":"The ideal symmetric circuit used to define bloc imprimitivity and the circulant matrices is obtained by an under-specified 'epsilon to 0' symmetrization of the real circuit. Supplementary Note 3 only states that the ideal circuits are 'examples' of the closest ideal structure respecting the pseudosymmetries; no algorithm, uniqueness guarantee, or error analysis is provided. Because the ideal circuit is constructed from the real circuit, the subsequent identification of circulant blocks in §II.F is not an independent symmetry-based prediction unless it is shown that the circulant structure is forced by the group action alone and is invariant to the choice of symmetrization procedure.","section":"Supplementary Note 3; §II.F, Figs. 2c–d, 3c–d, 4b–d"},{"comment":"The circuits studied in the main text, such as the forward gap-junction circuit with 22 neurons and the backward gap-junction circuit with 29 neurons, exceed the size for which the text says an exhaustive search is computationally possible. Supplementary Note 3 instead states that for circuits with more than 20 neurons the pseudosymmetries should be found by solving a constrained quadratic assignment problem 'to be elaborated and described in detail in a follow up paper.' The actual method used to produce the pseudosymmetry groups and Table I is therefore not available to the reader, which prevents reproducibility of the central empirical claim.","section":"Supplementary Note 3; Table I"},{"comment":"The functional interpretation of the circulant blocks as 'neural processing filters' is presented as a result, but Eq. (13) is a generic linear rate model with no demonstrated connection to C. elegans neural dynamics, and the eigenvalue analysis of F in Eq. (15) only shows that this particular matrix is singular with two zero modes. No evidence is provided that the connectome actually implements Fourier-domain filtering, edge detection, or signal compression. The filter language should be reframed as an analogy or a hypothesis, not as an established functional mechanism, especially because the abstract and introduction present the filter functionality as part of the central structure-function claim.","section":"§II.F, Eqs. (13)–(15)"}],"minor_comments":[{"comment":"The norm of the commutator is defined in the main text as a sum over all i,j, while Supplementary Note 3 restricts the sum to i >= j for undirected gap-junction circuits; the two definitions differ by a factor of two for symmetric adjacency matrices and should be reconciled.","section":"Eq. (3) and Supplementary Eq. (23)"},{"comment":"The paper defines a normal subgroup H by the condition [g,H] = 0, i.e., H commutes with every element of G. This is stronger than the standard definition gHg^{-1} = H. The factors in a direct product with disjoint supports do commute, so the intended examples are consistent, but the terminology should match the standard definition to avoid confusion.","section":"§II.C and Fig. 1e"},{"comment":"The statement that an exhaustive search over all permutations is feasible for small networks but impossible for N > 20 is inconsistent with the main text, which presents the N = 22 and N = 29 circuits without explaining how the search was performed; a concrete description of the algorithm used for these circuits is needed.","section":"Supplementary Note 3, 'Algorithm to find pseudosymmetries'"},{"comment":"The p-value column is introduced in §II.D but the procedure for computing p-values from the degree-preserving null model is not described in the main text; a brief description or a pointer to a supplementary method should be added.","section":"Table I"},{"comment":"The caption refers to 'the ideal circuit obtained from (a) by epsilon to 0' but does not explain how the ideal circuit is constructed; a reference to a specific supplementary note and a warning that the ideal circuit is an auxiliary construct rather than the real biological circuit would help readers avoid overinterpreting the visualized perfect symmetries.","section":"Caption of Figure 2"},{"comment":"The data availability statement lists URLs for the connectome and code repositories, but the specific code version and the exact input files used to generate Table I are not identified; providing a versioned archive would improve reproducibility.","section":"Data availability"}],"recommendation":"major_revision","confidential_remarks":"The core empirical observation, that approximate symmetry sectors align with WormAtlas functional categories, is interesting and appears to be a genuine finding. The main technical gap is the undefined group object underlying the factorization; this is fixable in principle by defining the generated subgroup and checking closure, but it requires real mathematical work. I would also urge the editor to require that the computational method for the larger circuits be disclosed, since the current text defers the central calculation to a follow-up paper. The filter-functionality interpretation should be softened unless the authors can provide a dynamical testable prediction."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. The sector-to-function match is real and not circular: the paper takes WormAtlas labels as ground truth and doesn't fit to them. The formal scaffolding around it is shaky, exactly at the point the stress test flags: the paper admits pseudosymmetries don't form a group, then factorizes them as a group.\n\nWhat's genuinely new is the application of normal-subgroup factorization and imprimitivity to the locomotion circuits, and the observation that the resulting sectors separate command, motor, and touch classes. The comparison with Louvain and centrality is useful even if not deep, and the p-values against a degree-preserving null are a reasonable sanity check. Code and data are public.\n\nThe soft spots, in order of severity. First, the undefined group object. If Fgap is meant to be the exact symmetry group of the idealized ε=0 circuit, the authors should say that explicitly and connect the ideal group to the listed pseudosymmetries; the text currently reads as if the pseudosymmetry set itself is a group. If the generated subgroup is meant, they need to prove closure under composition and that products stay below the ε bound. As written, Eqs. (4), (28), (32), (36), (41) and the imprimitivity argument lack a clear formal base. Second, the ideal-circuit construction is under-specified: 'closest ideal structure' is not a precisely defined optimization, so the finer blocks are derived from a procedure with no error analysis. Third, the circulant-filter interpretation is an analogy, not a tested mechanism. H, L, F are circulant blocks in the ideal adjacency matrix; calling them high-pass, low-pass, and compression filters is plausible but no dynamics are measured. The 'prediction' language is stronger than what is delivered.\n\nBottom line: a serious referee should engage, but the revision needs to define the group object, justify the ideal circuit, and soften or test the filter claims. If the authors fix the group definition, the empirical correspondence is worth keeping.","headline":"Real empirical sector-function match, but the group-theoretic machinery needs formal clarification before the central claim holds.","tokens_in":25234,"tokens_out":3926,"would_cite":false,"duration_ms":37850,"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":"The paper claims that the locomotion circuits of the C. elegans connectome have symmetry groups built from near-symmetries, that these groups factorize into normal subgroups whose neuron sectors match known functional classes, and that…","keywords":["C. elegans","connectome","pseudosymmetry","symmetry group factorization","normal subgroup","block of imprimitivity","circulant matrix","neural signal processing"],"falsifier":"Take the permutations listed for any subgroup, form all pairwise products, and measure the fraction of links each product breaks; if any product exceeds the 25% bound, the direct-product factorization of Eq. (4) is not a factorization of the raw pseudosymmetry set, and the sector partition would need to be re-derived for the generated groups.","tokens_in":24200,"feed_emoji":"🪱","tokens_out":11217,"duration_ms":108351,"temperature":0.7,"pith_summary":"This paper tries to establish that the connectome of C. elegans carries its function in its symmetries: the near-symmetries of the four locomotion circuits (forward and backward, gap-junction and chemical-synapse) can be organized into symmetry groups that factor into independent building blocks called normal subgroups, and the neurons moved by each subgroup form disjoint sectors that match the experimentally known functional classes of command interneurons, motor neurons, and touch neurons. Inside those sectors the paper finds finer structures, systems of imprimitivity whose blocks are circulant matrices (the filters $H$, $L$, and $F$) nested as block-circulant matrices, and it interprets these as signal-processing filters that allow fast neural computation. If the claim is right, the structure-function relation in this nervous system becomes a symmetry principle, and the same factorization procedure could be applied to other connectomes.","feed_headline":"Worm locomotion circuits factor into functional symmetry groups","feed_subtitle":"Near-symmetries split the C. elegans connectome into command, motor, and touch sectors and reveal circulant filter blocks.","key_machinery":"The central object is the pseudosymmetry group of a locomotion circuit: the set of permutations $P_\\varepsilon$ that preserve all but a fraction $\\varepsilon$ of the weighted links, with $\\varepsilon$ below the 25% animal-to-animal variability reported for the connectome. The identity carrying the argument is the direct-product factorization $G = H_1\\times H_2\\times\\cdots\\times H_n$ into normal subgroups that each act only on its own disjoint set of neurons, yielding a partition of the neurons into sectors. The finer mechanism is the system of imprimitivity of each subgroup, a partition of a sector into blocks that the subgroup either fixes as a whole or moves to a disjoint block; in these circuits the blocks turn out to be circulant matrices. Because circulant matrices are diagonalized by the discrete Fourier transform in $O(N\\log N)$ operations, the paper identifies the blocks with fast linear filters and embeds them in the recurrent dynamics $\\tau\\,dv/dt = -v + Mv + Wu$.","core_discovery":"The central discovery is a factorization statement for each locomotion circuit. For the forward gap-junction circuit, the pseudosymmetry group is $F_{\\mathrm{gap}} = [C_2\\times C_2]\\times [S_5\\times D_1\\times C_2\\times C_2]$; the first factor moves only the four command interneurons and the rest moves only motor neurons. The same pattern holds for the backward gap-junction circuit and for the two chemical-synapse circuits, with a touch-neuron factor appearing in the chemical circuits. Each factor is a normal subgroup that moves only its own set of neurons, and these sets partition the neurons into disjoint sectors that match the empirically compiled functional categories. Looking inside a factor, the paper finds systems of imprimitivity: for example, the subgroup $D_1$ in the forward motor sector maps two four-neuron blocks onto each other, and these blocks have adjacency matrices equal to the circulant matrix $F = \\mathrm{circ}(0,1,0,1)$, while other blocks are $H=\\mathrm{circ}(0,1)$ and $L=\\mathrm{circ}(1,1)$, nested into block-circulant matrices. The paper then models the circuit as a feedforward-recurrent linear filter network with equation $\\tau\\,dv/dt = -v + Mv + Wu$, in which the circulant blocks play the role of high-pass, low-pass, and compression filters; the eigenvalues of $F$, namely $2$, $-2$, $0$, and $0$, determine which modes propagate in forward locomotion.","pith_inferences":["The paper leaves open whether the raw set of pseudosymmetries below the $\\varepsilon<25\\%$ threshold is itself a closed object; a rigorous reading of Eq. (4) requires replacing that raw set with the group it generates and checking the $\\varepsilon$ value of every generated product.","A natural extension not developed in the paper is to run the same search on the full 302-neuron connectome; if the factorization holds globally, it would yield a complete function-to-sector map rather than one limited to locomotion.","A direct experimental test suggested by the machinery: calcium or voltage imaging of the four neurons in motor blocks $B_1$ and $B_2$ during forward locomotion should show activity dominated by the eigenvectors of $F$ listed in Eq. (15), namely in-phase and anti-phase modes.","The theory predicts a forward-backward asymmetry: because the $F$ filter appears only in the forward gap-junction motor blocks, forward locomotion should show a frequency-compression signature that backward locomotion lacks."],"forward_implications":["Neurons assigned to the same normal-subgroup sector should be co-activated during the corresponding locomotion behavior, since they form a single orbit under the circuit symmetry.","The circulant motor blocks should behave as linear filters: the forward gap-junction block $F$ should pass the modes with eigenvalues $\\pm 2$ and reject the two zero modes, shaping the oscillation pattern of forward undulation.","The symmetry-factorization machinery gives a functional classification that standard community detection misses: modularity tends to merge hub interneurons with their connected motor neurons, while the symmetry sectors separate them.","The pseudosymmetry framework converts the observed 25% wiring variability into a tolerance parameter: as long as $\\varepsilon$ stays below the experimental bound, the functional sector structure is robust to animal-to-animal differences."],"supporting_citations":[{"why":"Supplies the weighted connectome of gap junctions and chemical synapses that every symmetry calculation in the paper starts from.","marker":"[9]"},{"why":"Provides the original wiring and functional classification of the locomotion neurons that the sector assignment builds on.","marker":"[5]"},{"why":"Defines the broad functional categories used as the ground truth for matching symmetry sectors to neuron function.","marker":"[25]"},{"why":"Provides the group-theoretic definitions of permutation group, normal subgroup, direct-product factorization, and blocks of imprimitivity.","marker":"[12]"},{"why":"Defines circulant and block-circulant matrices and supplies the Fourier-diagonalization property used to read the blocks as fast filters.","marker":"[13]"},{"why":"Supplies the feedforward-recurrent linear filter model used to interpret the circulant blocks as neural processing filters.","marker":"[4]"},{"why":"Provides the modularity algorithm used as the baseline that symmetry sectors are compared against.","marker":"[28]"},{"why":"Defines community structure in biological networks and serves as the methodological baseline for modular functional modules.","marker":"[27]"}],"fun_headline_variants":["Symmetry groups factor worm connectome into functions","Factorized symmetries expose C. elegans circuit sectors","Worm neural symmetries decompose into filter blocks","Symmetry factorization links structure to function in C. elegans","Connectome symmetries split into functional subgroups"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument depends on treating the near-symmetries as a genuine symmetry group that can be split into independent building blocks, even though the paper admits that the raw set of near-symmetries does not close under composition because combining two of them can break more than the allowed fraction of links.","fun_headline_variants_meta":{"raw":{"variants":["Symmetry groups factor worm connectome into functions","Factorized symmetries expose C. elegans circuit sectors","Worm neural symmetries decompose into filter blocks","Symmetry factorization links structure to function in C. elegans","Connectome symmetries split into functional subgroups"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000167,"raw_usage":{"total_tokens":1296,"prompt_tokens":1025,"completion_tokens":271,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":641,"completion_tokens_details":{"reasoning_tokens":198}},"tokens_in":641,"tokens_out":271,"duration_ms":3589,"temperature":1.0,"reasoning_tokens":198,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T10:30:59.975575+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the permutations listed for any subgroup, form all pairwise products, and measure the fraction of links each product breaks; if any product exceeds the 25% bound, the direct-product factorization of Eq. (4) is not a factorization of the raw pseudosymmetry set, and the sector partition would need to be re-derived for the generated groups.","supporting_citations":[{"cited_title":"R., Chen, B","cited_arxiv_id":null,"evidence_quote":"Supplies the weighted connectome of gap junctions and chemical synapses that every symmetry calculation in the paper starts from."},{"cited_title":"G., Southgate, E., Thomson, J","cited_arxiv_id":null,"evidence_quote":"Provides the original wiring and functional classification of the locomotion neurons that the sector assignment builds on."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the broad functional categories used as the ground truth for matching symmetry sectors to neuron function."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the group-theoretic definitions of permutation group, normal subgroup, direct-product factorization, and blocks of imprimitivity."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines circulant and block-circulant matrices and supplies the Fourier-diagonalization property used to read the blocks as fast filters."},{"cited_title":"& Abbott, L","cited_arxiv_id":null,"evidence_quote":"Supplies the feedforward-recurrent linear filter model used to interpret the circulant blocks as neural processing filters."},{"cited_title":"D., Guillaume, J.-L., Lambiotte, R","cited_arxiv_id":null,"evidence_quote":"Provides the modularity algorithm used as the baseline that symmetry sectors are compared against."},{"cited_title":"& Newman, M","cited_arxiv_id":null,"evidence_quote":"Defines community structure in biological networks and serves as the methodological baseline for modular functional modules."}],"review_version":1}