{"id":"523ed068-d4f1-4958-937b-44217e143efa","arxiv_id":"2605.26551","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"Random neural networks with finite recording time and context variability match observed neural population dimensionality, but current data lengths prevent dimensionality from discriminating connectivity structures.","lead":"Random neural networks incorporating finite measurement time and behavioral context variability quantitatively match the low dimensionality observed in neural population recordings. This work offers guidance on experimental designs needed to distinguish underlying connectivity structures using population data.","discovery_kind":"new_application","skeptic_critique":{"model":"grok-4.3","headline":"DMFT finite-time predictions under fluctuating context input lack direct validation against network simulations","rationale":"The reader's weakest assumption correctly isolates the modeling choice whose failure would most directly undermine the quantitative match. Full-text derivations would need to include explicit finite-N or finite-T error bounds or simulation benchmarks to close this gap; absent those, the claim remains conditional on the approximation holding.","tokens_in":1712,"tokens_out":291,"duration_ms":18696,"concrete_test":"For the parameter set used in the main figures, run direct simulations of the random network (N=500–2000 neurons) over recording durations matching the experimental data; compute empirical participation ratio from the finite-time covariance matrix and compare to the DMFT formula. If the relative error exceeds 15–20% across the input-strength range where non-monotonicity is claimed, the finite-time DMFT step is unreliable for the headline consistency result.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim requires that adding finite measurement time and context variability (modeled as extra fluctuating external input) makes random-network dimensionality match experimental values. This rests on DMFT remaining accurate for the finite-time covariance statistics of interest. If the mean-field closure or the input-fluctuation representation deviates for the relevant timescales and input strengths, the reported consistency could be an artifact of the approximation rather than a genuine prediction of random connectivity.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript claims that Dynamical Mean-Field Theory (DMFT) analysis of minimally structured random neural networks, after incorporating finite measurement time and behavioral context variability modeled as fluctuating external input, yields dimensionality values consistent with those measured in large-scale neural population recordings. It further concludes that current recording durations limit the use of dimensionality to discriminate connectivity structures, while analytically predicted dimensionality varies non-monotonically with external input strength and manifold orientation similarity across contexts may be a more sensitive probe of network structure.","tokens_in":1798,"tokens_out":373,"duration_ms":30897,"significance":"If the central results hold, the work supplies a quantitative baseline showing that random connectivity plus realistic experimental factors can account for observed low dimensionality without invoking additional structure, while identifying concrete limitations of dimensionality as a discriminator and proposing manifold orientation similarity as an alternative experimental test. The use of analytical DMFT derivations and emphasis on falsifiable predictions for experimental design are positive features.","major_comments":[{"comment":"The claim that random-network dimensionality matches experimental values once finite time and context variability are included rests on DMFT remaining accurate for finite-time covariance statistics under fluctuating external input; however, the manuscript provides no direct numerical simulations validating the mean-field closure against full network dynamics for the relevant timescales and input strengths (see skeptic concern on finite-time predictions).","section":"DMFT finite-time analysis"},{"comment":"The reported consistency with data involves varying external input strength (listed among free parameters), which functions as a fitted rather than independently predicted quantity; this introduces moderate circularity in the comparison to recordings and weakens the assertion that random models quantitatively account for the observations without additional tuning.","section":"Comparison to experimental data"}],"minor_comments":[],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"grok-4.3","letter":"The main point is that random networks, after adding finite measurement time and context-to-context input fluctuations, give dimensionality values that line up with large-scale recordings. At the same time the work shows that existing recording durations are too short for dimensionality to tell random connectivity apart from other structures.\n\nThe new pieces are the non-monotonic dependence of dimensionality on external input strength and the claim that orientation similarity across contexts is more sensitive to network details than dimensionality itself. Both come from the DMFT treatment and supply concrete numbers for how long recordings need to be and which metric to prioritize.\n\nThe match to data still requires tuning the strength of the fluctuating external input, so it is not an out-of-sample prediction. The abstract gives no sign that the finite-time DMFT expressions were cross-checked against direct network simulations, which leaves open whether the mean-field closure holds for the covariance statistics at the relevant timescales. That is the main soft spot, and it is moderate rather than minor.\n\nThe paper is aimed at computational neuroscientists who want quantitative rules for choosing recording length and analysis metrics when trying to infer connectivity from population activity. It is worth sending to referees because the guidance on experimental design is specific enough to be tested and the analytical extensions are clearly stated even if the validation steps need tightening.","headline":"Random networks match recorded dimensionality once finite time and context variability are folded into DMFT, but current data lengths still cannot distinguish connectivity structures.","tokens_in":2283,"tokens_out":332,"would_cite":false,"duration_ms":25731,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":null,"created_at":"2026-06-29T15:08:12.556625+00:00","model_set":{"reader":"grok-4.3"},"falsifier":null,"supporting_citations":[],"review_version":1}