{"id":"3dda110b-2ac4-47d1-b3e6-5b0387eb55cc","arxiv_id":"2607.21249","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"A single two-state receptor's information capacity follows from Berg–Purcell Fisher information; ideal timing gives log-log unbounded growth, while finite clock precision makes capacity finite via a clock-limited bound.","lead":"This paper derives formulas for how many concentration levels a single molecular receptor can tell apart, connecting classic Berg–Purcell precision limits to information capacity in bits. It shows that without a real cellular clock, the information capacity grows forever (though very slowly) as the concentration range grows, and that finite timing precision is what makes the capacity saturate.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Eq. (13) is labeled a 'receptor-level information bound,' but it rests on the asymptotic FI-capacity formula (4) and a delta-method variance inversion; neither provides a finite-N upper bound, so the bound status is not established.","rationale":"The reader's weakest_assumption identifies Eq. (4)'s asymptotic character as the key fragility. My stress-test agrees and sharpens the point: even granting Eq. (4), the FI substituted into it is a lower bound on the true Fisher information of the occupancy readout, so the resulting bit values are at best an approximation/underestimate rather than a Shannon-style upper bound. The paper's internal calculus (integrals, elliptic function evaluation, parameter dependencies) is consistent, and the qualitative message—ideal fixed-time sampling gives log-log divergence, finite timing precision yields saturation—is very likely correct because the high-concentration scaling of FI is not affected by the approximation's direction. However, the abstract and main text repeatedly say 'information bound' and 'receptor-level information bound in bits,' which is stronger than the derivation supports. This does not change the conditional verdict: the paper needs to either relabel Eq. (13) as an asymptotic approximation/lower estimate or add explicit finite-N verification that it bounds capacity. The proposed numerical capacity computation would settle the direction and magnitude of the discrepancy, turning the concern from a definitional caveat into a quantified, testable correction.","tokens_in":10000,"tokens_out":21947,"duration_ms":247838,"concrete_test":"Compute the exact capacity of the scalar channel Y=TB/Tv for the Fig. 2 parameters (Kd=1, k-=1, T=10, m=100, cmin=1e-2, cmax=1e2) by Monte Carlo or numerical solution of the two-state Markov chain plus Erlang clock to estimate P(Y|c) on a fine c-grid, then run Blahut-Arimoto over discretized Y bins for N=1. Compare the resulting capacity with Eq. (13). If the simulated capacity exceeds Eq. (13) at any input range, the formula is not an upper bound; if it falls below, the FI approximation is not a lower bound either. This directly tests whether Eq. (13) can legitimately be called an information bound.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central quantitative claim—Eq. (13) as a finite, clock-limited information bound—depends on two approximations whose combined effect is not a one-sided bound. First, Eq. (4)/S1.1 is the Clarke-Barron asymptotic capacity offset for the large-N limit, not the exact Shannon capacity for finite N. The paper's own figures plot N=1 and allow C*_A<0, which is incompatible with treating the formula as an upper bound on nonnegative mutual information. Second, even within the asymptotic formula, the FI used in Eq. (10)/(S31) is obtained by inverting a delta-method variance: I_eff = 1/Var(ĉ). For a Gaussian observation with c-dependent variance, the exact FI is (p')^2/σ^2 + (σ^2')^2/(2σ^4) ≥ (p')^2/σ^2, so I_eff ≤ I_true pointwise. Hence ∫√I_eff ≤ ∫√I_true, making Eq. (13) a lower estimate of the occupancy-channel capacity, not an upper bound. The paper's qualitative saturation (c^-2 → c^-4 at high occupancy when s>0) is robust and likely correct, but the 'bound' wording and the reported bit values are not supported by the derivation as written.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper derives a Fisher-information-based asymptotic capacity formula for a two-state receptor. In the ideal fixed-time occupancy model, it obtains a closed-form capacity expression showing slow (log-log) unbounded growth with concentration dynamic range. The paper then introduces a noisy internal clock that perturbs the normalization time, derives a modified Fisher information with an additional variance term, evaluates the capacity integral in closed form using incomplete elliptic integrals, and claims that finite timing precision yields a finite, clock-limited receptor-level information bound. The central conceptual claim is that diffusion-limited sampling alone does not produce a finite global information bound unless timing precision or some other physical resource is included.","tokens_in":10363,"tokens_out":11581,"duration_ms":130296,"significance":"If the asymptotic capacity interpretation is accepted, the paper provides useful, analytically transparent formulas that separate dynamic-range, averaging-time, and copy-number contributions, and it identifies a robust qualitative crossover from diffusion-limited (c^-2) to clock-limited (c^-4) scaling of the Fisher information at high occupancy. The supplementary derivations are internally consistent, the elliptic-integral evaluation is correct, and the log-log divergence of the ideal fixed-time capacity is a clean observation. However, the central 'bound' status of Eq. (13) is not established by the derivation as written, so the reported bit values and the upper-bound language overstate what has been proven.","major_comments":[{"comment":"Eq. (13) is presented as a 'receptor-level information bound in bits,' but it is computed from the Clarke–Barron asymptotic capacity offset of Eq. (4), which is an N→∞ offset, not an upper bound on the finite-N Shannon capacity. The figures plot C_A^*, not C_N^*, for N=1, and the authors themselves note that C_A^* can be negative. Thus Eq. (13) does not, by itself, bound the mutual information of a single receptor. The authors need either to prove a genuine finite-N upper bound or to explicitly recast the claims and figures as statements about the asymptotic offset rather than about bits available to a single receptor.","section":"Main text, Eq. (13); Supplement S1.1"},{"comment":"The Fisher information is obtained by inverting a delta-method variance, I_eff(c)=1/Var(ĉ). For a Gaussian observation with a concentration-dependent variance v(c), the exact Fisher information is (p')^2/v + (v')^2/(2v^2) ≥ (p')^2/v, so I_eff(c) ≤ I_true(c) pointwise. Consequently ∫√I_eff dc ≤ ∫√I_true dc, and Eq. (13) is a lower estimate of the occupancy-channel capacity, not an upper bound. The statement that 'clock-imprecise capacity is always below the ideal-timing bound' compares two effective-FI quantities and does not establish an upper bound on the exact capacity. The c^-4 saturation mechanism is likely robust, but the bit values and the word 'bound' are not supported by the derivation as written.","section":"Supplement S4.3, Eqs. (S30)–(S31); Main text Eq. (10)"},{"comment":"The asymptotic capacity formula (S4) is derived for M i.i.d. samples via the Bernstein–von Mises theorem, but here the observation is a single time-averaged occupancy trajectory, and the Fisher information in Eq. (7) is itself obtained from a long-time variance approximation. No error estimate is given for combining these two asymptotic approximations. At finite T, Eq. (13) therefore has unknown accuracy, even as an approximation of the asymptotic capacity. The authors should either supply a more direct justification for applying Eq. (S4) to this continuous-time single-trajectory setting or explicitly state the double-asymptotic nature of the result.","section":"Supplement S1.1 and S2; Main text Eqs. (7)–(8)"}],"minor_comments":[{"comment":"The elliptic-integral parameter μ=1−s^2 k_- T/8 can become negative when s^2 k_- T>8. Specify the parameter convention for F(φ|μ) used here, since many readers expect the incomplete elliptic integral with parameter in [0,1].","section":"Eq. (12)"},{"comment":"The axis labels and captions plot C_A^*, the asymptotic offset, for N=1. Consider relabeling the axes as 'asymptotic capacity offset' rather than 'capacity' to avoid any impression that negative values are actual negative mutual information, and to make the N=1 caveat more prominent.","section":"Figures 2 and 3"},{"comment":"The derivation linearizes the clock error in δT_v/T. For the Erlang clock with small m (e.g., m=10), the coefficient of variation s=1/√m is not very small. It would be helpful to state explicitly that the result is a small-noise approximation and possibly to test it against a numerical evaluation of the exact Erlang-clock mixture.","section":"Supplement S4.2"}],"recommendation":"major_revision","confidential_remarks":"The qualitative message—that the ideal fixed-time model has no finite global information bound without an additional constraint, and that finite timing precision introduces a c^-4 saturation—is plausible and likely correct. The revision should focus on aligning the claims with what is actually proven: the current Eq. (13) is a lower estimate based on an approximate Fisher information and an asymptotic capacity formula, not a rigorous upper bound on finite-N mutual information. I would also encourage the author to reduce the reliance on two self-citations as the sole basis for the central capacity formula and to make the derivation of Eq. (4) more self-contained."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. First, the paper is worth reading: it gives a clean, closed-form translation from Berg-Purcell local precision to a global information measure, and the qualitative punchline is real — with perfect timing, capacity grows only log-log in dynamic range; with finite timing precision, the high-concentration Fisher information changes from c^-2 to c^-4 and capacity saturates. The half-bit per doubling for time and copy number is a nice rule of thumb.\n\nWhat's new: the explicit capacity formulas (Eqs. 8 and 13), the elliptic-integral evaluation, and the identification of the clock-limited crossover. The derivation is internally consistent; the integrals check out. The author is careful to state that Eq. (4) is an asymptotic offset that can go negative, and the clock model is explicitly one possible regularization, not a universal one. That is honest.\n\nThe soft spot is exactly what the stress-test flags. Eq. (13) is labeled a 'receptor-level information bound,' but it is not an upper bound in either of the two ways needed. First, Eq. (4) is the Clarke-Barron asymptotic capacity offset, valid in the large-N limit; for N=1 it is not a bound on mutual information, as the paper's own figures show with negative values. Second, the Fisher information is obtained by inverting a delta-method variance: I_eff = 1/Var(ĉ). For a Gaussian output with c-dependent variance, the true FI is (p')^2/σ^2 + (σ^2')^2/(2σ^4), so I_eff is a lower bound on the true FI pointwise. That means ∫√I_eff ≤ ∫√I_true, so Eq. (13) is a lower estimate of the capacity, not an upper limit. The qualitative saturation is robust, but the bit values and the word 'bound' are not supported as written.\n\nThe fix is straightforward: call Eq. (13) an asymptotic approximation or a lower estimate, state explicitly that it is not a finite-N upper bound, and optionally show that the missing term does not change the qualitative behavior. The paper's own caveats in S1.3 about negative values show the author knows the formula is an offset, but the main text doesn't carry that caveat through.\n\nWho's it for: anyone working on biochemical sensing limits or information-theoretic treatments of signaling. It deserves a serious referee; the central question is interesting and the derivation is careful. I'd send it to review with a request to fix the bound language and put validity conditions on Eq. (4). I'd also flag the variance-inversion direction in the report.","headline":"Clean closed-form link between Berg-Purcell precision and information capacity, with a real clock-limited saturation result, but the 'bound' wording outruns the math: the central formula is an asymptotic offset and an underestimate, not an upper bound.","tokens_in":10787,"tokens_out":5191,"would_cite":true,"duration_ms":53065,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper's central claim is that a single receptor's information capacity is unbounded under ideal timing, but becomes finite once the timing precision of its averaging clock is taken into account.","keywords":["information capacity","two-state receptor","chemical sensing","stochastic clock","dynamic range","timing precision","occupancy averaging","mutual information"],"falsifier":"Simulate the two-state receptor with a stochastic Erlang clock, compute the exact mutual information between concentration and the occupancy readout for a single receptor over a bounded range, and check whether the large-sample extrapolation matches Eq. (13); if capacity still grows substantially with cmax, or if the plateau height does not follow the 1/sqrt(m) timing-precision scaling, the clock-limited bound is falsified.","tokens_in":9878,"feed_emoji":"⏱️","tokens_out":7344,"duration_ms":79271,"temperature":0.7,"pith_summary":"The paper asks how many bits, not just how accurately, a single molecular receptor can report a chemical concentration. It derives a compact formula that splits the receptor's information capacity into a dynamic-range term, an averaging-time term, and a copy-number term. In the idealized case where the integration window is known exactly, the formula shows capacity grows without bound as the allowed concentration range widens, but only roughly as the log of the log of range, so additional bits are extremely expensive. Once the receptor's internal clock has finite timing precision, high-concentration discrimination degrades faster and the total capacity saturates at a finite number of bits. This matters because experiments increasingly measure signaling in bits, and it explains why low single-bit capacities do not require a failure of receptor-level physics.","feed_headline":"Uncertain timing sets a finite information cap on molecular sensors","feed_subtitle":"A receptor's capacity grows only log-logarithmically with range under ideal timing, and saturates once the averaging clock is noisy.","key_machinery":"The carrying object is the asymptotic capacity formula C*_A = log2( (1/sqrt(2πe)) ∫_{cmin}^{cmax} sqrt(I(c)) dc ), which converts a local measure of how sharply the readout distinguishes nearby concentrations (I(c)) into a global, distribution-free capacity in bits. Applied to time-averaged receptor occupancy, it yields Eq. (8) for ideal timing, separating range, time, and copy-number contributions. To make the ideal model physical, the paper introduces a noisy clock: the downstream circuit normalizes the accumulated bound time by an imperfect estimate with mean T and variance σ_T^2. This adds a variance term that changes I(c) at high occupancy and makes the integral evaluable as an incomple","core_discovery":"The central claim is that local concentration-precision limits do not, by themselves, set a finite global information budget for a receptor. Under ideal fixed-time averaging, the information capacity grows without bound with the upper end of the input range, scaling as log2(ln(c_max/K_d)). The paper then treats the duration used to normalize the occupancy readout as a stochastic clock with known mean and variance. Clock noise changes the high-concentration scaling of the discrimination precision from c^-2 to c^-4, which makes the capacity integral converge. The resulting closed-form bound, expressed through incomplete elliptic integrals, is finite even for an unbounded concentration range an","pith_inferences":["I would extend the logic beyond biochemistry: any physical sensor that counts stochastic events and normalizes by a measured duration should exhibit the same crossover, so Eq. (13) may serve as a generic bound for counting sensors with noisy clocks.","A consequence the author leaves implicit: comparing 'information capacities' of different receptors is only meaningful when dynamic range and timing precision are specified, because otherwise the ideal-model capacity is unbounded.","Testable extension: if the clock is an m-step Erlang timer, the timing-precision coefficient equals 1/sqrt(m); one could engineer timers with different m in synthetic circuits and check that the capacity plateau shifts as predicted.","The model assumes clock noise is independent of binding state; coupling between the two, such as a timer driven by shared biochemical resources, could create correlations that either raise or lower the bound."],"forward_implications":["Doubling the averaging time or the receptor copy number adds only half a bit; a full additional bit requires a fourfold increase.","Widening the dynamic range gives only log-logarithmic gains in the ideal model, so an unbounded range never yields a practical route to many bits.","With finite clock precision, the capacity plateaus in both averaging time and dynamic range, so the limiting resource becomes timing precision rather than diffusive sampling.","The predicted low single-bit capacities are consistent with the range seen in biological signaling measurements, suggesting receptors can operate near their physical limit while downstream information remains low."],"fun_headline_variants":["Clock noise imposes finite information capacity on receptors","Molecular sensor information saturates with noisy timing","Timing jitter sets a finite bit limit for sensing","Receptor information capacity becomes finite with clock noise","Averaging clock noise bounds molecular sensor information"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The whole calculation rests on a standard large-sample formula that converts local discrimination precision into information capacity; if that approximation is not accurate for a single receptor observed over a finite window, the quoted bit values are asymptotic offsets rather than true information bounds.","fun_headline_variants_meta":{"raw":{"variants":["Clock noise imposes finite information capacity on receptors","Molecular sensor information saturates with noisy timing","Timing jitter sets a finite bit limit for sensing","Receptor information capacity becomes finite with clock noise","Averaging clock noise bounds molecular sensor information"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000256,"raw_usage":{"total_tokens":1394,"prompt_tokens":711,"completion_tokens":683,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":455,"completion_tokens_details":{"reasoning_tokens":611}},"tokens_in":455,"tokens_out":683,"duration_ms":7497,"temperature":1.0,"reasoning_tokens":611,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T08:02:21.104425+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate the two-state receptor with a stochastic Erlang clock, compute the exact mutual information between concentration and the occupancy readout for a single receptor over a bounded range, and check whether the large-sample extrapolation matches Eq. (13); if capacity still grows substantially with cmax, or if the plateau height does not follow the 1/sqrt(m) timing-precision scaling, the clock-limited bound is falsified.","supporting_citations":[],"review_version":1}