{"id":"ad87efc4-ef65-48af-adf2-c52f7d100261","arxiv_id":"1908.08658","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A digraph is a primitive weakly distance-regular circulant exactly when it is a Paley digraph of prime order p with p congruent to 3 mod 4, a prime-length circuit, or Cay(Z13,{1,3,9}).","lead":"This paper classifies all primitive weakly distance-regular digraphs that are circulants, showing they are exactly Paley digraphs on primes congruent to 3 mod 4, prime-length directed cycles, and one exceptional 13-vertex digraph. The result settles a natural classification problem in algebraic combinatorics and provides a clean finite family with a single exceptional case.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 4.1, the unique bridge from circulant schemes to cyclotomic schemes, is cited to a distance-regular-graph book without its exact hypotheses; if [2, Thm 2.10.5] does not cover arbitrary primitive translation schemes, Theorem 1.3 is unproved.","rationale":"The paper's internally developed parts — Theorem 1.1, Lemmas 3.1–3.5, Lemma 4.2, and Steps 1–4 — are detailed and mostly self-contained; I see no circular fitting or post-hoc selection. The single load-bearing step is Lemma 4.1, which reduces the classification of primitive weakly distance-regular circulant digraphs to cyclotomic schemes over GF(p). The reader's weakest assumption identified the same point. I do not claim the external theorem is false; I claim only that the paper does not give its hypotheses, and the cited source is a book on distance-regular graphs rather than a systematic treatment of translation schemes. If the theorem applies, the proof is credible and the classification follows. If it does not, the necessity proof in Theorem 1.3 has no bridge. Therefore a conditional acceptance is appropriate: accept once the citation is checked and its hypotheses are shown to cover the attached scheme X(Γ).","tokens_in":11426,"tokens_out":33945,"duration_ms":337135,"concrete_test":"Obtain [2, Theorem 2.10.5] and verify three points: (1) whether it is a theorem about association schemes/translation schemes or only about distance-regular graphs; (2) what 'cyclic Sylow subgroup' modifies (the translation group X, or Aut(X)) and whether it is satisfied by the regular cyclic group on Z_p; (3) whether the primitivity notion in [2] matches the relation-generating primitivity of Section 2. If the cited theorem is graph-specific, determine whether X(Γ) can be equipped with a distance-regular graph structure satisfying those hypotheses. In parallel, for small composite n (n ≤ 20), enumerate all translation schemes on Z_n with d ≥ 2 and test primitivity; a primitive example with composite n would directly falsify Lemma 4.1.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central classification is carried by Lemma 4.1, stated as '([2, Theorem 2.10.5])' for arbitrary primitive translation schemes with a cyclic Sylow subgroup. The proof of Theorem 1.3 uses it exactly once, but everything downstream depends on it: it gives p prime, X cyclotomic, hence skew-symmetric, equal-valency, and Lemma 2.2 scaling in Steps 1–4. The cited book [2] is about distance-regular graphs, so the exact hypotheses of the cited theorem matter. X(Γ) is the scheme of two-way distances of a digraph; it is not shown to be the distance-layer scheme of a distance-regular graph, and 'cyclic Sylow subgroup' is not defined in the paper (underlying translation group vs. full automorphism group). If [2, Thm 2.10.5] is a graph theorem, or if its primitivity/cyclicity hypotheses differ from those of Section 2, then Lemma 4.1 is not available and the reduction in Section 4 collapses.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves two classification theorems. Theorem 1.1 analyzes commutative association schemes generated by a non-symmetric relation R1 satisfying R1^2 ⊆ {R1,R1*,R2}, R1R1* ⊆ {R0,R1,R1*,R2,R2*}, and 2 not in {1*,2*}; it concludes that if k1=k2>1 then d=4, and that if the scheme is pseudocyclic then it is isomorphic to the cyclotomic scheme Cyc(13,4). Theorem 1.3 applies this scheme theory to classify primitive weakly distance-regular circulant digraphs, obtaining the Paley digraph of prime order p≡3 mod 4, the directed circuit of prime length p, and Cay(Z13,{1,3,9}). The proof of Theorem 1.3 shows that the attached scheme of such a digraph is a primitive translation scheme, invokes Lemma 4.1 to conclude that it is cyclotomic over GF(p), and then uses the case analysis of Theorem 1.1.","tokens_in":11653,"tokens_out":12423,"duration_ms":118489,"significance":"If correct, the paper gives a complete classification of primitive weakly distance-regular circulant digraphs, a natural directed analogue of the Miklavic-Potocnik classification of distance-regular circulants. Theorem 1.1 is a substantial and mostly self-contained piece of intersection-number case analysis, and the use of the independent classifications in [4] and [5] is appropriate. The proof of Theorem 1.3 is elegant in its reduction to girth 3 and to the cyclotomic case. However, the bridge from translation schemes to cyclotomic schemes is exactly one cited theorem whose exact hypotheses are not stated, and a related skew-symmetry assertion is not justified by the definitions given. These issues are load-bearing for the main classification, though they appear fixable.","major_comments":[{"comment":"Lemma 4.1 is cited as [2, Theorem 2.10.5] without quoting the theorem or its hypotheses. The cited monograph [2] is about distance-regular graphs, and the paper does not show that the attached scheme X(Γ) is the distance-layer scheme of a distance-regular graph, nor that the cited result applies to arbitrary primitive translation schemes. Since the rest of the proof of Theorem 1.3 depends on the conclusion that X is a cyclotomic scheme over GF(p), the authors should state the theorem in full, specify the group whose Sylow subgroup is assumed cyclic, and prove that all hypotheses are met by X(Γ). Without this, the reduction in Section 4 is unsupported.","section":"Section 4, proof of Theorem 1.3"},{"comment":"The assertion that a cyclotomic scheme is necessarily skew-symmetric is false under the definition in Section 2. For example, Cyc(5,2) is cyclotomic and primitive, but its non-diagonal relations are symmetric because -1 lies in the subgroup used to define the classes. The skew-symmetry of X(Γ) is used in Steps 3 and 4 to identify relations and to verify condition (3) of Theorem 1.1. The authors need to replace this implication with a proof specific to weakly distance-regular circulant digraphs, or else state explicitly that Lemma 4.1 is being used in a stronger sense than the definition of cyclotomic scheme given in Section 2.","section":"Section 4"}],"minor_comments":[{"comment":"There is a typo in the statement: 'primitve' should be 'primitive'.","section":"Theorem 1.3"},{"comment":"The girth of a digraph is used repeatedly but is never defined in the preliminaries; please add a definition for a strongly connected digraph.","section":"Section 4, Steps 1 and 2"},{"comment":"The notation P_{(a,b),(c,d)} is used for two-way distance classes, but the earlier definition of P_{i,j} in Section 1 concerns scheme relations. Please define the two-way-distance version explicitly.","section":"Lemma 4.2"},{"comment":"The proof of the claim that I={1,1*} is terse: the strict inclusion in the display is asserted without identifying the vertex that witnesses the strictness. Please supply the missing argument for the reader.","section":"Section 3.2, Case 1"},{"comment":"The reference title contains a typo: 'Assoication Schemes' should be 'Association Schemes'.","section":"Reference [13]"}],"recommendation":"major_revision","confidential_remarks":"The central concern is the external bridge: Lemma 4.1 must be verified against [2, Theorem 2.10.5], and the skew-symmetry step needs a real proof. If the authors can supply these, the classification is convincing and the paper is a good fit for the journal. I would not reject on the current evidence, but the proof as written is not yet complete."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take. The paper settles a natural problem: primitive weakly distance-regular circulant digraphs are precisely the Paley digraphs of prime order p≡3 mod 4, prime circuits, and the exceptional Cayley digraph on Z13 with connection set {1,3,9}. That's a clean, compact classification, and it's genuinely new. The prior literature covered distance-regular circulants and valency-3 weakly distance-regular digraphs, but not this class. Theorem 1.1, a structural statement about non-symmetric commutative association schemes, is a real contribution in its own right; the proof is a straightforward but believable case analysis, and the paper uses external classifications (schemes on 13 points, four-class skew-symmetric schemes) as anchors rather than as ex post facto fitting.\n\nThe main soft spot is exactly where the stress test points: Lemma 4.1. The paper imports [2, Theorem 2.10.5] from Brouwer–Cohen–Neumaier to go from a primitive translation scheme with a cyclic Sylow subgroup to a prime-order cyclotomic scheme. BCN is a distance-regular graph book, and the paper does not restate the theorem's exact hypotheses or verify that the attached scheme of a weakly distance-regular digraph is within its scope. If that theorem is only for distance-regular graphs (or if the definition of translation scheme differs), the reduction in Section 4 collapses. I suspect the result is true and the gap is fillable, but it needs to be fixed: restate the theorem, prove it for translation schemes, or give a precise reference that covers general association schemes.\n\nMinor issues: the step from a 2-class scheme to the Paley digraph is asserted; the proof of Lemma 2.3 is terse but the cited results do the heavy lifting. Neither is serious.\n\nOverall: I believe the classification is correct. The paper deserves a serious referee. If I were the editor, I'd send it to peer review with a request to clarify the scope of Lemma 4.1.","headline":"Clean classification of primitive weakly distance-regular circulant digraphs; a solid paper whose one load-bearing external citation needs verification.","tokens_in":12198,"tokens_out":3730,"would_cite":true,"duration_ms":34948,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E30"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper classifies all primitive weakly distance-regular circulant digraphs: Paley digraphs, prime circuits, and Cay(Z13,{1,3,9}).","keywords":["association scheme","pseudocyclic","Cayley digraph","weakly distance-regular digraph","primitivity","circulant digraph","cyclotomic scheme"],"falsifier":"A concrete falsifier: compute the attached association scheme of any weakly distance-regular Cayley digraph on $\\mathbb{Z}_p$ for $p > 13$ prime; if it is primitive and has more than two two-way distance classes, Theorem 1.3 is false. In particular, the proof's Step 2 implies that a counterexample of girth $g > 3$ would force $p = g$, so a search should focus on girth-3 candidates.","tokens_in":11222,"feed_emoji":"🔁","tokens_out":18534,"duration_ms":153787,"temperature":0.7,"pith_summary":"The paper gives a complete list of the primitive weakly distance-regular circulant digraphs: strongly connected Cayley digraphs on cyclic groups whose two-way distance classes form an association scheme, namely the Paley digraph on a prime number $p$ of vertices with $p \\equiv 3 \\pmod{4}$, the directed cycle (circuit) of prime length $p$, and one exceptional Cayley digraph on 13 vertices with connection set $\\{1, 3, 9\\}$. This is the directed analogue of the known classification of distance-regular circulant graphs, and it proceeds by classifying the attached association schemes rather than the digraphs alone. The authors first prove Theorem 1.1: a commutative association scheme generated by a non-symmetric relation satisfying three local closure conditions, with equal nontrivial valencies greater than 1, has exactly four classes, and if it is pseudocyclic it is the cyclotomic scheme $\\mathrm{Cyc}(13, 4)$. They then show that the attached scheme of any primitive weakly distance-regular circulant digraph satisfies those hypotheses, so the digraph classification follows. The result shows that no further exotic primitive examples exist in the circulant case, and it provides a concrete bridge between weakly distance-regular digraphs and association schemes.","feed_headline":"Only three primitive weakly distance-regular circulants exist","feed_subtitle":"The complete classification: Paley digraphs, prime circuits, and one 13-vertex Cayley digraph","key_machinery":"The load-bearing object is the attached scheme $X(\\Gamma) = (V\\Gamma, \\{\\Gamma_{\\tilde{i}}\\}_{\\tilde{i} \\in \\tilde{\\partial}(\\Gamma)})$, the association scheme whose relations group vertex pairs by their two-way distance $(\\partial(x,y), \\partial(y,x))$. For a circulant digraph this is a translation scheme, so its relations are invariant under translations of the cyclic group and its adjacency matrices commute. The argument uses two further mechanisms: the external classification of primitive translation schemes cited in Lemma 4.1, which turns the circulant problem into a problem about cyclotomic schemes over a prime field (schemes whose relations are the cosets of a subgroup of the field's multiplicative group), and a set-scaling argument (Lemma 4.2) that, for a circuit $x_0, x_1, \\ldots, x_{g-1}$ of type $(1, g-1)$, expresses the set $Y_i = P_{(1,g-1),(1,g-1)}(x_{i-1}, x_{i+1})$ as $Y_i = iY_1$, forcing $g = p$ and hence a circuit unless $g = 3$. The small intersection-number calculus of Theorem 1.1 then leaves exactly the 13-vertex cyclotomic scheme.","core_discovery":"The central discovery is Theorem 1.3: a digraph $\\Gamma$ is a primitive weakly distance-regular circulant digraph if and only if $\\Gamma$ is isomorphic to (i) the Paley digraph of order $p$, where $p$ is prime and $p \\equiv 3 \\pmod{4}$; (ii) the circuit of length $p$, where $p$ is prime; or (iii) $\\mathrm{Cay}(\\mathbb{Z}_{13}, \\{1, 3, 9\\})$. The proof runs through the attached scheme $X(\\Gamma)$, whose relations are the two-way distance classes of $\\Gamma$. Because $\\Gamma$ is circulant, $X(\\Gamma)$ is a translation scheme on a cyclic group; because it is primitive in the association-scheme sense (every non-diagonal relation generates the scheme), an external theorem (Lemma 4.1) forces the group to have prime order and the scheme to be cyclotomic. The cyclotomic structure lets the authors rule out girth greater than 3: if a circuit of type $(1, g-1)$ with $g > 3$ existed, field multiplication would force a set identity $Y_i = iY_1$ and eventually $p = g$, making $\\Gamma$ a circuit, contrary to the standing assumption. With girth 3, the relation $R_1 = \\Gamma_{(1,2)}$ and $R_2 = \\Gamma_{(2,3)}$ satisfy conditions (1)--(3) of Theorem 1.1, and the pseudocyclic case forces the 13-point cyclotomic scheme, giving the exceptional digraph. The Paley and circuit cases correspond to the 2-class schemes.","pith_inferences":["Because the reduction to cyclotomic schemes runs through cyclic Sylow subgroups, the natural next target is primitive weakly distance-regular Cayley digraphs over other finite abelian groups; whether an analogue of Lemma 4.1 exists there would decide if the same three-family picture persists.","The exceptional connection set $\\{1, 3, 9\\}$ modulo 13 is a cyclotomic coset of index 4 in $\\mathbb{Z}_{13}^{\\times}$; this suggests testing computationally whether similar cyclotomic-coset Cayley digraphs over larger prime fields produce any weakly distance-regular examples, which the theorem says they cannot in the primitive circulant setting.","The paper notes in Remark 3.7 that no example is known for one subcase of Theorem 1.1; since such a scheme would not be pseudocyclic, it could not arise as the attached scheme of a circulant digraph, so the digraph classification does not depend on resolving that open case."],"forward_implications":["Every primitive weakly distance-regular circulant digraph has either two two-way distance classes (Paley or circuit) or four two-way distance classes (the 13-vertex exceptional case); no other class numbers occur.","The vertex count of any such digraph is prime: $p$ for Paley digraphs and circuits, and 13 for the exceptional case, because the attached scheme must be cyclotomic over a prime field.","The exceptional digraph $\\mathrm{Cay}(\\mathbb{Z}_{13}, \\{1, 3, 9\\})$ is not an ad hoc example; it is forced by the classification of pseudocyclic skew-symmetric 4-class association schemes.","The first part of Theorem 1.1 holds without the pseudocyclicity assumption up to the conclusion $d = 4$; only the identification with $\\mathrm{Cyc}(13, 4)$ needs pseudocyclicity."],"supporting_citations":[{"why":"Supplies the theorem quoted as Lemma 4.1, which reduces primitive translation schemes on cyclic groups to prime-order cyclotomic schemes and is the bridge to the field-based argument.","marker":"[2, Theorem 2.10.5]"},{"why":"Gives the parameter restrictions and classification of four-class skew-symmetric association schemes used in Lemma 2.3 to force $|X| = 13$ from $p_{1,1}^{2*} = 0$.","marker":"[5, Theorem 3.3]"},{"why":"Provides the classification result for association schemes with 13 or 15 points that identifies the 13-point pseudocyclic skew-symmetric scheme as $\\mathrm{Cyc}(13, 4)$.","marker":"[4, Result 1]"},{"why":"Introduces weakly distance-regular digraphs and their attached association schemes, the object class that the paper classifies for circulant digraphs.","marker":"[8]"}],"fun_headline_variants":["Three families complete: primitive weakly distance-regular circulants","All primitive weakly distance-regular circulants: only three families","Classification complete: Paley, prime cycles, and a 13-vertex exceptional","Three and only three: primitive weakly distance-regular circulants","Just three: Paley, prime cycles, and a 13-vertex digraph"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire classification rests on the cited theorem that a primitive translation scheme on a cyclic group must have prime order and be cyclotomic; if the attached schemes of these digraphs fail that theorem's hypotheses, the reduction that drives the proof collapses.","fun_headline_variants_meta":{"raw":{"variants":["Three families complete: primitive weakly distance-regular circulants","All primitive weakly distance-regular circulants: only three families","Classification complete: Paley, prime cycles, and a 13-vertex exceptional","Three and only three: primitive weakly distance-regular circulants","Just three: Paley, prime cycles, and a 13-vertex digraph"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001301,"raw_usage":{"total_tokens":5285,"prompt_tokens":903,"completion_tokens":4382,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":519,"completion_tokens_details":{"reasoning_tokens":4288}},"tokens_in":519,"tokens_out":4382,"duration_ms":28706,"temperature":1.0,"reasoning_tokens":4288,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:34:32.187761+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete falsifier: compute the attached association scheme of any weakly distance-regular Cayley digraph on $\\mathbb{Z}_p$ for $p > 13$ prime; if it is primitive and has more than two two-way distance classes, Theorem 1.3 is false. In particular, the proof's Step 2 implies that a counterexample of girth $g > 3$ would force $p = g$, so a search should focus on girth-3 candidates.","supporting_citations":[{"cited_title":"Wang and H","cited_arxiv_id":null,"evidence_quote":"Introduces weakly distance-regular digraphs and their attached association schemes, the object class that the paper classifies for circulant digraphs."}],"review_version":1}