{"id":"ebae446b-21e4-42c8-9073-8b73f463c374","arxiv_id":"2611.17219","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"On any unbounded time scale, the LIF neuron keeps the classical membrane trajectory and fires at times t_{n+1} = Π_T^+(t_n + T_c).","lead":"A math paper shows that the leaky integrate-and-fire neuron model can be written on any continuous, discrete, or irregular time grid while preserving the original passive membrane dynamics, with firing times following a simple projection recursion. It cleanly separates the unchanged membrane physics from the timing constraints imposed by the grid, a distinction that matters for event-driven and irregularly sampled neural simulation.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek/deepseek-v4-flash","headline":"No significant objection identified: Theorem 3 is sound within its explicit constant-input scope; the recursion follows from exact restriction and reset autonomy, and all stated limitations are acknowledged.","rationale":"The reader's ACCEPT verdict is warranted. I examined the exact-restriction construction (Definition 5, Lemma 1, Lemma 2, Corollary 1), the firing-time theorems (Theorem 2, Theorem 3, Remark 2), the projection-gap lemma (Lemma 3, Corollary 3), and the hZ law (Corollary 4). The central recursion is a direct consequence of constant τ_m and V∞ plus Fact 5; no step uses any structural assumption on T beyond closedness and unboundedness above. The inverse-cylinder coefficient is the standard exact-exponential discretization, so the paper's claim that the membrane semigroup is preserved is correct. The naive transcription's failure modes (Theorem 1) are correctly classified. The one condition that would invalidate the recursion outside the paper's scope is time-varying input or nonconstant parameters; this is explicitly stated in Assumption 1 and the Limitations paragraph, so it is an acknowledged boundary rather than a defect. The unshipped figure script is a minor reproducibility issue, not relevant to the mathematical claim. Agreement with the reader is partial: the constant-input assumption is indeed the only conceivable failure mode, but because the paper scopes and acknowledges it, I do not treat it as a live objection.","tokens_in":13700,"tokens_out":23817,"duration_ms":170146,"concrete_test":"Independently re-derive t_{n+1} by writing the restarted IVP on T∩[t_n,∞) as y^Δ=p_m y with y(t_n)=V_r−V∞, solving via Fact 3, and computing the first t∈T with y(t)≥V_th−V∞; verify that this equals Π_T^+(t_n+T_c) without using any regularity of T beyond closedness and unboundedness above. As a numerical cross-check, simulate this IVP directly on a non-translation-invariant time scale such as T={0}∪⋃_{k≥1}[a_k,b_k] with varying block lengths and gaps for 10^3 resets, and compare every firing time to the recursion.","verdict_should_be":"UNCHANGED","load_bearing_attack":"After line-by-line checking of Theorem 3 and its supporting results (Lemma 2, Corollary 1, Theorem 2, Lemma 3, Corollary 4), I find no unacknowledged load-bearing flaw in the central claim within its stated scope. The recursion t_{n+1}=Π_T^+(t_n+T_c) is justified by three facts, all present in the text: (i) the structure-preserving coefficient p_m gives V(t)=V∞+(V_0−V∞)e^{−(t−t_0)/τ_m} on T (Corollary 1), so the on-time-scale branch is the classical solution; (ii) after a reset at t_n∈T, the restarted branch is the same formula with V_r, whose continuous crossing time is t_n+T_c because τ_m and V∞ are constant; (iii) Π_T^+ maps into T whenever T is closed and unbounded above (Fact 5), and this projection argument needs no periodicity, homogeneity, or translation invariance. The only premise that could break the recursion outside its scope is time-varying input or nonconstant parameters, which the authors explicitly exclude in Assumption 1 and the Limitations paragraph; that is a scoping choice, not a hidden assumption. Lemma 3's gap bound and Corollary 4's hZ quantization also check out. The promised make_figures.py is not included, but all claims are closed-form and none depend on the simulations.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek/deepseek-v4-flash","summary":"The paper develops a time-scale calculus formulation of the leaky integrate-and-fire (LIF) neuron under constant input. The central result is that after the first spike, firing times satisfy t_{n+1} = Π_T^+(t_n + T_c) for any time scale T that is closed and unbounded above, with no periodicity or homogeneity required. The key technical step is the construction of a structure-preserving coefficient p_m via the inverse cylinder transformation, which ensures that the subthreshold voltage on T is exactly the restriction of the classical continuous-time solution. The paper also characterizes failure modes of a naive direct transcription, provides a bound on the projection delay, and gives an explicit quantization law on hZ.","tokens_in":14075,"tokens_out":968,"duration_ms":13473,"significance":"If correct, the paper provides a clean separation between the passive membrane physics (which is preserved exactly) and the temporal opportunity structure imposed by the time domain. This is a conceptually useful framework for understanding how discrete or irregular time grids affect spike timing in LIF models. The results are mathematically rigorous within the stated scope (constant input, no adaptation, no refractory period). The paper is clearly written and makes appropriate use of time-scale calculus. The central recursion is simple and elegant. The paper does not claim more than it delivers; limitations are explicitly acknowledged.","major_comments":[],"minor_comments":[{"comment":"The abstract states 'the first systematic Hilger-calculus treatment of a threshold-and-reset LIF spiking neuron on an arbitrary time scale.' This is a reasonable claim given the literature review, but the phrase 'systematic Hilger-calculus treatment' could be slightly toned down to 'a Hilger-calculus treatment' to avoid any perception of overclaiming, though the authors do carefully distinguish from prior work in the introduction.","section":"Abstract","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The definition of p_m(t) for µ(t)>0 is given as (e^{-µ(t)/τ_m} - 1)/µ(t). It might be helpful to explicitly note that this is the standard inverse cylinder transformation applied to the constant -1/τ_m, which is already stated but could be emphasized for readers less familiar with time-scale calculus.","section":"§4.2, Definition 5","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The proof of Theorem 2 states 'the subthreshold label is purely interpretive.' This is a bit informal; consider rephrasing to clarify that the voltage trajectory (5) is defined for all t in T regardless of whether it exceeds threshold, and the threshold condition is applied separately.","section":"§5, Theorem 2","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The condition 'T∩(-∞, x] ≠ ∅' is needed for the definition of δ_T(x). This is fine, but it might be worth noting that for the application to firing times, this condition holds because t_n + T_c ≥ t_0 + T_c > t_0 and T is unbounded above, so the intersection is nonempty. This is implicit but could be made explicit.","section":"§6, Lemma 3","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The paper states that all figures are produced by a single reproducible script (make_figures.py). However, the script is not included in the arXiv submission. While this does not affect the mathematical claims, including the script or a link to it would enhance reproducibility.","section":"§7, Numerical illustrations","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"Reference [5] (Duque et al.) is from 2023; the paper might benefit from a brief note on how the present work differs from that example, which is already done in the introduction. No further changes needed.","section":"References","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The paper uses the notation Π_T^+ for forward projection. This is defined in Definition 3. It might be helpful to remind the reader of this notation when it first appears in the abstract or introduction, but it is clear enough.","section":"General","authors_acknowledge":null,"authors_acknowledge_p":null}],"recommendation":"minor_revision"},"author_rebuttal":null,"desk_editor":{"model":"deepseek/deepseek-v4-flash","letter":"The paper does exactly what it says: it takes the LIF neuron under constant current and writes it on an arbitrary time scale T using the inverse cylinder transformation so that the membrane trajectory is the exact restriction of the classical continuous solution. The central result is the recursion t_{n+1} = Π_T^+(t_n + T_c) for all n ≥ 1 after the first spike, which holds for any closed T unbounded above with no periodicity or homogeneity required. The math is clean, the derivations are correct, and the authors are scrupulous about what they do and do not claim. They explicitly decline to claim the first single-neuron model on time scales (Duque et al. already have one without threshold/reset), they acknowledge that exponential propagation is not new, and they state the constant-input limitation plainly in the Limitations paragraph. The paper also gives a nice classification of the failure modes of the naive delta-LIF transcription (Theorem 1) and the hZ quantization law (Corollary 4) is a clean closed-form result.\n\nThe soft spots are real but contained. The load-bearing premise is constant input and constant parameters (τ_m, V_∞), which makes T_c independent of absolute time. The authors say this is the foundational case and leave time-varying input, refractory periods, adaptive thresholds, and network coupling to future work. That is an honest scope, not a hidden flaw. The only concrete missing artifact is the promised make_figures.py script, but every result is closed-form and no theorem depends on the simulations, so this is minor. The paper is not long, but it is self-contained and the arguments are checkable.\n\nWho is this for? Mathematicians working in time-scale calculus who want a clean example of a hybrid system; computational neuroscientists who want a precise statement of what changes and what does not when you move from continuous to discrete or irregular time domains. It is not a simulation paper and it does not claim biological novelty beyond the constant-input case.\n\nRecommendation: send to peer review. The paper is sound within its stated scope, the writing is clear, and the authors are honest about limitations. A referee can check the derivations quickly and confirm the scope. No desk reject needed.","headline":"Clean, honest math: the recursion t_{n+1} = Π_T^+(t_n + T_c) is correct and the paper knows its scope. The constant-input limitation is real but acknowledged. Worth a referee.","tokens_in":14646,"tokens_out":562,"duration_ms":8199},"pith_extraction":null,"created_at":"2026-11-13T09:09:47.050279+00:00","model_set":{"reader":"deepseek/deepseek-v4-flash"},"pipeline_version":"pith-pipeline@v1.4.1-daily-deepseek-or-medium","input_kind":null,"input_chars":null,"input_total_chars":null,"passes_missing":null,"published_standing":null,"published_confidence":null,"objection_audit":null,"run_record":null,"basis":{"kind":"not_recorded","source":null,"chars_given":null,"chars_total":null},"receipt":null,"falsifier":null,"supporting_citations":[],"lane_accuracy":{"status":"not yet measured","lane":{"model":"deepseek/deepseek-v4-flash","input_kind":null},"url":"https://pith.science/accuracy"},"review_version":1}