{"id":"735f83a3-60e3-4524-bcce-68f414c6412a","arxiv_id":"2601.01445","paper_version":3,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"In finite scenarios, logical contextuality is equivalent to the existence of a logical Hardy-type paradox; strong contextuality corresponds to success probability 1.","lead":"This paper introduces 'logical Hardy-type paradoxes' and proves that, in any finite quantum scenario, a system is logically contextual exactly when such a paradox exists. It also links strong contextuality to paradoxes with success probability 1 and classifies paradoxes in the KCBS and two-qubit Bell scenarios.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorems 3-4 are asserted for all finite general systems but rely on a classical embedding into P(s_d(A)); for Kochen-Specker scenarios with s_d(A)=∅ the logical Hardy-type paradox is undefined/absent while strong contextuality is vacuous, so the universal statement is false as written.","rationale":"The most load-bearing claim is the universal equivalence. The paper itself flags the Kochen-Specker boundary (Section 4.2) but does not reconcile it with the definitions. Because Definition 4 is the only formal notion of logical Hardy-type paradox and it requires an embedding, the theorems cannot be true outside that class. The reader's weakest_assumption identifies exactly this. Secondary concerns (e.g., the (2,2,2) 'all 10 types' drawn from minimal-zero vectors) affect application claims, not the central equivalence; they would not change the conditional verdict. The concern is fixable by a scope restriction, so the verdict should remain CONDITIONAL (no change from the reader's CONDITIONAL).","tokens_in":21654,"tokens_out":9981,"duration_ms":92323,"concrete_test":"Use the 18-vector Cabello-Estebaranz-García-Alcaine KS set A (s_d(A)=∅) with the maximally mixed state ρ. Attempt to instantiate Definition 4: since A admits no classical embedding, e^c is undefined. Even if one formally works in P(∅), the empty family of events has classical conjunction equal to the top element, not ⊥, so no set {e_i} satisfies condition 1. Meanwhile the state is strongly contextual vacuously. Hence Theorem 4, read literally, fails for this system. The minimal repair is to add 'admitting a classical embedding' to the statements of Theorems 3-4 (and align Definition 6); the check is simply to confirm the repaired statements exclude this counterexample.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Definition 4 defines a logical Hardy-type paradox only for 'a finite epBA A admitting classical embedding,' i.e., with a map i_A: A → P(s_d(A)). Theorems 3 and 4, however, are stated for 'a general system (A,p)' without that qualification. This matters: the proofs construct events via e^c and reason inside A^c. If s_d(A)=∅ (a Kochen-Specker scenario), then A^c = P(∅) is a one-element algebra, no injective embedding exists, and e^c is undefined (or degenerate). Section 4.2 explicitly notes that any state on a Kochen-Specker scenario is trivially strongly contextual. But then Theorem 4 would assert a logical Hardy-type paradox with SP=1; the proof's set {¬e_λ: λ∈s_d(A)} is empty, and the empty conjunction equals the top element (not ⊥) in any Boolean algebra, so condition 1 of Definition 4 cannot be met. Thus the literal theorem is false or inapplicable for a class the paper itself names. The fix is to restrict the theorem statements to systems admitting a classical embedding (equivalently, s_d(A) nonempty, assuming the embedding conditions of Theorem A2/12), or to separately define the degenerate case. The central equivalence for the intended (Bell/contextuality) scenarios with nonempty s_d(A) is otherwise plausible; the issue is a scope mismatch, not a defect in the core construction.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a logical formalism for Hardy-type paradoxes in the event-based partial Boolean algebra framework. It defines a 'logical Hardy-type paradox' as a finite set of events whose classical images have empty conjunction, with all but one event having probability 1 and one having positive probability (Definition 4). The main claims are Theorem 3 (logical contextuality iff witnessing such a paradox) and Theorem 4 (strong contextuality iff such a paradox with SP=1), stated for arbitrary finite general systems. Applications include a paradox for Mansfield's (2,3,3) state, a classification of KCBS paradoxes with SP≈10.56%, and a partial classification for (2,2,2). The paper also provides an incidence-matrix/SAT algorithm for finding logically contextual states.","tokens_in":22016,"tokens_out":37990,"duration_ms":312831,"significance":"If the main equivalence were correct, it would unify and generalize earlier scenario-specific results (Mansfield-Fritz, Santos-Amaral) and would give a systematic route from incidence matrices to Hardy-type paradoxes. The constructive proof for Mansfield's state is a valuable explicit example, and the KCBS analysis is interesting. However, the paper's formal definition of logical contextuality (Definition 6) is not the standard sheaf-theoretic one, and the proof of Theorem 2 has a gap; in addition, Theorems 3-4 are stated without the classical-embedding hypothesis required by Definition 4, leaving Kochen-Specker scenarios problematic. These issues affect the central claims as written. The algorithmic machinery and examples may still be useful after revision.","major_comments":[{"comment":"Definition 6 is not equivalent to the standard sheaf-theoretic notion of logical contextuality, and Theorem 2's proof does not establish the stated equivalence. Counterexample: let A be the four-element Boolean algebra with atoms a,b and let p(a)=p(b)=1/2. Then pbar(a)=pbar(b)=1 and s_d(A)={λ_a,λ_b}. A state p_A^c on A^c=P({λ_a,λ_b}) satisfies p_A^c({λ_a})+p_A^c({λ_b})=1, so it cannot assign probability 1 to both singletons. Hence Definition 6 declares this classical (completely noncontextual) state logically contextual. The standard definition (and the characterization in Theorem 2) says it is logically noncontextual, because λ_a is a deterministic state with λ_a(e)=1 ⇒ pbar(e)=1. The flaw in the proof is in the '⇒' direction: it constructs a {0,1}-valued possibilistic collapse p' of a uniform state on Λ and then uses p'(e^c)=pbar(e) as if p' itself were a state in s(A^c). A real-valued","section":"Section 3, Definition 6; Section 4, Theorem 2"},{"comment":"Theorems 3 and 4 are stated for 'a general system (A,p)' without qualification, yet Definition 4 defines 'witnesses a logical Hardy-type paradox' only for a finite epBA A admitting a classical embedding i_A:A→A^c=P(s_d(A)). For a Kochen-Specker scenario, s_d(A)=∅, so A^c is the one-element Boolean algebra, no injective embedding exists, and e^c is degenerate (mapping every event to ∅). The paper itself notes in §4.2 that any state on such a scenario is trivially strongly contextual. But then Theorem 4 would assert a logical Hardy-type paradox with SP=1; the proof's candidate set {¬e_λ : λ∈s_d(A)} is empty, which cannot serve as a nonempty paradox required by Definition 4, and if one applied the formula anyway the embedding is not faithful. Thus the universal statements are false or ill-posed for a class the paper explicitly names. The theorems should be restricted to finite epBAs admitti","section":"Definition 4; Theorems 3-4; §4.2"}],"minor_comments":[{"comment":"The paper claims to 'classify all 10 types of quantum-observable Hardy-type paradoxes' on (2,2,2), but the analysis only treats Boolean vectors with the minimal number of three zeros (64 vectors out of 1240 logically contextual vectors). No argument is given that vectors with more zeros cannot be quantum-realized or give rise to further paradoxes, so the classification is incomplete.","section":"Section 6.2 and Conclusion"},{"comment":"The first filtering step uses only the necessary conditions of Lemma 6, not a sufficient condition for being a possibilistic collapse of a state on the atom graph. The pseudocode therefore may admit vectors that are not realizable possibilistic collapses; for the KCBS case the authors state the survivors were verified, but for (2,2,2) no such verification is shown.","section":"Section 6, Algorithm 1"},{"comment":"The non-realizability of b1-b3 is asserted via a 'similar contradiction' without details, and the uniqueness of the state realising b5 and the value SP≈10.56% rely on a numerical computation that is not fully specified.","section":"Section 6.1"},{"comment":"Notation inconsistencies: e^c vs ec; in §4.1 the conjunction '∧_{i=1}^6 e_i' is rendered as 'V6' in the text; Figure 4 lacks complete explanations; reference [28] is missing venue details.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The Definition 6 issue is more fundamental than the reader's report suggests; I would not accept the paper without replacing Definition 6 with the standard sheaf-theoretic definition and repairing the proof of Theorem 2. The Kochen-Specker scope issue is also serious but fixable. The authors should also temper the classification claims in §6.2 and the conclusion."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"I read the Liu et al. paper on logical Hardy-type paradoxes. The core result is genuinely useful: for any finite scenario with at least one deterministic state, logical contextuality is equivalent to the existence of a finite set of events, one possible and the rest certain, whose classical conjunction is impossible. That generalizes the earlier scenario-specific results and gives a clean algebraic criterion. The strong-contextuality version (SP=1) is a natural extension. The explicit paradox for Mansfield's (2,3,3) state is a good example, and the KCBS analysis—identifying a unique quantum-observable paradox type with SP≈10.56%—is a solid application.\n\nHowever, there is a scope mismatch in the main theorems. Definition 4 and the proofs rely on a classical embedding into P(s_d(A)), so the equivalence holds only when that embedding exists (i.e., when s_d(A) is nonempty). Yet Theorems 3 and 4 are stated for all general systems, with no such qualification. The paper itself notes in Section 4.2 that Kochen-Specker scenarios have s_d(A)=∅ and are trivially strongly contextual. But then Theorem 4 would require a logical Hardy-type paradox with SP=1, which cannot exist in the degenerate algebra P(∅). So the universal claims in the abstract are false as written. This is an overstatement, not a collapse of the central construction; the fix is to restrict the theorem statements or separately define the degenerate case.\n\nSecond, the (2,2,2) classification overreaches. The paper analyzes only the 64 Boolean vectors with exactly three zeros, finds 10 types, and then concludes that these are \"all 10 types of quantum-observable Hardy-type paradoxes.\" That is not all types—it is all types with minimal zeros. There could be other quantum-realizable states with more zeros. The claim should be softened.\n\nThird, some computational details are asserted rather than shown: the non-realizability of the other four KCBS types is dismissed with \"similar contradiction,\" and the numerical check for b5 is not backed by code, though the construction is explicit enough that an independent check is possible.\n\nWho is this for? Researchers working on contextuality, especially those interested in algorithmic construction of inequality-free proofs. The main equivalence is a real addition to the toolkit, and the generalization beyond Bell and n-cycle scenarios is a genuine step forward. I'd send it to peer review: with the scope restriction and the softened classification claim, it could become a solid contribution. I'd ask the authors to fix the statement of Theorems 3-4 and clarify exactly what is classified in the (2,2,2) case.","headline":"A useful unification of Hardy-type paradoxes and logical contextuality, but the universality claim outruns the definitions, and the (2,2,2) classification is narrower than advertised.","tokens_in":22501,"tokens_out":4578,"would_cite":true,"duration_ms":45782,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P13","81P10","03G12"],"pacs":["03.65.Ta"],"model":"deepseek-v4-flash","headline":"A finite quantum experiment is logically contextual exactly when it contains a logical Hardy-type paradox—a set of events, one possible and the rest certain, that classical logic says cannot all occur.","keywords":["Hardy-type paradox","logical contextuality","strong contextuality","partial Boolean algebra","event-based contextuality","KCBS scenario","incidence matrix","success probability"],"falsifier":"A counterexample would be a finite atom graph with at least one deterministic state and a Boolean vector b that satisfies Lemma 6 and has no solution M(A)x=b, yet for which no subset of events {e1,...,en} exists with one positive, the rest certain, and empty classical intersection. Since both conditions are finitely checkable, exhaustive search over all atom graphs on up to six vertices with a SAT solver would settle whether Theorem 3 is true as stated.","tokens_in":21524,"feed_emoji":"⚛️","tokens_out":5684,"duration_ms":52758,"temperature":0.7,"pith_summary":"The paper aims to show that Hardy-type paradoxes—inequality-free demonstrations of quantum contextuality—are not scattered special cases but the single logical signature of contextuality. It defines a logical Hardy-type paradox as any set of events in a finite scenario for which classical logic dictates that one event cannot occur while all the others do, and quantum mechanics makes one of them occur. The central result, Theorem 3, states that a general system is logically contextual if and only if it witnesses such a paradox; Theorem 4 pins strong contextuality to paradoxes with success probability exactly 1. The authors build a paradox even in a (2,3,3) state previously claimed to be Hardy-free, classify the KCBS scenario as admitting exactly one type of quantum-observable paradox at success probability about 10.56%, and recover the original Hardy paradox among ten types on the (2,2,2) scenario. If correct, this turns paradox-hunting into a systematic, algorithmic search.","feed_headline":"Hardy paradoxes are exactly logical contextuality","feed_subtitle":"Finite contextual scenarios always contain a Hardy-type paradox; KCBS admits exactly one kind, at about 10.56%.","key_machinery":"The load-bearing object is the classical embedding of the event algebra A into the power-set algebra A^c=P(s_d(A)) of its deterministic states, written e→e^c. It converts logic in the partial Boolean algebra into set-theoretic inclusion and lets 'classical logic says these events exclude each other' be stated as an empty intersection of the embedded events. Theorem 2 is the bridge: it characterizes logical contextuality as the existence of an event e with p(e)>0 such that every deterministic state in e^c must enforce some event that p forbids. Theorem 3 then rearranges those forbidden events into the logical Hardy paradox; the incidence matrix of the atom graph translates the whole condition","core_discovery":"The paper's central claim is an equivalence: for any finite general system (A,p) modeled by an exclusive partial Boolean algebra with a state, logical contextuality—the absence of a possibilistic global assignment matching all local certainties—occurs if and only if the system witnesses a logical Hardy-type paradox. The paradox is a finite set of events {e1,...,en} whose classical images have empty conjunction, with p(e_k)>0 for one k and p(e_i)=1 for all others. Strong contextuality is the special case where the success probability can be taken to be 1. The equivalence is constructive: the proof of Theorem 2 produces, from a violation of logical contextuality, an event e and, for each deter","pith_inferences":["Because the equivalence relies on the classical embedding A^c=P(s_d(A)), scenarios with no deterministic states (s_d(A)=∅) such as Kochen-Specker setups fall outside the theorem's stated scope; a natural test is to extend the construction by a limiting or relative notion of the classical algebra.","The SP≈10.56% for KCBS falls below the 1/9 upper bound for 5-cycle scenarios, so a dedicated optimization over the angle parameters in the KCBS construction may or may not reach 11.11%; the authors leave this open.","The incidence-matrix form suggests an automated catalogue: enumerating all finite atom graphs up to a small number of vertices and computing the maximal SP for each logical-contextual vector would yield a database of optimal inequality-free contextuality witnesses.","If logical contextuality is literally the same as a finite empty 'classical conjunction plus one positive probability,' then logical contextuality could be taught and verified as a purely combinatorial property, without invoking hidden-variable theories."],"forward_implications":["Paradox-hunting becomes algorithmic: any finite scenario can be searched by filtering Boolean vectors and testing M(A)x=b with a SAT solver; the 21 KCBS and 1240 (2,2,2) candidate vectors found in the paper illustrate the procedure.","The (2,3,3) state is resolved: it witnesses a six-event logical Hardy paradox, so the belief that general scenarios escape the equivalence is false.","Strong contextuality gets a quantitative marker: paradoxes can be graded by SP, with SP=1 exactly the strongly contextual systems (GHZ state, PR box, and Kochen-Specker scenarios).","The KCBS scenario is classified: exactly one type of quantum-observable logical Hardy paradox, with SP≈10.56% for the parameter setting; (2,2,2) has ten minimal types, one being the original Hardy paradox.","The construction extends to Cabello-type paradoxes by allowing two positive-probability events and a degree-of-success condition, as the authors note in their outlook."],"fun_headline_variants":["Logical contextuality equals Hardy paradox in all finite scenarios","Hardy paradoxes and logical contextuality are one and the same","Finite scenarios: logical contextuality iff Hardy-type paradox exists","Equivalence proven: Hardy paradox equals logical contextuality","KCBS: exactly one Hardy paradox type, 10.56% success"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The whole equivalence presumes that the scenario's partial Boolean algebra has at least one deterministic state, so that the classical embedding A^c=P(s_d(A)) is meaningful; the paper states the theorem for all general systems even though its own definition of a logical Hardy paradox quietly requires this embeddability.","fun_headline_variants_meta":{"raw":{"variants":["Logical contextuality equals Hardy paradox in all finite scenarios","Hardy paradoxes and logical contextuality are one and the same","Finite scenarios: logical contextuality iff Hardy-type paradox exists","Equivalence proven: Hardy paradox equals logical contextuality","KCBS: exactly one Hardy paradox type, 10.56% success"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000659,"raw_usage":{"total_tokens":2816,"prompt_tokens":673,"completion_tokens":2143,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":417,"completion_tokens_details":{"reasoning_tokens":2071}},"tokens_in":417,"tokens_out":2143,"duration_ms":12128,"temperature":1.0,"reasoning_tokens":2071,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T12:48:14.665077+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A counterexample would be a finite atom graph with at least one deterministic state and a Boolean vector b that satisfies Lemma 6 and has no solution M(A)x=b, yet for which no subset of events {e1,...,en} exists with one positive, the rest certain, and empty classical intersection. Since both conditions are finitely checkable, exhaustive search over all atom graphs on up to six vertices with a SAT solver would settle whether Theorem 3 is true as stated.","supporting_citations":[],"review_version":1}