{"id":"fa6870b2-f0b2-4a26-9e10-ea6b3328623b","arxiv_id":"2506.19276","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For the asymmetric binary perceptron, the worst-case local entropy breaks down for constraint density alpha in (0.77, 0.78), matching replica predictions and the range where fast algorithms stop working.","lead":"This paper computes the local entropy of rare dense solution clusters in the asymmetric binary perceptron using a large-deviation version of random duality theory. The result reproduces the known replica-method prediction that local entropy breaks down for alpha in (0.77, 0.78), linking it to the model's computational gap.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1 is imported from companion [97] and Theorem 2 is derived entirely from it; no proof or stated hypotheses are given, so the claimed (0.77,0.78) LE breakdown is only as secure as that unpublished result.","rationale":"The reader's weakest assumption identifies exactly the structural weakness that is most load-bearing: the paper's entire numerical evaluation, and hence the claimed LE breakdown in (0.77,0.78), depends on Theorem 1 quoted from the unpublished companion paper [97]. The manuscript explicitly gives no proof, only a pointer to Corollary 1 in [97], and Theorem 2 is then derived immediately from Theorem 1. In addition, the passage from the local-entropy partition function to Theorem 1's setting involves several limits and a z-dependent function whose regularity is not verified, so even reading charitably, the applicability of the imported theorem is not established within this text. The numerical evidence is also thin, consisting of two alpha values, so the precise location of the claimed interval is inferred rather than computed. These concerns do not amount to a refutation: the result matches known replica predictions, and the second-level lifting may well be sufficient, as the author states. But because the central claim inherits its validity from an externally cited and unverifiable theorem, conditional acceptance is the right posture, with the requested proof or precise reference and a finer scan as conditions. This does not change the reader's verdict, hence UNCHANGED.","tokens_in":22517,"tokens_out":7025,"duration_ms":77207,"concrete_test":"Obtain Corollary 1 from companion paper [97] and state its exact hypotheses, then check them in the precise setting of this paper: X = Bn, Y = S^m, fbar_x as in Eq. (11) with the beta_z-dependent z, and the limit beta, beta_z, p -> infinity, s = -1, c_k -> c_k/p. Verify explicitly that the stationarity conditions (16) and the strong duality (17) hold for this family; if any hypothesis fails, for example if the auxiliary variable z is unbounded or the limits do not commute, then Eq. (35) is not established.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 1 is the sole bridge from the reweighted partition function to the numerically evaluated free energy. Its proof in the manuscript is only \"Follows immediately from Corollary 1 in [97]\", and Theorem 2's proof is \"Follows immediately from the previous discussion and Theorem 1\". The theorem's statement says \"Assume the complete sfl LD RDT frame from [97]\" but does not reproduce that frame, so the hypotheses are not checkable in this paper. Crucially, the local-entropy definition sends beta, beta_z, and p to infinity and then sets s=-1 with c_k -> c_k/p; nothing in Section 3 verifies that these limits are within the domain where Theorem 1's stationarity conditions (16) hold. The function fbar_x(x)=beta_z(1^T h(z-kappa)-m)-y^T z+nu xbar^T x-nu deltabar contains an unconstrained-looking z and a y-dependent term, so compactness and regularity assumptions of [97] are nontrivial. If Theorem 1 fails or does not apply, Eq. (35) is not the local entropy and the central interval claim collapses. The numerical evidence is only two alpha values (Figures 1 and 2, Table 1), with positive S_l at alpha=0.77 and breakdown at alpha=0.78 via nu -> 0; the interval (0.77,0.78) itself is inferred, not scanned. Section 4.2 and the Conclusion also concede that sufficiency of r=2 is an expectation, not a proof.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the local entropy (LE) of solution clusters of the asymmetric binary perceptron (ABP) as a candidate explanation for the presumed computational gap between the capacity α_c ≈ 0.833 and the empirically solvable range α ≈ 0.75–0.77. The worst-case LE is defined in Eq. (4) as the p→∞-selected maximum, over reference configurations x̄, of the log-partition of solutions at overlap δ̄. Through Laplace-type approximations (Eqs. (5)–(11)) the LE is recast as a ground-state free energy, then evaluated using the author's stationarized fully lifted large-deviation random duality theory (sfl LD RDT): Theorem 1, imported from the companion paper [97], gives a strong duality between a random primal and a fluctuation dual, and Theorem 2 specializes it to the ABP LE in the closed form (35). Solving the r=2 stationarity equations (45)–(55) numerically at α=0.77 and α=0.78 (Figures 1–2, Table 1), the paper reports no LE breakdown at α=0.77 and a breakdown at α=0.78 for overlaps δ̄ ≥ δ̄_{c,1} ≈ 0.993; from this the abstract concludes that LE breaks down in the interval (0.77,0.78), matching the replica predictions of [14] and the algorithmic limit α ≈ 0.75–0.77.","tokens_in":22935,"tokens_out":26025,"duration_ms":232362,"significance":"If the derivation can be made self-contained and rigorous, this would be a valuable methodological contribution: it computes local-entropy-type atypical features via large-deviation random duality rather than replica methods, writes out the r=2 stationarity equations in enough detail to be reproducible (Eqs. (45)–(55)), makes a falsifiable quantitative prediction (breakdown interval and δ̄_{c,1} ≈ 0.993 at α=0.78), and states a generic framework with plausible extensions. The agreement with the replica results [14] and the empirical solver limit is a sensible sanity check. As it stands, the significance is limited: correctness rests on Theorem 1 of the unpublished companion [97] whose hypotheses are not stated; the paper concedes that in a parameter limit its curves are analytically identical to the replica curves of [14], so the quantitative prediction is not new and the identity regime is unspecified; and the numerics cover only two α values without error control. The contribution is better framed as transferring the sfl LD RDT machinery to LE computations, with the ABP breakdown as the worked example, than as a new prediction.","major_comments":[{"comment":"The central result, Theorem 1, is imported from the companion manuscript [97], with the proof given in the text as \"Follows immediately from Corollary 1 in [97]\", and the hypotheses are stated only as \"Assume the complete sfl LD RDT frame from [97]\". Since Theorem 2 and all numerical conclusions derive exclusively from this theorem, the frame and its domain of validity must be reproduced (at least in an appendix), and the specific choices made here — the function f̄_x(x)=β_z(1^T h(z−κ)−m)−y^T z+νx̄^T x−νδ̄ with unconstrained z, the limits β,β_z,p→∞, s=−1, c_k→c_k/p, and the additional optimization over ν and γ_sq introduced in Eqs. (10)–(11) and (26)–(31) — must be shown to fall within that domain. As written, the hypotheses are not checkable, and the passage from the abstract dual functional (13)–(14) to the concrete dual (18)–(31) changes the problem structure (z is maximized inside D^{(sph)}, Eq. (20)) without an explicit verification. The stationarity conditions (16) are also only necessary conditions; no argument is given that the computed saddle point is global.","section":"§4, Theorem 1 (Eqs. (15)–(17)) and §4.1 (Eqs. (18)–(31))"},{"comment":"The local entropy in Eq. (4) involves a simultaneous limit n,β,β_z,p→∞, and Eq. (9) asserts that the ground-state free energy f_sq(∞) equals S_l(δ̄). The order of these limits is never specified, and the interchange of the quenched average, the p→∞ selection, and the β,β_z→∞ limits is not justified; different orders are not a priori equivalent for this reweighted partition function. Similarly, the replacement of max_y and max_z by sums raised to the power −1 in Eq. (5) is a Laplace-type identity that requires z to range over a set of subexponential size or a separate large-deviation argument; for continuous z∈R^m (and the undefined \"sum over z\" in Eq. (7)) this replacement is not immediate. Because the ground-state limit is the step that turns the free energy into the entropy on which the breakdown claim rests, these interchanges need a rigorous justification or at least a precise statement of the intended order of limits.","section":"§3.1, Eqs. (4)–(11), especially Eq. (9)"},{"comment":"The linear term in ν appears as +νδ̄ in Eq. (31) and as δ̄ in the ν-stationarity condition (55), but in the r=2 evaluation, Eq. (43), this term is written as +ν with no factor δ̄. Table 1 reports computations at δ̄=0.99 with ν̂=0.2258 (α=0.77) and ν̂=0.0983 (α=0.78), so the discrepancy is of order 0.001–0.002, which is the same order as the reported entropies S_l=0.0049 and S_l=0.0015. Either the displayed formula is missing the factor δ̄ and the numerical values must be recomputed, or the values were obtained at δ̄=1 and Table 1 is mislabeled. The manuscript must be corrected and the figures re-checked, since the reported S_l values are too small for this discrepancy to be negligible.","section":"§4.2, Eq. (43) vs. Eqs. (31) and (55)"},{"comment":"The headline interval (0.77,0.78) is inferred from exactly two values of α: absence of breakdown at α=0.77 and presence of breakdown at α=0.78. No error bars, sensitivity analysis with respect to the numerical integrations over U_2 and U_3, or tolerances in the stationarity solver are reported, and the critical overlap δ̄_{c,1} ≈ 0.993 is read off a figure. Moreover, the curve S_max shown in Figure 1 as an upper bound is not defined anywhere in the text. Given that the central claim is a sharp interval statement, the paper should present a scan over α (or at least more bracketing values with error control) and a working definition of S_max.","section":"§4.2, Figures 1–2 and Table 1"},{"comment":"The sufficiency of the second level of lifting, r=2, is an assumption: Section 4.2 states that higher levels are \"likely to experience tiny refinements\" and that \"we do not expect major qualitative changes\", without proof or numerical check at r=1 or r=3. Since the breakdown interval (0.77,0.78) is the paper's main quantitative output, and the paper itself notes that the key LE features only \"appear\" at r=2, the stability of the breakdown interval and of δ̄_{c,1} with respect to the lifting level r is a load-bearing, currently unsupported assertion.","section":"§4.2 and §5 (Conclusion)"},{"comment":"Near the end of Section 4.2 the paper states that when δq and δq̂ of [14]'s (B37)–(B49) are close to zero, the present curves \"are not only visually similar but also analytically completely identical\" to the replica results of [14]. This claim of exact coincidence with existing results is not accompanied by a derivation or by a specification of the parameter regime in which it holds; in particular, the stationary parameters of Table 1 (e.g., q̂_1^{(s)}−q̂_2^{(s)} ≈ 0.58 at α=0.77) do not obviously correspond to a δq→0 regime under the natural scaling. The authors should state precisely which parameters of the r=2 solution vanish in the identity regime, verify whether the solutions used for Figures 1–2 lie in that regime, and clarify what the new derivation adds to the known [14] prediction of the same breakdown interval.","section":"§4.2 (analytical-identity claim)"}],"minor_comments":[{"comment":"The derivative displayed in Eq. (52) is taken with respect to q_2^{(s)} (see Eq. (51)) but is labeled dψ̄_rd/dq_1^{(s)}; the second q-stationarity condition should be labeled dψ̄_rd/dq_2^{(s)} = 0.","section":"§4.2, Eq. (52)"},{"comment":"In Eq. (49), the sign-function argument is written with h_1^{(2)} appearing twice, whereas Eq. (48) and Eq. (51) use √(q_1−q_2)h_1^{(2)} + √q_2 h_1^{(3)}; the sign argument in Eq. (49) should match Eq. (48).","section":"§4.2, Eq. (49)"},{"comment":"Equation (33) contains \"nu\" in place of the symbol ν in dψ̄_rd(p,q,c,nu,γ_sq,−1)/dc, and Eq. (36) uses the ambiguous notation \"1/2β2\" where the intended factor appears to be (1/2)β²; the notation should be cleaned up throughout.","section":"Theorem 2, Eq. (33), and Eq. (36)"},{"comment":"References [96] and [97] are cited without arXiv identifiers (\"available online at arxiv\"); since Theorem 1 depends on [97], the reference should be locatable, and the arXiv header of the manuscript contains a typo (\"percept rons\").","section":"References [96], [97]; title"},{"comment":"The notation \"‖x‖_2 = x\" reuses x for a scalar norm value, and the stated domain R^{3n+m} of f̄_x does not match the natural domain R^{n+2m} of its arguments (x,z,y); these should be cleaned up.","section":"§4, Eqs. (13)–(15)"},{"comment":"The evaluation of D^{(sph)}(s) in Eq. (24) is stated without derivation; since the defining expression (20) contains the term β_z(1−h(z_i−κ)), the authors should show how the β_z→∞ limit (or an equivalent argument) produces the projection expression in Eq. (24).","section":"§4.1, Eqs. (20), (24)–(25)"},{"comment":"The sentence reporting that all calculations were repeated \"relying on modulo-m concepts from [96] and [97]\" is unexplained; \"modulo-m\" should be defined or the sentence should be removed, and the analytical-identity claim should state precisely which parameters are sent to zero (see Major Comment 6).","section":"§4.2, concluding paragraphs"}],"recommendation":"major_revision","confidential_remarks":"The manuscript relies very heavily on the author's own unpublished preprints ([80]–[97]), with the central Theorem 1 imported from [97], and references [96]–[97] are given without arXiv identifiers, making independent verification difficult. I would recommend asking the authors to make [97]'s frame and hypotheses available to the referees in detail, or to include a statement of them in the paper. The authors' own acknowledgment of analytical identity with the replica results of [14] in the relevant parameter regime suggests that the quantitative contribution is a re-derivation; the novelty disclosure should be made explicit. The style of the manuscript (heuristic Laplace-type steps, unspecified order of limits, no error control on numerics) is closer to a physics preprint than to a rigorous stat.ML paper; the editor may wish to weigh whether this matches the journal's standards, or to use the revision to require a substantial rigor upgrade."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. The advertised result — local entropy breakdown for the zero-threshold ABP in α ∈ (0.77, 0.78) — is already in Baldassi et al. [14], and the paper says so; in fact, it states that its curves become analytically identical to [14] in a certain limit. What is actually new here is methodological: a large-deviation version of the author's fully lifted random duality theory is applied to local entropy, producing the free-energy functional in Eq. (35) and a numerical evaluation at the second lifting level.\n\nThe paper is honest about its own limitations. It flags that the key Theorem 1 is imported from a companion paper, that the numerical scan is thin (only α = 0.77 and 0.78), and that the sufficiency of r = 2 is an expectation rather than a proof. The derivation is detailed and largely checkable, though there are typos in the stationarity equations (e.g., Eq. (52) writes dq_1 where dq_2 is meant). Reproducing the replica prediction at the second level is a decent sanity check, but it tells you the machinery can match a known answer, not that it has produced a new one.\n\nThe soft spots are real but not disqualifying. Theorem 1 is the load-bearing wall: if its hypotheses do not cover the limiting procedure used here — β, β_z, p → ∞, s = −1, c_k → c_k/p — then the whole evaluation collapses. The paper does not verify that, and a referee should push hard on it. The numerical evidence for the interval (0.77, 0.78) is essentially two points, so the interval is inferred, not scanned; error bars and sensitivity analysis are absent. The author's explicit admission that his curves are analytically identical to [14] in a limit also tempers the claim of an independent derivation, though a different route to the same prediction still has value.\n\nWho is this for? People working on random duality theory and on the solution geometry of perceptrons. It will not change anyone's view of the ABP computational gap, but it demonstrates that the sfl LD RDT framework can be pushed to atypical features like local entropy, and that is worth a serious look. The paper should go to peer review: the referee needs to check the applicability of Theorem 1 and push for a more thorough numerical study. If those issues are addressed, this would be a solid methods paper.","headline":"The numerical result is a known replica prediction, but the paper is a serious methodological exercise applying the author's large-deviation duality machinery to local entropy; its main vulnerability is that the load-bearing theorem is imported from an unpublished companion.","tokens_in":23353,"tokens_out":2802,"would_cite":true,"duration_ms":29974,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60K35","82B44","90C27"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that for the zero-threshold asymmetric binary perceptron, the worst-case local entropy of rare dense solution clusters breaks down for constraint densities $\\alpha$ in $(0.77,0.78)$, matching the density at which the best…","keywords":["asymmetric binary perceptron","local entropy","random duality theory","large deviations","computational gap","solution clustering","zero-threshold perceptron","replica methods"],"falsifier":"Compute the same worst-case local entropy for $\\kappa=0$, $\\alpha=0.78$, and an overlap $\\bar{\\delta}=0.995$ at the third level of lifting ($r=3$) or by an independent large-deviation or replica method; if a positive entropy or a nonzero $\\nu$ solution appears, the claimed breakdown in $(0.77,0.78)$ is an artifact of the $r=2$ truncation. Alternatively, run a state-of-the-art ABP solver at $\\alpha=0.78$ and exhibit solutions lying in a dense cluster; that would contradict the predicted structural obstruction.","tokens_in":22264,"feed_emoji":"🧠","tokens_out":6193,"duration_ms":62334,"temperature":0.7,"pith_summary":"The paper tries to show that the algorithmic hardness of the asymmetric binary perceptron can be read off from the local entropy of its rare dense solution clusters. Using a large-deviation extension of fully lifted random duality theory, it derives an explicit free-energy expression for the worst-case local entropy of the zero-threshold ABP. Evaluating this expression on the second level of lifting, it finds that for constraint density $\\alpha$ between $0.77$ and $0.78$ the local entropy breaks down: at overlaps $\\bar{\\delta}\\gtrsim 0.993$, no exponentially many solutions exist at the prescribed Hamming distance from any reference configuration. Because this interval coincides with both replica-method predictions and the density at which current efficient solvers stop working, the paper concludes that local entropy behavior may be a key reflection of the ABP's presumed computational gap.","feed_headline":"Local entropy breaks down exactly where perceptron solvers stall","feed_subtitle":"For zero-threshold binary perceptrons, rare dense solution clusters disappear in the (0.77,0.78) constraint-density window.","key_machinery":"The carrying object is the strong fully lifted large-deviation random duality theorem (Theorem 1, quoted from the companion paper [97]), which equates the random primal free energy of the local-entropy partition function with an optimized fully lifted random dual functional. At the second level of lifting ($r=2$), all terms in the dual reduce to explicit Gaussian expectations: a binary part involving a hyperbolic-cosine factor and a spherical part involving an erfc factor, with the overlap $\\bar{\\delta}$ enforced through a Lagrange multiplier $\\nu$. Theorem 2 then expresses the ground-state local entropy as $f_{sq}(\\infty)=-\\bar{\\psi}_{rd}(\\hat{p},\\hat{q},\\hat{c},\\hat{\\nu},\\hat{\\gamma}_{sq},-1)$, and local-entropy breakdown appears exactly when the stationarity conditions have no solution with $\\nu\\neq 0$.","core_discovery":"For the zero-threshold ABP with capacity $\\alpha_c\\approx 0.833$, the worst-case local entropy $S_l(\\bar{\\delta})$ is positive at $\\alpha=0.77$ for all overlaps, but at $\\alpha=0.78$ it breaks down: for overlaps $\\bar{\\delta}\\in(\\bar{\\delta}_{c,1},\\bar{\\delta}_{c,2})$ with $\\bar{\\delta}_{c,1}\\approx 0.993$, the stationarity equations admit no nonzero overlap-enforcing multiplier $\\nu$, so there is no exponentially large cluster of solutions at distance $d=(1-\\bar{\\delta})/2$ from any reference point. This breakdown interval $(0.77,0.78)$ matches the replica predictions of earlier work and the observed algorithmic frontier $\\alpha\\sim 0.75-0.77$, indicating that the disappearance of rare dense clusters may be a structural signature of the computational gap rather than an incidental feature.","pith_inferences":["If local-entropy breakdown is the true algorithmic barrier, the same machinery should predict a critical density for every threshold $\\kappa$, not just $\\kappa=0$; mapping the LE-breakdown curve across the ABP phase diagram would be a direct test of this extension.","The breakdown interval likely corresponds to an overlap gap in the Hamming-distance distribution of solution pairs, so rigorously connecting local entropy with the overlap gap property could unify two currently separate hardness narratives for the ABP.","At higher lifting levels the numerical breakpoint may shift slightly within the $(0.77,0.78)$ window; if it converges to a single value, one could conjecture that this value equals the algorithmic threshold $\\alpha_{\\mathrm{alg}}$, a claim the paper does not yet make.","Finite-size simulations of solvers that exploit dense clusters should show failure exactly where the predicted entropy breakdown occurs; determining whether algorithmic failure precedes or follows the entropy breakdown in such simulations would clarify whether LE is a cause or a symptom of the computational gap."],"forward_implications":["If the central claim is correct, at $\\alpha=0.78$ there is an interval of overlaps $\\bar{\\delta}\\in(0.993,\\approx 1)$ for which the worst-case local entropy is negative or vanishing, so no exponentially large cluster surrounds any reference solution at the corresponding Hamming distance.","The breakdown interval $(0.77,0.78)$ reproduces the replica prediction and sits at the edge of the observed algorithmic frontier $\\alpha\\approx 0.75-0.77$, making local entropy a candidate structural cause of the ABP computational gap.","The framework is generic: the same lifted-duality evaluation supplies local entropy for other random feasibility problems such as symmetric binary perceptrons, positive and negative spherical perceptrons, compressed sensing $\\ell_1$ thresholds, and discrepancy minimization.","Across the window from $\\alpha=0.77$ to $\\alpha=0.78$, the solution-space geometry changes sharply: rare dense clusters persist below the window and defragment above it, giving a concrete phase transition in clustering structure.","The positive local entropy at $\\alpha=0.77$ means efficient algorithms that search for dense connected regions still have exponentially many nearby solutions to find, whereas at $\\alpha=0.78$ that resource disappears."],"supporting_citations":[{"why":"Supplies Theorem 1, the strong fully lifted large-deviation random duality theorem on which the entire numerical evaluation rests; it is quoted and not proved in this paper.","marker":"[97]"},{"why":"Introduces the large-deviation fully lifted random duality machinery that Theorem 1 extends, and provides the modulo-m stationarity concepts the paper also uses.","marker":"[96]"},{"why":"Gives the ABP capacity via fully lifted random duality theory and the random primal/dual free-energy setup that this paper adapts to the local-entropy setting.","marker":"[91]"},{"why":"Provides the replica-method prediction that worst-case local entropy breaks down in the (0.77,0.78) window; the numerical results here are matched against it.","marker":"[14]"},{"why":"Proposes subdominant dense clusters and local entropy as the source of high computational performance in discrete neural networks, supplying the conceptual object studied here.","marker":"[13]"},{"why":"Proves the existence of rare well-connected clusters for the symmetric binary perceptron and, modulo technical assumptions, for the ABP; the entropy of such clusters is what this paper computes.","marker":"[2]"}],"fun_headline_variants":["Rare dense clusters vanish where perceptron solvers stall","Local entropy collapse signals perceptron computational gap","Solvers hit a wall as perceptron clusters thin out","Perceptron solver bottleneck traced to cluster breakdown","Dense cluster loss marks perceptron algorithmic limit"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire numerical conclusion rests on Theorem 1, the strong fully lifted large-deviation random duality bound quoted from the companion paper [97], which is used without proof; if that theorem fails or does not cover this local-entropy setting, the claimed breakdown interval is unsupported.","fun_headline_variants_meta":{"raw":{"variants":["Rare dense clusters vanish where perceptron solvers stall","Local entropy collapse signals perceptron computational gap","Solvers hit a wall as perceptron clusters thin out","Perceptron solver bottleneck traced to cluster breakdown","Dense cluster loss marks perceptron algorithmic limit"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000587,"raw_usage":{"total_tokens":2819,"prompt_tokens":1070,"completion_tokens":1749,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":686,"completion_tokens_details":{"reasoning_tokens":1675}},"tokens_in":686,"tokens_out":1749,"duration_ms":13519,"temperature":1.0,"reasoning_tokens":1675,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T18:33:12.439475+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the same worst-case local entropy for $\\kappa=0$, $\\alpha=0.78$, and an overlap $\\bar{\\delta}=0.995$ at the third level of lifting ($r=3$) or by an independent large-deviation or replica method; if a positive entropy or a nonzero $\\nu$ solution appears, the claimed breakdown in $(0.77,0.78)$ is an artifact of the $r=2$ truncation. Alternatively, run a state-of-the-art ABP solver at $\\alpha=0.78$ and exhibit solutions lying in a dense cluster; that would contradict the predicted structural obstruction.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Theorem 1, the strong fully lifted large-deviation random duality theorem on which the entire numerical evaluation rests; it is quoted and not proved in this paper."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the large-deviation fully lifted random duality machinery that Theorem 1 extends, and provides the modulo-m stationarity concepts the paper also uses."}],"review_version":1}