{"id":"88b2fdef-db93-45ac-98fe-7c0515824d7f","arxiv_id":"1908.08642","paper_version":4,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A Blackwell-order-based definition of redundancy yields a new multivariate PID measure that satisfies natural axioms and is operationally grounded, while its union dual reduces to an existing measure.","lead":"This paper defines new measures of redundant and union information for a partial information decomposition, using the Blackwell order to compare how informative different sources are about a target. It argues that redundancy and union information need not obey the inclusion-exclusion principle and proves a uniqueness result from natural axioms.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Appendix D's proof of Theorem 2 misapplies the chain rule; the union-side Blackwell property is unproven as written, though it appears fixable.","rationale":"The paper is a serious theoretical contribution: Theorem 3's uniqueness proof and Theorem 9's equivalence are internally consistent, and the released code provides some independent support. My concern is narrower but real: the printed proof of the union-side Blackwell property (Theorem 2) contains an incorrect chain-rule identity and a wrong Markov-chain assertion. Because the abstract and Section III B advertise operational Blackwell guarantees for both redundancy and union information, this proof gap matters for the manuscript's rigor. It is fixable, so the appropriate verdict is CONDITIONAL acceptance pending a corrected Appendix D. The reader's weaker assumption about the Blackwell relation being the right notion of information containment is a modeling choice, not a defect; I agree that it is the main philosophical commitment, but it is not my primary objection.","tokens_in":33346,"tokens_out":23973,"duration_ms":221534,"concrete_test":"Independently recompute the chain-rule decomposition for sY X1Q: I_s(Y;X1,Q)=I_s(Y;X1)+I_s(Y;Q|X1)=I_p(Y;X1), since Y−X1−Q. Use I_s(Y;X1,Q)=I_s(Y;Q)+I_s(Y;X1|Q) to get I_s(Y;Q)=I_p(Y;X1)−I_s(Y;X1|Q). Substitute this into the 'only if' argument for Theorem 2. If I_p(Y;X1)=I⋆∪=I_s(Y;Q), it follows that I_s(Y;X1|Q)=0, so p(x1|y)=∑q p(x1|q)s(q|y), i.e. sQ|Y≼pX1|Y; transitivity with pXj|Y≼sQ|Y gives the theorem. If this corrected derivation cannot be completed, Theorem 2 is not supported.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"In Appendix D, proof of Theorem 2, the joint distribution sY X1Q = sQ|X1(q|x1)pY X1(y,x1) is constructed from pX1|Y ≼ sQ|Y. This distribution satisfies the Markov chain Y−X1−Q, so I_s(Y;Q|X1)=0 and the correct chain-rule identity is I_s(Y;Q)=I_p(Y;X1)−I_s(Y;X1|Q). The proof instead uses I_s(Y;Q)=I_p(Y;X1)+I_s(Y;Q|X1), treating Y−Q−X1 as if it held. Consequently the printed 'only if' direction does not establish the needed Markov condition Y−Q−X1, and Theorem 2 (the union-side multivariate Blackwell property) is unproven as written. The same appendix has a sign error in Eq. (D2) for Theorem 1; there the conclusion survives after replacing '+' with '−'. The uniqueness theorem (App. C) and the I⋆∪=Ip* equivalence (App. B) appear sound.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper proposes a channel-based partial information decomposition. The redundancy measure I*_cap (Eq. (15)) is defined as the maximum mutual information of a channel sQ|Y that is a Blackwell garbling of every source channel pXi|Y; the union information I*_cup (Eq. (19)) is defined dually. The authors prove that I*_cap satisfies a multivariate Blackwell property (Theorem 1), that I*_cup satisfies the analogous property (Theorem 2), that both measures are uniquely characterized by a set of axioms including Garbling Equality and Existence (Theorems 3 and 4), and that I*_cup agrees with the previously proposed Ip* of Bertschinger et al. and Griffith and Koch (Theorem 9). The paper also discusses the violation of the inclusion-exclusion principle, relations to Gacs-Korner common information, comparisons with prior PID measures, and generalizations of the framework.","tokens_in":33593,"tokens_out":10137,"duration_ms":92054,"significance":"If the results are correct, this is a significant contribution to the PID literature. The definitions are explicit, parameter-free, and have a clear decision-theoretic interpretation via Blackwell's theorem; the uniqueness theorems provide a principled way to select a multivariate redundancy measure; and the equivalence I*_cup = Ip* connects the proposal to a previously studied optimization problem. The paper also provides a practical vertex-enumeration algorithm and public code, and its treatment of the inclusion-exclusion principle is thought-provoking. The main reservations are localized proof defects in Appendix D; they do not, in my reading, invalidate the conceptual framework, but they must be repaired before the theorems can be considered proven.","major_comments":[{"comment":"The proof of the 'only if' direction misapplies the chain rule. The joint distribution sY X1Q is defined as sQ|X1(q|x1)pY X1(y,x1), which gives the Markov chain Y-X1-Q, so Is(Y;Q|X1)=0 and the correct identity is Is(Y;Q)=Ip(Y;X1)-Is(Y;X1|Q). The printed Eq. (D4), Is(Y;Q)=Ip(Y;X1)+Is(Y;Q|X1), follows only under the opposite Markov chain Y-Q-X1, which is not the one constructed. Consequently, from Ip(Y;X1)=I*_cup one cannot draw the printed conclusion that pX1|Y is a garbling of sQ|Y. The argument is repairable by using the correct sign and then inferring Is(Y;X1|Q)=0, but as written Theorem 2 is unproven.","section":"Appendix D, proof of Theorem 2 (Eq. (D4))"},{"comment":"The same sign error appears in Eq. (D2): equating the two chain-rule expansions gives Is(Y;Q)=Ip(Y;X1)-Is(Y;X1|Q), not Is(Y;Q)=Ip(Y;X1)+Is(Y;X1|Q). With the printed plus sign, the assumption Ip(Y;X1)=I*_cap does not imply Is(Y;X1|Q)=0, so the printed 'only if' direction does not establish the multivariate Blackwell property for I*_cap. Replacing '+' with '-' fixes the immediate step; the rest of the argument then goes through.","section":"Appendix D, proof of Theorem 1 (Eq. (D2))"}],"minor_comments":[{"comment":"The theorem statement lists only Symmetry, Self-union, Garbling Equality, and Existence, but the proof in Appendix C and the axiom list in the same section include Monotonicity; the theorem statement should be corrected.","section":"Section III C, Theorem 4"},{"comment":"The equation for the marginal sY Q sums over y on the right-hand side; it should sum over x1, and the notation for the marginal is inconsistent.","section":"Appendix D, proof of Theorem 2"},{"comment":"The sentence 'Null Equality is implied by Garbling Equality (so I*_cap obeys it)' should refer to I*_cup, since Null Equality is the union-side dual of Target Equality.","section":"Section IV A"},{"comment":"The constraints are written with pXi|Z instead of pXi|Y in several places; the symbol Z should be Y throughout.","section":"Appendix B"},{"comment":"The inequality 'I*_cap(...) >= I*_cup(...)' contains a typo; the first symbol should be I*_cup.","section":"Appendix C, proof of Theorem 4"}],"recommendation":"major_revision","confidential_remarks":"Both substantive proof problems are confined to Appendix D and appear straightforwardly repairable. I would ask the author to supply a corrected Appendix D and to double-check the statement of Theorem 4. I do not see grounds for rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this PID paper has a genuinely new redundancy measure, a clean axiomatic characterization, and honest ties to prior union measures. The reader's report is right to accept in spirit, but it missed a real proof error in Appendix D: the second multivariate Blackwell theorem (Theorem 2) is not proven as printed. It is a local, fixable problem, not a fatal one.\n\nWhat's new: I*_cap (Eq. 15) — maximum mutual information over channels sQ|Y that are garblings of every source channel — is a fresh way to define redundancy, and the Blackwell decision-theoretic reading gives it operational content. The generalized framework (Eqs. 31-32) organizes several earlier proposals as instances; the uniqueness result (Theorem 3) is a substantive contribution; and the proof that union information I*_cup equals Ip* (Theorem 9) is correct and properly credits Bertschinger et al. and Griffith-Koch. The examples, especially the COPY gate where I*_cap becomes Gács-Körner common information, are illuminating. Code is provided.\n\nThe soft spot: Appendix D. In the proof of Theorem 2, the joint sY X1Q is defined as sQ|X1 pY X1, which gives the Markov chain Y-X1-Q, not Y-Q-X1. The proof uses the wrong chain-rule expansion, so the only-if direction does not establish the condition needed; the printed argument is unsound. Fix: use the correct identity I_s(Y;Q) = I_p(Y;X1) - I_s(Y;X1|Q) (a minus, not a plus). Then the desired conclusion follows. Eq. (D2) in the Theorem 1 proof has the same sign error; there too the conclusion survives after the sign correction. The uniqueness proofs (Appendix C) and the I*_cup = Ip* equivalence (Appendix B) look fine. There's also a notational slip in Theorem 4's proof where I*_cap appears instead of I*_cup. None of this damages the main contributions, but it means the paper is not in publishable shape as-is.\n\nA separate point: the Blackwell/garbling relation is the load-bearing modeling choice. The paper argues for it well and is explicit that it only captures mechanistic redundancy. If you think information containment should be defined more leniently or should incorporate source correlations, the measure changes. That's a scope condition, not an error.\n\nWho it's for: anyone working on partial information decomposition or multivariate information measures. It deserves a serious referee and a request for minor-to-major revision. After the Appendix D proofs are corrected, it would be a solid contribution.","headline":"A genuinely new PID redundancy measure with a clean axiomatic story, but the Appendix D proof of the union-side Blackwell property has a chain-rule error that needs fixing before publication.","tokens_in":34070,"tokens_out":6634,"would_cite":true,"duration_ms":58509,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94A17","94A15","62B15"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that a single channel-optimization problem defines the unique redundancy measure for partial information decomposition, grounded in Blackwell's operational order.","keywords":["partial information decomposition","redundancy","synergy","Blackwell order","garbling","union information","mutual information","axiomatic information theory"],"falsifier":"Compute $I^\\star_\\cap$ for the classic example $Y = X_1 \\,\\mathrm{AND}\\, X_2$ with independent uniform binary sources: the paper predicts approximately $0.311$ bits, so an independent implementation of Eq. (15) returning a different value would refute the construction. Likewise, for $Y=(X_1,X_2)$ with a full-support joint distribution, Theorem 5 predicts $I^\\star_\\cap = C(X_1 \\wedge X_2)=0$ even when $I(X_1;X_2)>0$; any positive redundancy in that setup would falsify the identification.","tokens_in":33120,"feed_emoji":"🧩","tokens_out":5546,"duration_ms":55478,"temperature":0.7,"pith_summary":"This paper proposes a way to decompose the information a set of sources carries about a target into redundancy, synergy, unique, and union parts. Its central move is to define redundancy as the information carried by the most informative channel that is a noisy degradation (garbling) of every source channel, and union as the least informative channel that dominates every source. The author proves this redundancy measure is the unique one satisfying five natural axioms, and that it satisfies a multivariate analogue of the Blackwell property connecting information order to decision problems. The union measure is shown to equal a previously proposed quantity, so the framework also supplies a general multivariate synergy measure. The paper argues that the usual inclusion-exclusion rule of set theory should not be expected to hold between redundancy and union information.","feed_headline":"Unique redundancy measure emerges from Blackwell's channel order","feed_subtitle":"The measure works for any number of sources and gives redundancy and synergy an operational meaning.","key_machinery":"The machinery is the Blackwell order (garbling relation) $p_{B|Z} \\preceq p_{C|Z}$, which holds when sampling from $p_{C|Z}$ and then applying a fixed noisy channel can reproduce $p_{B|Z}$. This order formalizes what it means for one source to be more informative than another, and its decision-theoretic content comes from Blackwell's theorem. The paper builds redundancy and union information as the information-theoretic analogues of set intersection and union: redundancy is the maximum mutual information over channels below every source, and union is the minimum over channels above every source. The feasible sets are convex polytopes, so redundancy can be computed by vertex enumeration, with Theorem 8 bounding the required cardinality of the auxiliary variable $Q$. Garbling Equality replaces the earlier Deterministic Equality axiom, and together with Existence it makes the axiom system strong enough for uniqueness.","core_discovery":"The central discovery is a channel-based definition of redundancy: $I^\\star_\\cap(X_1;\\ldots;X_n \\to Y) = \\max_{s_{Q|Y}} I_s(Q;Y)$ subject to $s_{Q|Y}$ being a garbling of each source channel $p_{X_i|Y}$. This makes set-theoretic intersection operational: the intersection of information sets is the largest piece of information contained in every source, where containment is the decision-theoretic Blackwell order. Theorem 1 shows a source has no unique information exactly when its channel is a garbling of every other source. Theorem 3 shows that under Symmetry, Self-redundancy, Monotonicity, Garbling Equality, and Existence, $I^\\star_\\cap$ is the unique redundancy measure. The dual union measure $I^\\star_\\cup$ equals the previously proposed $I_p^*$ of Bertschinger et al. and Griffith and Koch, giving a multivariate synergy measure. The measures are channel-oriented, depending only on the pairwise marginals $p_{YX_i}$, so they quantify mechanistic rather than source redundancy.","pith_inferences":["As an extension, the same max/min template could be run with other 'more informative' relations: replacing Blackwell order with conditional independence recovers the $I^\\mathrm{GH}_\\cap$ measure, and deterministic functional containment recovers $I^\\wedge_\\cap$, suggesting the paper's framework is a unifying schema for existing redundancy proposals.","The convex-maximization formulation is NP-hard in general, so scaling to many high-cardinality sources will require approximation algorithms or structural assumptions; jointly Gaussian or other continuous extensions are a natural testbed where convex optimization may become tractable.","Because the measure ignores correlations among sources by construction, applying it to data with strong source dependence could undercount redundancy that arises purely from source correlations; combining it with a source-redundancy term is a possible extension the paper does not develop."],"forward_implications":["Any number of sources can be handled: the definitions and optimization problems are not restricted to the bivariate case.","A source carries no unique information exactly when its channel is a garbling of every other source, giving the Blackwell property a multivariate form.","The union measure equals the previously proposed $I_p^*$, so the resulting synergy extends those proposals to $n$ sources.","The inclusion-exclusion principle fails for these measures, and Lemma 6 shows that any measure satisfying Independent Identity must violate inclusion-exclusion for three or more sources.","When the target is the joint outcome $(X_1,X_2)$, redundancy equals Gács-Körner common information, so independent sources have zero redundancy about their joint outcome."],"supporting_citations":[{"why":"Blackwell's theorem, which supplies the operational meaning of the garbling relation used throughout the paper.","marker":"[26]"},{"why":"Williams and Beer introduced the PID framework and its redundancy axioms, which this paper extends.","marker":"[10]"},{"why":"Bertschinger et al. proposed the Blackwell property and the quantity $I_p^*$; the paper proves its union measure equals $I_p^*$.","marker":"[16]"},{"why":"Griffith and Koch proposed $I_p^*$ as a union information measure, the quantity the paper's $I^\\star_\\cup$ is shown to match.","marker":"[20]"},{"why":"Gács-Körner common information, which Theorem 5 identifies with redundancy when the target is the joint outcome.","marker":"[27]"},{"why":"Rauh et al. supplied the incompatibility argument that the paper adapts into Lemma 6 against inclusion-exclusion.","marker":"[29]"},{"why":"Griffith and Ho's conditional-independence redundancy $I^\\mathrm{GH}_\\cap$, which the paper compares with $I^\\star_\\cap$ and gives an operational interpretation via Theorem 7.","marker":"[21]"},{"why":"Ince's Independent Identity axiom, which $I^\\star_\\cap$ satisfies and which drives the inclusion-exclusion impossibility.","marker":"[23]"}],"fun_headline_variants":["Blackwell order gives unique redundancy measure","Operational PID: redundancy as channel garbling","Axiomatic uniqueness for PID via Blackwell order","Channel order defines unique information decomposition","Redundancy via garbling: new PID from Blackwell"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction rests on accepting that one source's information is contained in another's exactly when the first is a noisy degradation (a 'garbling') of the second; choose a different notion of containment, such as deterministic dependence or conditional independence, and the redundancy value and uniqueness theorem change.","fun_headline_variants_meta":{"raw":{"variants":["Blackwell order gives unique redundancy measure","Operational PID: redundancy as channel garbling","Axiomatic uniqueness for PID via Blackwell order","Channel order defines unique information decomposition","Redundancy via garbling: new PID from Blackwell"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000253,"raw_usage":{"total_tokens":1550,"prompt_tokens":916,"completion_tokens":634,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":532,"completion_tokens_details":{"reasoning_tokens":566}},"tokens_in":532,"tokens_out":634,"duration_ms":7051,"temperature":1.0,"reasoning_tokens":566,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:34:02.035540+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute $I^\\star_\\cap$ for the classic example $Y = X_1 \\,\\mathrm{AND}\\, X_2$ with independent uniform binary sources: the paper predicts approximately $0.311$ bits, so an independent implementation of Eq. (15) returning a different value would refute the construction. Likewise, for $Y=(X_1,X_2)$ with a full-support joint distribution, Theorem 5 predicts $I^\\star_\\cap = C(X_1 \\wedge X_2)=0$ even when $I(X_1;X_2)>0$; any positive redundancy in that setup would falsify the identification.","supporting_citations":[],"review_version":1}