{"id":"6ba09d23-de47-4283-b8dc-e06eb8257f7d","arxiv_id":"2506.03361","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"The i-shot capacities of the Diamond, Butterfly, and E_t networks under a fixed-edge adversary are log_{|A|}(|A|^i - b)/i, while a switching adversary yields no gain over one-shot capacity.","lead":"This paper computes how much communication capacity grows when a network with an adversary restricted to a fixed set of edges is used many times instead of once. It shows gains for the Diamond, Butterfly, and E_t networks when the adversary cannot switch edges between rounds, and no gains when it can.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Remark 4.7's structural claim for D_t is false: H_Dt's largest unambiguous code is |A|^{2t}, not |A|, so Proposition 4.8 and Table 2's D_t entry are unsupported; the same flaw undermines Remark 4.10.","rationale":"The reader's weakest-assumption pinpoints the right region: the structural remarks carry the upper bounds for C_t, D_t, and E_t. My stress test makes the concern sharper: Remark 4.7 is not just a sketch with an omitted proof; it contains a false statement about a standard Hamming channel. Since Proposition 4.8 is proved only by invoking that remark, the claimed D_t capacity is unsupported. The same underlying mistake appears in Remark 4.10 and Proposition 4.11 for Scenario A.2 of E_t, where the Hamming channel's true maximum |A| is replaced by |A|-b. These are concrete correctness risks, not mere disagreements with prevailing consensus. The central Butterfly results in §5 are not directly affected, because they rely on the Diamond Network capacity from Proposition 4.2 rather than on D_t, but the paper's broader claim of computing multishot capacities for the families in Table 2 is not established. Given that the main gain/no-gain contrast for D and B may still be correct and the lower bounds are explicit, I do not see grounds to reject the entire paper; the appropriate disposition remains conditional on replacing the flawed structural arguments. The Reed-Solomon check above would settle the D_t question immediately.","tokens_in":20963,"tokens_out":12723,"duration_ms":105911,"concrete_test":"Fix t=2 and alphabet F_16. Construct the [8,4,5] Reed-Solomon code over F_16, e.g. the evaluation of degree-3 polynomials at 8 distinct field elements. This code has 16^4 codewords and minimum Hamming distance 5=2t+1, so its radius-2 Hamming balls are pairwise disjoint; hence it is an unambiguous code for H_D2 of size 16^4. This directly falsifies the assertion in §4.2.2 that the largest unambiguous code for H_Dt has size |A|, and shows that Proposition 4.8's upper-bound strategy cannot be sound as written. A matching check for H_Et: a length-3, distance-3 MDS code over A has |A| codewords, contradicting the claimed maximum |A|-b when b>0.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing weak point is the upper-bound machinery for the family results in §4.2. Section 4.2.2 defines H_Dt(x) as the Hamming ball of radius t in A^{4t} and asserts that the largest unambiguous code for H_Dt has cardinality |A|. This is false. An unambiguous code for this channel is exactly a q-ary code of length 4t with minimum Hamming distance at least 2t+1; the Singleton bound allows up to q^{4t-(2t+1)+1}=q^{2t} codewords, and for q≥4t an MDS/Reed-Solomon code attains that size. Thus for t=2, q=16 there is an unambiguous code of size 16^4 for H_D2, not 16. The subsequent 'if and only if' condition in Remark 4.7 using distance 3t is also inconsistent with unambiguity, which only requires 2t+1 in some block, and the claim that two weight-3t vectors are at Hamming distance at most t+1 is false. Consequently Proposition 4.8's proof, which relies on this remark, does not establish C_i(D_t)=1, and Table 2's D_t row is unsupported. The same defect appears in Scenario A.2 for E_t: H_Et is exactly the length-(2t+1) radius-t Hamming channel whose largest unambiguous code is |A|, yet Remark 4.10 and Proposition 4.11 assume the maximum is |A|-b. These are not merely omitted details; the stated structural facts contradict standard code bounds. The Butterfly Network results in §5 do not directly depend on D_t, but the paper's advertised computation of multishot capacities for the listed families does.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper investigates the i-shot capacity of networks with restricted adversaries, considering two adversarial models: the adversary is frozen to the same vulnerable edge set across uses (Scenario A.1) or may switch edges between uses (Scenario A.2). The main results are capacity formulas for the Diamond Network, the Mirrored Diamond Network, families C_t, D_t, E_t, and the Butterfly Network, together with a multishot double cut-set bound and a reduction from 3-level to 2-level networks. The lower-bound constructions are explicit and the Butterfly/Diamond contrast is the paper's strongest conceptual contribution. However, the upper-bound proofs for the family results in Section 4.2 rely on structural lemmas about unambiguous codes for product Hamming channels that are only sketched and, in the cases of D_t and E_t, are not correct as stated.","tokens_in":21360,"tokens_out":12741,"duration_ms":146778,"significance":"The question addressed—whether multiple uses of a network can increase capacity when the adversary is restricted to a vulnerable region—is natural and has not been previously studied. The Scenario A.1/A.2 contrast is conceptually interesting, and the Butterfly Network results (Propositions 5.6 and 5.7) provide a concrete, checkable instance where freezing the adversary's edge set yields a strict multishot gain. The multishot cut-set bound framework in Section 5 is a useful structural tool. However, the paper's advertised computation of the family capacities in Table 2 is not presently supported: the upper-bound machinery in Section 4.2 depends on structural claims that are false or inadequately proved. If the authors can supply correct proofs for the C_t, D_t, and E_t upper bounds, the paper would be a solid contribution; as it stands, only the Diamond, Mirrored Diamond, and Butterfly results are fully established.","major_comments":[{"comment":"The claim that H_Dt : A^{4t} -> A^{4t}, H_Dt(x) = {y : d_H(x,y) ≤ t}, has largest unambiguous code of size |A| is false. An unambiguous code for this channel is exactly a q-ary code of length 4t and minimum Hamming distance at least 2t+1, and the Singleton bound gives size at least |A|^{2t} for sufficiently large alphabets (e.g., |A|=16, t=2 gives 16^4 codewords). The subsequent 'if and only if' condition using block distance 3t is also incorrect: for the i-fold channel unambiguity requires some block to have distance at least 2t+1, not 3t. Since Proposition 4.8's upper bound relies on Remark 4.7, the result C_i(D_t)=1 and the D_t row of Table 2 are unsupported.","section":"§4.2.2, Remark 4.7 and Proposition 4.8"},{"comment":"The same defect appears for E_t. H_Et is a Hamming ball of radius t in A^{2t+1}, so the largest unambiguous code for H_Et has size |A| (attained by the repetition code), not |A|-b. The reserved-vector set B of size b is a property of the network code used in the one-shot construction, not of the abstract channel H_Et. Consequently the claimed upper bound |C| ≤ (|A|-b)^i for codes unambiguous for H^i_Et is false in general; for example the product repetition construction gives |C| = |A|^i. Proposition 4.11's Scenario A.2 capacity is therefore not established, and Remark 4.12 inherits the problem.","section":"§4.2.3, Remark 4.10 and Proposition 4.11"},{"comment":"The structural lemma for C_t is also not proved correctly. The sketch asserts that after forcing some initial coincidence, the remaining codewords must have Hamming weight 2t+1 and that any two such vectors have Hamming distance at most t+1; this is false, since two weight-(2t+1) vectors in A^{2t+1} can have distance 2t+1. The argument also claims that a three-word code of minimum distance 2t+1 contradicts C_1(H_Ct)=1, but for |A| ≥ 3 the repetition code already gives three such codewords. Since Proposition 4.6's upper bound depends on Remark 4.5, the C_t result currently lacks a valid proof; a complete and correct proof is needed.","section":"§4.2.1, Remark 4.5 and Proposition 4.6"}],"minor_comments":[{"comment":"There is a typo in the sentence introducing the network code F: 'LetFwhereV1,V2,V3 andV4 proceed as follows: ff' should read 'Let F where V1, V2, V3 and V4 proceed as follows:'.","section":"§5.1, Proposition 5.6 proof"},{"comment":"The text refers to 'H_i_C' and 'H_C' in the last two sentences; these should be 'H^i_Et' and 'H_Et' respectively.","section":"§4.2.3, Remark 4.10"},{"comment":"The sentence 'Thus, we have that C_i(Ct) = C_i(Dt) = 1 in Scenario A.2' attributes an A.2 result to C_t that Proposition 4.6 does not explicitly prove; the argument that the proof is scenario-independent should be spelled out for C_t.","section":"§4.2.2, Proposition 4.8 discussion"}],"recommendation":"major_revision","confidential_remarks":"The paper's reliance on the authors' prior work [7] for the Diamond and Mirrored Diamond results is disclosed and is not by itself a problem. The main concern is that the upper-bound lemmas in Section 4.2 are presented as sketches with 'we claim' formulations, and in the case of D_t and E_t they are demonstrably false as stated. If the authors can replace these arguments with correct proofs, or remove the unsupported family results from the claimed contributions, the remaining Butterfly and cut-set results would be publishable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the multishot capacity question for frozen vs switching adversaries is a good one, and the Butterfly results plus the multishot double cut-set bound are real contributions. But the paper overreaches on the D_t and E_t families: the key structural remark about H_Dt is simply false, and the E_t analog is at best unproven. This is not a minor gap; it knocks out Table 2's D_t and E_t entries.\n\nWhat is genuinely new and good: Theorem 5.3, the multishot Double Cut-Set Bound, and Corollary 5.5, the reduction from 3-level to 2-level networks, are clean and useful. The Butterfly capacity formulas (Propositions 5.6 and 5.7) are explicit, the lower-bound constructions are checkable, and the upper bound via the reduction to the Diamond Network works. The Diamond Network multishot results themselves come from the authors' Allerton paper [7], which is disclosed; that's acceptable as a foundation, but it means the novelty there is limited.\n\nThe soft spot is in Section 4.2.2. The channel H_Dt is defined as the Hamming ball of radius t in A^{4t}. An unambiguous code for that channel is exactly a q-ary code of length 4t with minimum Hamming distance at least 2t+1. The Singleton bound allows up to q^{2t} codewords (attained for large enough q by Reed-Solomon codes), not q. So Remark 4.7's claim that the largest unambiguous code has size |A| is false, and its 3t distance condition is wrong. Proposition 4.8's upper bound depends on that remark, so C_i(D_t)=1 is unsupported. The same pattern appears in Remark 4.10 for E_t: H_Et is the radius-t ball in A^{2t+1}, whose largest unambiguous code has size |A|, not |A|-b. So the Scenario A.2 upper bound for E_t does not follow. The C_t case may survive, since the Singleton bound does give |A| for that length, but Remark 4.5 is only a sketch.\n\nThis is a serious flaw, but it is localized. The qualitative gain/no-gain contrast is plausible and the Butterfly/Diamond results are probably right. I would send this to peer review, but only with the expectation of major revision: the authors need to either prove the structural claims or delete the D_t and E_t capacity computations. As it stands, I would not cite the family results.","headline":"Plausible Diamond/Butterfly results, but the D_t and E_t upper bounds rest on a false claim about Hamming-ball code sizes.","tokens_in":21911,"tokens_out":4267,"would_cite":false,"duration_ms":39704,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94A24","94B60"],"pacs":[],"model":"deepseek-v4-flash","headline":"Multishot capacity of restricted-adversary networks depends on whether the adversary can switch edges.","keywords":["network coding","adversarial network coding","multishot capacity","restricted adversary","network decoding","Diamond Network","Butterfly Network","cut-set bound"],"falsifier":"Check the true size of the largest unambiguous code for the product channel $H_{D_t}^i$ under the blockwise distance rule stated in Remark 4.7. If, for some $t \\ge 2$ and a large alphabet, a code with more than $|A|^i$ blocks exists, then the upper bound in Proposition 4.8 fails and the claimed capacity for $D_t$ is too high.","tokens_in":20708,"feed_emoji":"🦋","tokens_out":10050,"duration_ms":100548,"temperature":0.7,"pith_summary":"This paper asks whether an adversarial network whose errors are restricted to a proper subset of edges can carry more information when used several times instead of once. It establishes that the answer is yes when the adversary is frozen to the same vulnerable edges in every round, and no when the adversary may switch edges between rounds. For the Diamond Network and the Butterfly Network, the $i$-shot capacity in the frozen case is $\\log_{|A|}(|A|^i - 1)/i$, which grows toward $1$, while the switching case keeps the one-shot value $\\log_{|A|}(|A| - 1)$. These exact formulas, together with a multishot cut-set bound reducing three-level networks to two-level ones, map out which networks benefit from repeated use and which do not.","feed_headline":"When the adversary can't switch edges, repeated use beats one shot","feed_subtitle":"Repeated rounds beat one shot only while the attacked edge stays fixed; if it may switch, capacity stays put.","key_machinery":"The central objects are the $i$-fold product channel $\\Omega^i$, built from $i$ independent uses of a network, and the notion of an unambiguous code: a set of messages whose worst-case output sets at every terminal are pairwise disjoint. Against this backdrop, the paper analyzes two adversary models, A.1 and A.2, and shows that the A.1/A.2 distinction controls whether the reserved-vector strategy from one-shot network decoding can be repeated across rounds. A multishot Double Cut-Set Bound then reduces a three-level network to an associated two-level network, which is how the Butterfly Network's capacity is obtained from the Diamond Network's.","core_discovery":"The paper's central claim is that the multishot capacity of a network with a restricted adversary is controlled by whether the adversary can change the attacked edges between uses. In Scenario A.1, where the adversary must keep attacking the same vulnerable edges, the Diamond Network $\\mathcal{D}$ and the Butterfly Network $\\mathcal{B}$ have $i$-shot capacity $\\log_{|A|}(|A|^i - 1)/i$; in Scenario A.2, where the adversary may switch edges each round, the capacity stays at the one-shot value $\\log_{|A|}(|A| - 1)$. The Mirrored Diamond Network $\\mathcal{S}$ and the families $C_t$ and $D_t$ have capacity $1$ in both scenarios, while family $E_t$ gains in Scenario A.1 and not in Scenario A.2. The paper also extends the Double Cut-Set Bound to repeated uses, which is the step that lets the Butterfly Network's capacity be derived from the Diamond Network's.","pith_inferences":["The freeze-versus-switch dichotomy probably applies beyond the networks studied here: any restricted-adversary network whose one-shot code reserves a fixed set of symbols for adversarial detection should show the same pattern, with the reserved set becoming a reserved vector over repeated rounds.","A natural next test, left open by the paper, is letting the vulnerable edge set itself change between rounds; the multishot capacity would likely interpolate between the frozen and switching values depending on how many vulnerable sets the adversary may choose.","If the structural lemmas behind the $C_t$, $D_t$, and $E_t$ upper bounds are repaired, the same blockwise-distance method could yield exact multishot capacities for general two-level networks whose one-shot capacity is still unknown; if they are not repaired, the proven part of the theory reduces to the Diamond and Butterfly cases."],"forward_implications":["Used repeatedly with a frozen adversary, the Diamond Network, Butterfly Network, and family $E_t$ achieve a strict capacity gain over one shot, with the gain disappearing when the adversary may switch edges.","The Mirrored Diamond Network and families $C_t$ and $D_t$ have the same capacity in the one-shot and multishot regimes in both scenarios, so repeated use gives no throughput benefit there.","The multishot Double Cut-Set Bound lets the capacity of a three-level network be bounded by that of an associated two-level network, which is how the Butterfly Network's exact capacity follows from the Diamond Network's.","For families $A_t$ and $B_s$, a capacity-achieving one-shot strategy would imply a multishot lower bound in the frozen-adversary scenario, indicating a gain once those one-shot capacities are settled."],"supporting_citations":[{"why":"Supplies the network-decoding model, the one-shot capacities of the families, and the Double Cut-Set Bound that the paper extends to repeated uses.","marker":"[2]"},{"why":"Defines unambiguous codes, $i$-th power channels, the Singleton Cut-Set Bound, and the repetition lower bound used in every capacity proof.","marker":"[14]"},{"why":"Earlier work by the same authors that already computed the Diamond and Mirrored Diamond multishot capacities in the two adversary scenarios.","marker":"[7]"},{"why":"Establishes the one-shot Diamond Network capacity and the partial-decoding strategy whose reserved-symbol mechanism the multishot constructions generalize.","marker":"[3]"},{"why":"Provides the diamond-network strategy used as the building block for the Scenario A.1 lower bounds.","marker":"[4]"}],"fun_headline_variants":["Fixed-edge adversary unlocks multishot capacity gains in networks","Multishot capacity rises only when adversary cannot switch edges","Adversary stuck on same edges: repeated use beats one shot","Networks gain from multishot if restricted adversary stays put","Restricted adversary that must persist enables multishot boost"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The upper bounds for the $C_t$, $D_t$, and $E_t$ families rest on structural remarks (4.5, 4.7, 4.10) stating that the largest unambiguous code on the repeated channel has exactly $|A|^i$ blocks, but those remarks are sketches; the $D_t$ version uses a $3t$-distance condition that appears inconsistent with the Hamming-ball channel actually defined there.","fun_headline_variants_meta":{"raw":{"variants":["Fixed-edge adversary unlocks multishot capacity gains in networks","Multishot capacity rises only when adversary cannot switch edges","Adversary stuck on same edges: repeated use beats one shot","Networks gain from multishot if restricted adversary stays put","Restricted adversary that must persist enables multishot boost"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000209,"raw_usage":{"total_tokens":1374,"prompt_tokens":878,"completion_tokens":496,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":494,"completion_tokens_details":{"reasoning_tokens":412}},"tokens_in":494,"tokens_out":496,"duration_ms":5667,"temperature":1.0,"reasoning_tokens":412,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T11:08:31.555201+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Check the true size of the largest unambiguous code for the product channel $H_{D_t}^i$ under the blockwise distance rule stated in Remark 4.7. If, for some $t \\ge 2$ and a large alphabet, a code with more than $|A|^i$ blocks exists, then the upper bound in Proposition 4.8 fails and the claimed capacity for $D_t$ is too high.","supporting_citations":[{"cited_title":"Beemer, A","cited_arxiv_id":null,"evidence_quote":"Supplies the network-decoding model, the one-shot capacities of the families, and the Double Cut-Set Bound that the paper extends to repeated uses."},{"cited_title":"Kschichang and A","cited_arxiv_id":null,"evidence_quote":"Defines unambiguous codes, $i$-th power channels, the Singleton Cut-Set Bound, and the repetition lower bound used in every capacity proof."},{"cited_title":"Cotardo, G","cited_arxiv_id":null,"evidence_quote":"Earlier work by the same authors that already computed the Diamond and Mirrored Diamond multishot capacities in the two adversary scenarios."},{"cited_title":"Beemer, A","cited_arxiv_id":null,"evidence_quote":"Establishes the one-shot Diamond Network capacity and the partial-decoding strategy whose reserved-symbol mechanism the multishot constructions generalize."},{"cited_title":"The Curious Case of the Diamond Network","cited_arxiv_id":"2107.02144","evidence_quote":"Provides the diamond-network strategy used as the building block for the Scenario A.1 lower bounds."}],"review_version":1}