{"id":"d1fbafa6-b607-4098-b0d7-ccf25d004ec8","arxiv_id":"2505.00252","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"A hidden p-bit with tunable fluctuation rate mediates a continuously tunable and directional effective coupling between two computational p-bits, as shown by numerical and analytic models.","lead":"Probabilistic computers use random bits to solve hard math problems, but reprogramming the connections between bits usually needs extra hardware. This paper shows that inserting a third, faster random bit between two computing bits lets the connection strength be tuned by adjusting that bit's fluctuation speed, and the tuning works in one direction only.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Fast-regime model validity is the load-bearing premise: Eq. (1) is derived from Eqs. (2)-(5) in the unvalidated τ_h^r < τ_s regime, which the paper itself notes lies outside prior validated update rules.","rationale":"The paper is internally coherent: no fitted parameters are involved, the analytical derivation is plausible, and numerical simulations of the model match the analytics. Within the model, Eq. (1) is a reasonable summary. The difficulty is external validity. The reader's weakest assumption identifies exactly this issue. A secondary issue is that the Gaussian approximation in Appendix A is uncontrolled near τ_h^r/τ_s ≈ 1 and the plotted numerical curves have no error bars, but these are refinements; the more fundamental problem is that the regime of interest lies outside the previously validated domain of the behavioral model. Because the central claim is explicitly framed as a route to hardware programmability, the absent fast-regime validation justifies a conditional verdict. The lack of released code compounds reproducibility concerns but is not the scientific crux.","tokens_in":14313,"tokens_out":12092,"duration_ms":122017,"concrete_test":"Run the s-MTJ device-level simulator from Ref. [13] (or a fast-p-bit FPGA testbed with tunable clock) on the three-p-bit motif with J1β=0.1, J2β=50, τ1r=τ2r=100τs, for τ_h^r/τ_s ∈ {0.01, 0.1, 0.5, 1, 10}; compute ⟨m1m2⟩ with statistical error bars and compare to Eq. (8)/Eq. (1). If the τ_h^r/τ_s < 1 points deviate beyond the error bars, the fast-regime model—and with it the central tunability claim—is not supported for hardware.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central quantitative claim, Eq. (1), is obtained from the behavioral model Eqs. (2)-(5). In the fast-hidden-p-bit branch, Appendix A linearizes the hidden p-bit, treats its RC-filtered output as Gaussian, and drops η2; the result is then mapped to J21. The load-bearing premise is that Eqs. (2)-(5) remain faithful when τ_h^r < τ_s. The paper itself flags two reasons to doubt this: Section III states that the prior validated fast-synapse update rules are invalid in this regime, and that Eq. (2) assumes instantaneous p-bit response, ignoring analog-to-binary and activation timescales. No device-level or experimental validation is provided; the numerical support in Fig. 3 compares the model only to its own analytical approximation. If the physical p-bit's output-response time is not negligible relative to τ_h^r, the filtered-input picture underlying Eq. (8)—and therefore the tunable J21 in Eq. (1)—does not transfer to hardware.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a mechanism for programmable synaptic coupling in probabilistic computers: insert a \"hidden\" p-bit between two computational p-bits and tune the hidden p-bit's fluctuation time tau_h^r relative to the synapse time tau_s. Using a behavioral model of p-bit dynamics (Eqs. (2)-(5)) with random telegraph noise and RC-type synapses, the authors simulate the three-p-bit motif and derive analytical expressions for the time-averaged correlator <m1 m2>. In the limit J1*beta << 1 and J1*J2*beta^2 >= 1, they obtain Eq. (1), which gives a tunable effective coupling J21 that increases as tau_h^r/tau_s decreases, while J12 remains fixed at J1. They map the motif onto an effective two-p-bit model with coupling Jeff and verify the mapping numerically in Fig. 3(c). The central claim is that coupling strength and direction can be programmed by modulating fluctuation rates alone.","tokens_in":14491,"tokens_out":7697,"duration_ms":77387,"significance":"If the behavioral model remains valid in the fast-p-bit regime, this is a conceptually simple and potentially hardware-friendly way to implement programmable, directional synapses in p-computers without adding external tuning circuitry. The analytic results are parameter-free within the stated model, and the numerical simulations are internally consistent with that model, which is a genuine strength of the paper. The main limitation is that the central quantitative prediction, Eq. (1), relies on extending the behavioral model into the tau_h^r < tau_s regime, a regime the paper itself notes lies outside previously validated update rules, and no device-level or experimental validation is provided. The effective-model comparison in Fig. 3(c) is also partly a mapping by construction. The work is best read as a model-based proposal that could stimulate hardware experiments, but the load-bearing fast-regime assumption needs to be addressed before the quantitative claims can be fully accepted.","major_comments":[{"comment":"The fast-hidden-p-bit branch of the central result, Eq. (1), is derived from the behavioral model Eqs. (2)-(5) in the regime tau_h^r < tau_s, yet the paper itself states in Section III that the previously validated fast-synapse update rules are not valid in this regime and that Eq. (2) assumes instantaneous p-bit response. No device-level or experimental validation is provided for the extended model in this regime, so the quantitative predictions of Eq. (1) for tau_h^r/tau_s <= 1 rest on an unvalidated assumption. Please either validate the extended model (e.g., against device-level simulations of stochastic magnetic tunnel junctions in the fast-p-bit regime) or explicitly frame Eq. (1) as a model-based prediction whose fast-regime branch depends on the instantaneous-response assumption.","section":"Section III and Appendix A, Eq. (8)"},{"comment":"The effective-coupling extraction is a mapping by definition: Jeff is defined as tanh^{-1}(<m1 m2>) of the hidden-p-bit model, and the effective model then reproduces that same correlator by construction. The agreement between the hidden and effective models in Fig. 3(c) is therefore an internal consistency check, not an independent validation of the hidden-p-bit dynamics. The authors should state this limitation and, if possible, validate the mapping with a quantity not used in its definition, such as the conditional distribution P(m2 | m1) or the cross-correlation function C(t) = <m1(t) m2(t+tau)>.","section":"Section IV B, Fig. 3(c)"},{"comment":"The two branches of Eq. (1) do not match at tau_h^r/tau_s = 1: for small J1*beta the fast branch approaches (1/beta) atanh(erf(J1*beta)) ~ 1.128 J1, whereas the slow branch gives J1, a relative discontinuity of about 13%. Since the abstract and Section II claim continuous tunability, the authors should address this mismatch, e.g., by quantifying the width of the crossover region in Fig. 3(c) or by providing a single expression that interpolates smoothly between the two branches.","section":"Eq. (1)"}],"minor_comments":[{"comment":"The discrete-time update in Eq. (4) uses the flip probability 1 - exp(-dt/tau_i^r); the authors should state the simulation time step dt and confirm that it is small enough that the Poisson approximation does not affect the reported correlation times.","section":"Section III, Eq. (4)"},{"comment":"The caption states tau_r = 10 and tau_s = 1, so tau_r/tau_s = 10, whereas Section IV A asserts tau_r/tau_s >> 1 and the analytics in Appendix A assume this limit; Fig. A1 indicates noticeably better agreement for tau_r/tau_s = 100. Please reconcile the parameter choice or explain why tau_r/tau_s = 10 is adequate.","section":"Fig. 2 caption"},{"comment":"Rh(tau) is called the autocorrelation function but is used as the autocovariance, since the mean J1*beta is separated into mu; rename it to autocovariance or explicitly state that it is the centered autocorrelation.","section":"Appendix A, Eq. (A4)"},{"comment":"The Gaussian approximation for the filtered hidden-p-bit output is invoked for tau_h^r/tau_s <= 1; near tau_h^r ~ tau_s the number of flips per RC time is order unity, so the central-limit justification is weak. A short quantification of the approximation error would strengthen the derivation.","section":"Eq. (8) and Appendix A"}],"recommendation":"major_revision","confidential_remarks":"The paper is a model-based proposal. The principal risk is that the fast-p-bit regime, on which Eq. (1) depends, is an unvalidated extension of the behavioral model. I would not reject on that ground alone, but I would require the authors either to provide device-level support or to significantly temper the quantitative claims. The work may be better suited to an applied physics or circuits venue if experimental validation is not added."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the paper is a coherent theory proposal with a genuinely new knob – using the correlation time of an intermediate hidden p-bit to tune effective couplings in p-bit networks – and a clean analytic formula. It's worth engaging with, but not yet proof that the mechanism survives in hardware.\n\nThe main result is Eq. (1), which gives J21 as a function of τ_h^r/τ_s, with J12 fixed. The derivation is transparent: in the slow-hidden limit you get tanh(βJ1), in the fast limit you filter the hidden p-bit's RTN through the synapse RC, get a Gaussian, and the correlator becomes an erf. The mapping to a direct effective coupling is by definition, but that's not circular in the fitting sense; no parameters are fitted to data. The numerics cover the phase diagram and the analytic curves match the simulations. That part is solid.\n\nThe soft spot is exactly where the stress-test lands: the fast-p-bit regime. The paper acknowledges that prior analytical update rules are invalid for τ_h^r < τ_s and solves the ODEs numerically. But it's the same behavioral model equations (2)–(5) being integrated – there's no independent device-level check that the model remains faithful when the hidden p-bit flips faster than the synapse. The assumption of instantaneous p-bit response (Eq. (2)) is stated, not validated. So Eq. (1) is conditional on that model being right in this regime. That is a real limitation, but it's not a fatal one for a proposal paper. The authors are transparent about it, and the direction of the effect – noise creating a rectified coupling – is plausible and worth testing.\n\nMinor issues: no error bars on the numerical correlators, no code released, and the piecewise formula has a discontinuity at τ_h^r/τ_s = 1 that is glossed over (though it's small in practice). The citation pattern looks fine; the prior p-bit work is cited and the paper clearly distinguishes its regime from the standard fast-synapse assumption.\n\nWho is this for: anyone building p-circuit architectures, especially FPGA or magnetic p-bit implementations, and people thinking about using noise structure as a computational resource. It deserves a serious referee. A referee should push for either an experiment, a device-level simulation, or at least a crisper statement that Eq. (1) is a model-level prediction rather than a hardware guarantee.","headline":"A coherent theory proposal: a hidden p-bit's fluctuation rate as a new coupling knob, with a clean formula and honest limitations in the fast-regime model.","tokens_in":15060,"tokens_out":1789,"would_cite":true,"duration_ms":17991,"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":"A hidden p-bit with a tunable flip rate programs the effective coupling between two p-bits, and does so directionally.","keywords":["probabilistic computing","p-bits","tunable coupling","synaptic plasticity","random telegraph noise","timescale tuning","directional coupling"],"falsifier":"Measure the correlator $\\langle m_1 m_2 \\rangle$ in a three-p-bit circuit with $J_1\\beta = 0.1$, $J_2\\beta = 50$, and computational p-bit times much larger than $\\tau_s$, sweeping the hidden p-bit's correlation time from $\\tau_h^r/\\tau_s = 10$ down to $0.001$. The paper predicts $\\langle m_1 m_2 \\rangle$ climbs from about 0.1 to near 1 along the erf curve in Eq. (1) when p-bit 1 drives p-bit 2, while the reverse direction stays near 0.1; if the measured curve does not follow that prediction, or if both directions tune, the central claim is refuted.","tokens_in":14099,"feed_emoji":"🎲","tokens_out":9490,"duration_ms":84228,"temperature":0.7,"pith_summary":"This paper claims that the interaction strength between two probabilistic bits (p-bits) can be programmed by inserting a third 'hidden' p-bit between them and changing how fast that hidden p-bit randomly flips. In the regime where the coupling from the first p-bit to the hidden p-bit is weak while the hidden-to-second coupling is strong, the effective coupling $J_{21}$ rises smoothly from a small value toward saturation as the hidden p-bit's correlation time $\\tau_h^r$ is made shorter than the synapse time $\\tau_s$, while the reverse coupling $J_{12}$ stays fixed. The authors derive a closed-form expression for $J_{21}$ as a function of $\\tau_h^r/\\tau_s$ and confirm it numerically, and they map the motif onto an effective two-p-bit model with coupling $J_{\\mathrm{eff}}$. Because this 'synaptic plasticity' uses only the intrinsic dynamics of p-bits, it could allow on-chip reprogramming of p-computer networks without additional tuning hardware.","feed_headline":"Fast hidden p-bit makes p-bit coupling a tunable knob","feed_subtitle":"Modulating a hidden p-bit's fluctuation rate yields tunable, directional synaptic coupling—no extra hardware.","key_machinery":"The central object is the three-p-bit 'hidden p-bit model' of Eqs. (2)-(5): each p-bit outputs $\\operatorname{sign}(\\tanh(\\beta I)+\\eta)$ with random telegraph noise $\\eta$ of correlation time $\\tau_r$, and each synapse is a first-order low-pass filter with time constant $\\tau_s$. The tunability mechanism is the filtering of a fast hidden p-bit through a slow synapse: the power spectral density of the hidden p-bit's telegraph noise, $S_h(f) = \\frac{2\\tau_h^r}{1+(2\\pi f\\tau_h^r)^2}$, combined with the synapse transfer function $H(f) = \\frac{J_2}{1+i2\\pi f\\tau_s}$, gives the second p-bit an input with mean $\\mu = J_1 J_2 \\beta$ and standard deviation $\\sigma = \\frac{J_2}{\\sqrt{1+\\tau_s/\\tau_h^r}}$; the ratio $\\mu/\\sigma$ is what Eq. (1) exposes as the control knob for the effective coupling.","core_discovery":"The central discovery is that a hidden p-bit in the fast-fluctuation regime ($\\tau_h^r < \\tau_s$) does not merely add noise: the synapse's RC-like low-pass filter converts the hidden p-bit's random telegraph output into a Gaussian-distributed input for the second computational p-bit whose mean-to-noise ratio grows as $\\sqrt{1+\\tau_s/\\tau_h^r}$. With $J_1\\beta \\ll 1$ and $J_1 J_2 \\beta^2 \\gtrsim 1$, the effective coupling from computational p-bit 1 to p-bit 2 is $J_{21} = \\frac{1}{\\beta}\\tanh^{-1}\\left[\\operatorname{erf}\\left(\\frac{J_1\\beta}{\\sqrt{2}}\\sqrt{1+\\tau_s/\\tau_h^r}\\right)\\right]$ for $\\tau_h^r/\\tau_s \\lesssim 1$, and $J_{21} = J_1$ for $\\tau_h^r/\\tau_s \\gtrsim 1$, while $J_{12} = J_1$ for all ratios. This yields continuously tunable and directional effective coupling, verified by matching the correlator $\\langle m_1 m_2 \\rangle$ between the hidden-p-bit model and an effective model with direct coupling $J_{\\mathrm{eff}}$.","pith_inferences":["The same mean-to-noise filtering mechanism may extend beyond p-bits to any stochastic binary unit with tunable noise correlation, suggesting a generic design principle for programmable interactions in neuromorphic hardware.","Because the tuning curve in Eq. (1) is monotone in $\\tau_h^r/\\tau_s$, it could serve as a calibration function: measuring the correlator at one ratio fixes the effective coupling, allowing closed-loop programming of a p-bit network.","Since the directionality arises from asymmetry in $J_1$ vs $J_2$ rather than in the network topology, one could create networks with arbitrary directed graphs by choosing the weak and strong synapses appropriately; this is implicit but not developed in the paper.","A straightforward experimental check would be an FPGA-based p-bit network where the hidden p-bit's flip rate is set by a clock; deviations from the erf prediction would reveal whether the behavioral model holds in the fast-p-bit regime."],"forward_implications":["P-bit networks could achieve on-chip reprogrammability by adjusting fluctuation rates of hidden p-bits, without adding dedicated coupling-tuning hardware.","The scheme naturally produces asymmetric (non-reciprocal) couplings $J_{21} \\neq J_{12}$, which could be exploited in directed networks for machine learning and Bayesian inference.","Pairing two hidden p-bits, one for each direction, would allow independently programming $J_{ij}$ and $J_{ji}$, enabling symmetric programmable couplings for Boltzmann sampling and annealing.","Existing FPGA-based p-bit implementations could emulate the scheme using tunable clock rates, while antiferromagnetic p-bits with picosecond flipping rates are identified as promising physical candidates."],"supporting_citations":[{"why":"Supplies the behavioral p-bit model with random telegraph noise and synaptic filtering (Eqs. 2-5) that the paper extends to arbitrary timescale hierarchies.","marker":"[13]"},{"why":"Provides the fast-synapse analytical update rules whose breakdown in the fast-p-bit regime motivates the numerical ODE solution used here.","marker":"[54]"},{"why":"Demonstrates electrically tunable fluctuation rates in chiral antiferromagnets, the physical mechanism proposed for tuning the hidden p-bit's correlation time.","marker":"[51]"}],"fun_headline_variants":["Hidden p-bit dials coupling strength on the fly","Directional p-bit links from one hidden node","Tunable synapse via fast hidden p-bit","One hidden p-bit controls p-bit synapse strength","Stochastic synapse from a hidden p-bit"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the behavioral model of Eqs. (2)-(5), previously validated for slow p-bits with fast synapses, remains quantitatively accurate when the hidden p-bit fluctuates faster than the synapse; if that extension fails, Eq. (1) and the extracted $J_{\\mathrm{eff}}$ lose their support.","fun_headline_variants_meta":{"raw":{"variants":["Hidden p-bit dials coupling strength on the fly","Directional p-bit links from one hidden node","Tunable synapse via fast hidden p-bit","One hidden p-bit controls p-bit synapse strength","Stochastic synapse from a hidden p-bit"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000517,"raw_usage":{"total_tokens":2549,"prompt_tokens":1028,"completion_tokens":1521,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":644,"completion_tokens_details":{"reasoning_tokens":1460}},"tokens_in":644,"tokens_out":1521,"duration_ms":10780,"temperature":1.0,"reasoning_tokens":1460,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T04:46:58.596408+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Measure the correlator $\\langle m_1 m_2 \\rangle$ in a three-p-bit circuit with $J_1\\beta = 0.1$, $J_2\\beta = 50$, and computational p-bit times much larger than $\\tau_s$, sweeping the hidden p-bit's correlation time from $\\tau_h^r/\\tau_s = 10$ down to $0.001$. The paper predicts $\\langle m_1 m_2 \\rangle$ climbs from about 0.1 to near 1 along the erf curve in Eq. (1) when p-bit 1 drives p-bit 2, while the reverse direction stays near 0.1; if the measured curve does not follow that prediction, or if both directions tune, the central claim is refuted.","supporting_citations":[{"cited_title":"Faria, J","cited_arxiv_id":null,"evidence_quote":"Supplies the behavioral p-bit model with random telegraph noise and synaptic filtering (Eqs. 2-5) that the paper extends to arbitrary timescale hierarchies."},{"cited_title":"Sutton, R","cited_arxiv_id":null,"evidence_quote":"Provides the fast-synapse analytical update rules whose breakdown in the fast-p-bit regime motivates the numerical ODE solution used here."}],"review_version":1}