{"id":"36cce7cd-f64c-428e-9c44-eeb16e357ee4","arxiv_id":"1908.06339","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"The paper argues that network structure cannot be fully inferred from dynamics: fast global dynamics hides local node roles, and fast local dynamics hides global distances, an uncertainty-like tradeoff.","lead":"The paper shows that how well you can read a network from watching its dynamics depends on the speed of the node's internal process compared with the speed of links between nodes, and in some regimes structure is hidden. This matters because it suggests fundamental limits on inferring brain or social network structure from observed activity, even with perfect data.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The 'uncertainty principle' rests on treating the scalar reaching-time observable as the only information carrier; no bound rules out full-trajectory reconstruction.","rationale":"The reader's weakest assumption correctly identifies the scalar reaching-time observable as the load-bearing element of the impossibility claim. My stress-test analysis agrees: the paper demonstrates that a single threshold-crossing time loses resolving power at both extremes of the local/global timescale ratio, but it does not establish that the full dynamical state, or a multi-threshold summary, is equally degraded. The communicability-based upper-bound argument in the Supplemental Information does not close this gap because an upper bound on infection level is not an upper bound on information content. The modular network example in Fig. 2 uses overlap of scalar RT intervals as its definition of community indistinguishability, so it cannot speak to multivariate observables. The missing specification of the noise variance σ in the Langevin simulations further weakens the claim that the observed flattening is intrinsic rather than noise-dominated. These issues do not undermine the paper's core qualitative demonstration, but they do mean the sweeping 'uncertainty principle' in the abstract and conclusion is not currently supported. The reader's CONDITIONAL verdict is appropriate: publishable as a phenomenological study, but requiring formalization and a baseline using richer observables before the impossibility claim can stand. Hence UNCHANGED.","tokens_in":8903,"tokens_out":2874,"duration_ms":33595,"concrete_test":"Run the same SI metapopulation model on the 4-module SBM with α=0.15 and α=0.05 at a specified noise variance σ (e.g., σ=0.01), recording for each node the full trajectory I_i(t) or a multivariate summary such as the vector of times to cross K thresholds I0, 2I0, ..., K I0. Compute pairwise Euclidean distances (or correlations) between nodes from these vectors and apply spectral clustering or another standard community-detection method. If the four modules are recovered with high adjusted mutual information in regimes where the scalar RT ranges overlap, then the claimed 'loss of structural information' is specific to the scalar observable and the uncertainty-principle generalization fails. Repeat over a range of σ to locate the noise level at which recovery genuinely degrades.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires that no dynamical observable can recover structural information when the spread of scalar reaching times RT_i is small. What the paper actually shows is that a single threshold-crossing time becomes uninformative: in the α→0 limit, fast diffusion drives all nodes to nearly equal infection levels before the threshold, so RT_i values collapse. But the full infection trajectories I_i(t) still contain node-specific transients, and the paper provides no information-theoretic argument that those transients are destroyed by noise for the σ values used. The communicability upper bound in the Supplemental Information (dot I ≤ rAI, Eq. 3) is an upper bound on infection level, not a bound on information; saturation of a threshold crossing does not imply saturation of the underlying dynamics. The modular example in Fig. 2 inherits the same limitation: the correlation corr_xy is defined entirely through overlap of scalar RT ranges (min/max RT_y), and the noise amplitude σ is never specified, so the reported loss of distinguishability could be an artifact of one observable plus an arbitrary noise level rather than a fundamental indetermination. The qualitative phenomenology is plausible, but the 'uncertainty principle' is asserted, not derived, and is not tested against any reconstruction method that uses more than one crossing time per node.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies how the balance between intra-node and inter-node dynamics affects the possibility of inferring network structure from dynamical observations. Using an SI metapopulation model with infection rate r=α and diffusion rate D=1−α, the authors define a reaching time RT_i as the time for a seed infection started at node i to reach a fixed concentration I0 at an observation node. They compare RT_i with communicability-type centralities and show numerically that for α→0 the RT vector becomes flat, while for α→1 it organizes into distance shells. For a modular network, they add white noise and define a module-overlap correlation corr_xy based on RT ranges; as α decreases, module ranges overlap and the inferred community structure degrades. The paper concludes that these observations constitute an 'uncertainty principle' limiting the joint recovery of local and global network properties from dynamics.","tokens_in":9130,"tokens_out":4323,"duration_ms":41779,"significance":"If the central claim were established, it would have broad relevance for network inference in neuroscience and data science, because it would imply fundamental limits on what can be recovered from dynamical measurements. The paper's concrete contribution is the observation that a single scalar observable (threshold-crossing time) becomes uninformative at both extremes of the α parameter, together with a valid inequality in the Supplemental Information showing that the linearized SI dynamics upper-bounds the nonlinear one. The numerical illustrations for scale-free and modular networks are transparent and reproducible from the described setup. However, the 'uncertainty principle' is a strong impossibility statement that is not derived; the paper demonstrates a degradation of one specific observable, not an information-theoretic limit on all observables.","major_comments":[{"comment":"The limit arguments for α→0 and α→1 are based on a heuristic factorization of the nonlinear SI operator into independent exponentials, and they are applied to \\tilde C_{ij}, a formal object, rather than to the actual reaching time RT_i. The equation \\lim_{t→∞} \\tilde C_{ij}^{α→0} = (e^{β f(x)})_{ij} mixes an infinite-time limit with a finite-time observable and is not a derivation; consequently the central claim that 'the system may lose track of the structural features' is not established for the dynamics, only for the chosen centrality proxy.","section":"Main text, paragraph after Fig. 1b"},{"comment":"The statement 'if the range of values taken by the reaching time RT_i over all nodes i is small, then in the presence of noise ... it is not possible to distinguish the nodes anymore' is asserted for the scalar RT_i only. The paper does not provide an information-theoretic bound or any argument excluding reconstruction methods that use the full infection trajectories I_i(t) or their correlations; such methods could in principle distinguish nodes even when the threshold-crossing times collapse. This is the load-bearing assumption of the claimed uncertainty principle.","section":"Main text, paragraph before Fig. 2"},{"comment":"The correlation is defined as the fraction of nodes of module x whose RT value lies between the minimum and maximum RT of module y. This is an overlap statistic of one-dimensional ranges, not a measure of the success of community detection or network reconstruction. The noise amplitude σ of the Langevin equation is not specified anywhere in the figure or text, so the reported merging of modules is not shown to be a property of the deterministic dynamics; it may depend on an arbitrary noise level. The conclusion that 'precise inference of the community structure is impossible' is therefore not supported by the presented evidence.","section":"Fig. 2, definition of corr_xy"},{"comment":"The paper extrapolates from the SI spreading model to a general 'uncertainty principle' for network inference. No argument is given that the trade-off observed for RT_i in the SI model applies to other dynamics (e.g., threshold, voter, or linear systems) or to other observables (e.g., full time series, spectra, or covariances). Without such a generalization or an explicit restriction of the claims to the scalar-observable setting, the title and abstract overstate the result.","section":"Summary section"}],"minor_comments":[{"comment":"The phrase 'renowed Milgram's experiment' contains a typo: 'renowed' should be 'renowned'.","section":"p. 2, Introduction"},{"comment":"The sentence 'we take the time needed for the infection to reach such node' is unclear; 'such node' should be 'a pre-selected observation node'.","section":"p. 2, definition of RT_i"},{"comment":"The formula for corr_xy is incomplete as printed; it lacks a closing bracket and a clear definition of the summation index i.","section":"Fig. 2b, Eq. for corr_xy"},{"comment":"In the equation \\dot ξ_i = F(α,A) ξ_i + η_i, the stochastic state vector ξ_i is introduced but its relation to S_i and I_i is not defined; please clarify.","section":"p. 4, Langevin equation"}],"recommendation":"major_revision","confidential_remarks":"The paper makes an ambitious claim that is likely to attract attention. The core numerical observation is plausible, but the gap between the scalar-observable demonstration and the general 'uncertainty principle' is substantial. I recommend major revision; if the authors can either prove an information-theoretic bound or explicitly limit the claims to threshold-crossing observables, the paper could become publishable. The incomplete citation details and typos are minor but should be fixed."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nYou should know: this is a short, provocative Letter with a solid negative observation and a central claim that outruns its evidence. The observation is that for SI dynamics on a network, a scalar observable—the time for infection to cross a small threshold at an observation node—loses node-level resolution at both extremes of the local/global timescale ratio α. At α→0, fast diffusion homogenizes everyone; at α→1, slow diffusion makes the observable depend only on distance shells. That is a clean and honest demonstration, and the paper deserves credit for directly challenging Brockmann and Helbing's shortest-distance inference claim, and for checking that a random-walk Laplacian does not qualitatively change the picture.\n\nWhat's actually new: the two-timescale interpolation with α, the variance curve, and the modular-network overlap plots. The SI's upper bound (İ ≤ rAI) is correct and justifies communicability as a benchmark. This is a useful conceptual contribution for people building inference methods from spreading data.\n\nThe soft spots are real and not minor. The \"uncertainty principle\" is not derived; it is an extrapolation from the spread of one observable. The paper never rules out reconstructing structure from full infection trajectories or from correlations between node states, and in the α→0 limit the transient before homogenization could still carry information—the paper doesn't quantify how fast the equalization happens relative to measurement rates. The noise amplitude σ in the Langevin version is never specified, so the reported loss of distinguishability could depend on an arbitrary noise level. The correlation measure in Fig. 2 is really a range-overlap fraction, not a correlation, and the formula is garbled. The α→1 limit is also hand-wavy: with D=1−α→0, the SI model has no inter-node transmission, so the distance-shell step function is plausible but not actually derived from the equations.\n\nNone of this makes the paper worthless. The qualitative phenomenology is likely correct for scalar threshold-crossing observables, and the letter is a fair warning to anyone who thinks centrality measures or RTI-based inference are robust. But it is a call for a more careful formalization, not a proven impossibility.\n\nWho should read it: network scientists and computational neuroscientists working on inference; it's a good discussion piece. It deserves a serious referee—the core claim is important if true, and the current version could be tightened substantially. I'd engage with it.","headline":"The scalar reaching-time result is real, but the 'uncertainty principle' is an assertion, not a theorem—still worth a referee.","tokens_in":9650,"tokens_out":3857,"would_cite":false,"duration_ms":43346,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C82","91D30"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper argues that the local/global timescale ratio of a networked dynamical process forces a trade-off: a single observable cannot reveal both a network's local node roles and its global community structure.","keywords":["network inference","centrality measures","communicability","SI epidemic model","uncertainty principle","modular networks","reaching time","metapopulation dynamics"],"falsifier":"Simulate the same SI metapopulation model with $\\alpha$ close to zero and attempt to recover known community structure from the complete infected-concentration trajectories of all nodes, rather than from only the threshold-crossing times; if trajectory-based or correlation-based reconstruction reliably distinguishes the modules in the regime where the paper predicts they merge, the stated uncertainty principle fails for that class of observables.","tokens_in":1697,"feed_emoji":"🕸️","tokens_out":2180,"duration_ms":70707,"temperature":0.7,"pith_summary":"The paper studies how much of a network's structure can be recovered by watching a dynamical process on it, using epidemic spreading as the test case. It claims that when the dynamics inside nodes is slower than the dynamics between nodes, all nodes become nearly indistinguishable, and when the ratio is reversed, only coarse global features such as shortest-distance shells survive. Neither regime preserves both local node roles and global community structure, so static centrality measures built from topology alone can mislead a dynamical observer. The authors call this an uncertainty principle for network inference: resolving global structure sacrifices local dynamical resolution, and vice versa. In modular networks, fast global dynamics can make community structure impossible to infer precisely.","feed_headline":"Network structure can't be fully recovered from dynamics","feed_subtitle":"When node-level dynamics outpace or lag inter-node spreading, centrality rankings lose meaning.","key_machinery":"The central object is the reaching time $RT_i$, the threshold-crossing time of an infection seeded at node $i$ and measured at a fixed observation node, compared against communicability centrality $C_{ij} = (e^{\\beta A})_{ij}$, where $A$ is the adjacency matrix. The communicability is tied to the dynamics by the fact that the linearized SI model is bounded above by $\\dot I \\le r A I$, making the matrix exponential a natural linear proxy for the infection process. The tuning parameter $\\alpha$ controls the balance between the node-level reaction term and the inter-node diffusion term in the mean-field equations, and the paper uses the sample variance of $RT_i$ over nodes, together with a correlation score between modules, to quantify when nodes or communities become indistinguishable.","core_discovery":"For an SI epidemic spreading in a metapopulation network, the time at which an initially infected node causes a measured node to cross a fixed observation threshold—the reaching time $RT_i$—is taken as the dynamical observable of node relevance. The paper shows that as the parameter $\\alpha$ tunes the balance between local node dynamics and inter-node diffusion, the ranking of nodes changes dramatically: for small $\\alpha$, diffusion homogenizes the system and the reaching times of all nodes collapse, erasing structural distinctions; for large $\\alpha$, the process behaves like a contact process and nodes fall into distance shells, losing local differentiation. The paper also proposes dynamic-aware communicability measures built from the Laplacian or Jacobian matrices, but argues that in strongly nonlinear regimes no linear-operator centrality can fully match the dynamical observable. The conclusion is that network centrality and network inference are not universal: they depend on the ratio of local to global dynamical time scales, and there is a fundamental limit to extracting multi-resolution structural information from a single dynamical observable.","pith_inferences":["The stated uncertainty principle is proven for a particular scalar observable, the reaching time; whether the same trade-off holds for methods that use the full multivariate infection trajectories or pairwise correlations is a testable conjecture rather than a consequence of the paper's argument.","A direct test would be to attempt community reconstruction from the complete infected-concentration time series in the small-$\\alpha$ regime, where the paper predicts modules merge; successfully recovering the modular structure there would narrow the scope of the claimed limit.","In neuroimaging contexts, fast global hemodynamic averaging could mimic the small-$\\alpha$ regime and hide modular connectivity even when it exists structurally, suggesting that the paper's mechanism may be relevant beyond epidemic models.","The communicability family could be made more dynamics-aware by fitting the scaling parameter $\\beta$ to the observed local-to-global timescale ratio rather than fixing it a priori, an adjustment the paper motivates but does not implement."],"forward_implications":["Centrality rankings obtained from static topology alone are regime-dependent: the same network can rank nodes differently depending on the timescale of the dynamical process being observed.","When inter-node dynamics are fast relative to node dynamics, all nodes appear to respond nearly simultaneously, so degree-based or communicability-based rankings lose their discriminating power.","When node dynamics dominate, the system reduces to a contact-process-like picture in which nodes are organized into shortest-distance shells and local node identities are lost.","Community detection from dynamics is fragile in strongly modular networks: with fast global dynamics, distinct modules can produce overlapping reaching-time windows and appear merged.","Adding dynamical information to the centrality measure, for example by using the Jacobian communicability $C^{\\rm Jac}_{ij} = (e^{\\beta J})_{ij}$, improves agreement with the observable but does not fully recover the nonlinear dynamical ranking."],"supporting_citations":[{"why":"Defines communicability centrality $C_{ij}=(e^{\\beta A})_{ij}$, which the paper uses as the representative topological centrality for comparison against the dynamical observable.","marker":"[14]"},{"why":"Provides the communicability and total-communicability formalism used to interpret the matrix exponential as a measure of dynamical influence.","marker":"[15]"},{"why":"Introduces a Jacobian-based communicability for neuronal dynamics, which the paper adapts as a dynamics-aware centrality.","marker":"[16]"},{"why":"Claims that shortest-distance structure can be inferred from epidemic spreading; the paper's trade-off directly limits that inference.","marker":"[21]"},{"why":"Supplies the contact-process description of the large-$\\alpha$ limit, where nodes sort into distance shells and local resolution is lost.","marker":"[25]"},{"why":"Documents distinct intra-module and inter-module time scales in modular networks, which the modular-indistinguishability result relies on.","marker":"[27]"}],"fun_headline_variants":["Dynamics can obscure network structure","Time-scale ratio dictates network inference limits","Centrality measures lose meaning at extreme time scales","Uncertainty principle for network structure from dynamics","Networks reveal only what time scales allow"],"cache_read_input_tokens":11776,"weakest_assumption_plain":"The argument assumes that all structural information available in the dynamics is carried by the spread of one scalar per node—the reaching time—so that when this spread shrinks the nodes are indistinguishable; methods that use the full infection time series or correlations between node trajectories are not ruled out by the paper's reasoning.","fun_headline_variants_meta":{"raw":{"variants":["Dynamics can obscure network structure","Time-scale ratio dictates network inference limits","Centrality measures lose meaning at extreme time scales","Uncertainty principle for network structure from dynamics","Networks reveal only what time scales allow"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00056,"raw_usage":{"total_tokens":2650,"prompt_tokens":925,"completion_tokens":1725,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":541,"completion_tokens_details":{"reasoning_tokens":1660}},"tokens_in":541,"tokens_out":1725,"duration_ms":13998,"temperature":1.0,"reasoning_tokens":1660,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:48:17.498892+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate the same SI metapopulation model with $\\alpha$ close to zero and attempt to recover known community structure from the complete infected-concentration trajectories of all nodes, rather than from only the threshold-crossing times; if trajectory-based or correlation-based reconstruction reliably distinguishes the modules in the regime where the paper predicts they merge, the stated uncertainty principle fails for that class of observables.","supporting_citations":[{"cited_title":"Murray, Mathematical Biology: I","cited_arxiv_id":null,"evidence_quote":"Claims that shortest-distance structure can be inferred from epidemic spreading; the paper's trade-off directly limits that inference."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the contact-process description of the large-$\\alpha$ limit, where nodes sort into distance shells and local resolution is lost."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Documents distinct intra-module and inter-module time scales in modular networks, which the modular-indistinguishability result relies on."}],"review_version":1}