{"id":"05ac3022-fc09-4f0b-9bc8-216b79ddd9bb","arxiv_id":"2505.23178","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":3.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper claims an exact product-form generating function for the D-BMAP/G/∞ queue, but its formula disagrees with its own direct M/M/∞ derivation by one time slot.","lead":"This paper derives a generating function for the time-dependent number of customers in a discrete-time infinite-server queue with batch Markovian arrivals and general service times. The paper's own M/M/∞ example contradicts its central formula by one time slot, so the claimed exact distribution is not reliable as stated.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"One-step time-index slip: Lemma 2 uses Φ(t−s) for arrivals in step s→s+1, but under Definition 1 they arrive at s+1 and need Φ(t−s−1); consequently Theorem 2 contradicts the paper's own M/M/∞ recursion (18).","rationale":"The reader's weakest_assumption and my independent check identify the same load-bearing issue. The paper defines a customer arriving at time slot t as counted at time slots t,...,t+s−1, and its Appendix A simulation counts a customer at time t only if service completion is strictly larger than t. Therefore, for the transition from s to s+1, a customer arriving at time s+1 is counted at time t with probability Φ(t−s−1), not Φ(t−s). Lemma 2's use of Φ(t−s) shifts every arrival one step earlier than the definition allows. This error propagates directly into Theorem 2's product and into the claimed M/M/∞ distribution. The strongest internal corroboration of the problem is Section 5 itself: the direct Markovian recursion Eq. (18) is stated as being 'fully consistent' with Eq. (17), but iterating it produces factors (1+p(z−1)), (1+pα(z−1)), ... rather than the α, α², α³... factors in Eq. (17). The t=1 case is decisive, since Definition 1 forces new arrivals at slot 1 to be present with probability 1, giving mean p, whereas Eq. (17) gives mean pα. The numerical SSA comparison in Fig. 2 does not resolve the issue because it tests the theorem's own Fokker-Planck-like construction rather than the independent recursion, and no machine-checked proof or independent derivation is provided. The result appears repairable by shifting the survival index, but as written the paper's main theorem does not match the model it defines, so the reader's rejection is justified.","tokens_in":9590,"tokens_out":8275,"duration_ms":83562,"concrete_test":"Settle by recomputing M/M/∞ under the stated model: set N(0)=0 and iterate the paper's own recursion Eq. (18), N(t)=Bin(N(t−1),α)+Bernoulli(p). Evaluate the PGFs for t=1 and t=2. Theorem 2 predicts G(z,1)=1+pα(z−1) and G(z,2)=(1+pα(z−1))(1+pα²(z−1)), while the recursively computed PGFs are G(z,1)=1+p(z−1) and G(z,2)=(1+p(z−1))(1+pα(z−1)). If the recursive values differ from Eq. (17), the exact-distribution claim is off by one time step and fails for the model as defined.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central product formula (Theorem 2) inherits Lemma 2's transition probability, which treats a customer arriving during the step from s to s+1 as present at time t with probability Φ(t−s)=P(Y>t−s). But under the paper's Definition 1, a customer arriving at time slot s+1 is counted at time slot t iff Y>t−(s+1): same-slot arrivals are always counted, so the correct survival probability is Φ(t−s−1), with Φ(0)=1. This is not merely a convention choice inside the paper: the direct Markovian recursion in Section 5 exposes the slip. Iterating Eq. (18) from G(z,0)=1 gives G(z,1)=1+p(z−1) and G(z,2)=(1+p(z−1))(1+pα(z−1)), whereas Eq. (17) gives G(z,1)=1+pα(z−1) and G(z,2)=(1+pα(z−1))(1+pα²(z−1)). The paper's claim that Eq. (18) 'finally yields' Eq. (17) is therefore arithmetically false. For t=1 the difference is stark: Definition 1 forces mean customer number p, while Theorem 2 predicts pα. The announced exact distribution is thus not the distribution of the model as defined. The construction is likely repairable by replacing Φ(t−s) with Φ(t−s−1) throughout Lemma 2, Theorem 1, Theorem 2, and Eq. (10), which would make the M/M/∞ reduction match Eq. (18), but as submitted the central claim is unsupported.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an effective-Markovian-dynamics method for the discrete-time D-BMAP/G/∞ queue. It defines a horizon-dependent process N(s;t), the number of customers present at time s that will still be in service at time t, proves that (I(s),N(s;t)) is Markovian, and derives a product formula for the vector of state-dependent generating functions g(z,t). From this formula the paper obtains time-dependent distributions and factorial moments, specializes to discrete-time M/M/∞, compares with the continuous-time M/M/∞ queue, and reports stochastic simulation verification.","tokens_in":9981,"tokens_out":10911,"duration_ms":107340,"significance":"If correct, the paper would provide a useful closed-form time-dependent generating function for a discrete-time infinite-server queue with batch Markovian arrivals and general service times, extending known results for Markovian special cases. The core idea of freezing a time horizon and conditioning on survival to that horizon is elegant, and the M/M/∞ specialization with its sub-Poissonian Fano factor is a nice observation. However, the central product formula contains an off-by-one index error that contradicts the model definition in Section 2 and the paper's own Markovian recursion in Section 5. As submitted, the announced exact distribution is not the distribution of the model as defined.","major_comments":[{"comment":"Eq. (6) uses Φ(t−s) for arrivals during the transition from s to s+1, but under Definition 1 a customer arriving in that transition arrives at time slot s+1 and is counted at time t iff Y > t−(s+1); the survival probability should be Φ(t−s−1). Theorem 2 and Eq. (10) inherit this shift, so Eq. (11) is not the generating function of the model defined in Section 2. The error is visible in the M/M/∞ case: Eq. (17) gives G(z,1)=1−pα+pαz and stationary mean pα/(1−α), whereas Definition 1 and the recursion in Eq. (18) give G(z,1)=1−p+pz, and Little's law gives mean p/(1−α). Replacing Φ(t−s) with Φ(t−s−1) in Eq. (6), Theorem 1, Eq. (10), Theorem 2, and the moment formulas (14) appears to repair the derivation.","section":"§3, Lemma 2 / §4, Theorem 2"},{"comment":"The claim that Eq. (18) 'finally yields' Eq. (17) is arithmetically false. Iterating Eq. (18) from G(z,0)=1 gives G(z,1)=1−p+pz and G(z,2)=(1−pα+pαz)(1−p+pz), while Eq. (17) gives G(z,1)=1−pα+pαz and G(z,2)=(1−pα+pαz)(1−pα²+pα²z); these differ for every 0<p<1 and 0<α<1. Thus the paper's own Markovian recursion contradicts the main theorem, and Section 5 cannot be used to validate it.","section":"§5, Eq. (18)"},{"comment":"The SSA description is ambiguous about the time slot assigned to arrivals in the transition from s to s+1. If they are assigned time s, the simulation is consistent with Eq. (11) but contradicts Definition 1; if they are assigned time s+1, it is consistent with Definition 1 but contradicts Eq. (11). Because the convention is never stated, the agreement in Fig. 2 cannot be interpreted as verification of the model defined in Section 2.","section":"Appendix A"}],"minor_comments":[{"comment":"There is a typo: 't+ s − 1. but' should read 't+ s − 1, but'; also clarify whether an arrival at 'time slot t' is first counted at the slot boundary t or during the interval (t−1,t].","section":"§2, Definition 1"},{"comment":"The phrase 'service time much be strictly larger' should read 'service time must be strictly larger'.","section":"§3, Lemma 2 proof"},{"comment":"The word 'evalutated' should be 'evaluated'.","section":"§4, Theorem 1 proof"},{"comment":"The text says inter-arrival and service times are non-negative integer-valued, but Definition 1 takes service times in {1,2,...}; please make the support conditions consistent.","section":"§2"},{"comment":"The notation D^{(l_i)} is used without definition; please state explicitly that it denotes the l_i-th derivative of the matrix generating function D(z).","section":"§4, Eq. (14)"}],"recommendation":"major_revision","confidential_remarks":"The off-by-one error is serious and invalidates the stated results, but it is localized and appears repairable by shifting the survival index throughout. I therefore recommend a major revision rather than rejection, provided the authors rederive all formulas with the corrected index, remove the false claim of consistency with Eq. (18), and specify the simulation's slot convention. The paper would also be strengthened by releasing simulation code, since no data or code is currently provided."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The headline is simple: the exact distribution claimed in Theorem 2 is not the distribution of the model as defined. The error is a one-step time-index slip, and the paper's own M/M/∞ example makes it visible. The effective-process construction is worth something, but this version does not support its central claim.\n\nWhat is genuinely useful here is the device N(s;t), the count at time s of customers who will still be in service at time t. Lemma 1's monotonicity and Lemma 2's Markov property are clean, and the PGF update in Theorem 1 is a neat way to aggregate batch arrivals. The derivation is self-contained, and the simulation section is explicit about how to generate trajectories.\n\nThe soft spot is not a subtle one. In Lemma 2, a batch arriving during the step from s to s+1 is assigned survival probability Φ(t−s). Under Definition 1, those customers arrive at time s+1 and are counted at time t exactly when their service time Y satisfies Y > t−(s+1), i.e. with probability Φ(t−s−1), with Φ(0)=1. The paper never states an alternative convention. The slip propagates through Theorem 1, Eq. (10), and Theorem 2. In the M/M/∞ reduction, iterating the paper's own Eq. (18) from G(z,0)=1 gives G(z,1)=1+p(z−1), whereas Theorem 2's Eq. (17) gives 1+pα(z−1). The text says (18) 'finally yields' (17), but those are different functions for every 0<α<1. At t=1, Definition 1 forces the mean to be p; Theorem 2 predicts pα. That is a direct internal contradiction, not a matter of interpretation.\n\nThe numerical verification in Fig. 2 should also be re-examined, since the SSA described in Appendix A follows Definition 1 and therefore should not match Eq. (11) as written unless the implementation has the same off-by-one.\n\nThere is also a literature gap: no prior BMAP/G/∞ or M/G/∞ analytic work is cited, though the product-PGF form is the standard binomial-thinning structure. Even after the index fix, the novelty claim would need to be toned down.\n\nMy guess is the mistake is repairable: shift the survival index to Φ(t−s−1) in Lemma 2, Theorem 1, Eq. (10), and Theorem 2, and re-run the simulations. The intended result is probably true and would be a useful subfield tool. As submitted, though, the paper is not correct on its own terms. I would send it to a referee who can check the algebra and the conventions, with a clear instruction that the central identity must be verified before any acceptance; I would not desk-reject it, because the flaw is concrete and the fix is likely local. I would not cite it in its current form.","headline":"The central product-form formula has a one-step time-index slip and contradicts the paper's own M/M/∞ recursion; the effective-process idea is salvageable, but Theorem 2 is wrong as stated.","tokens_in":10487,"tokens_out":8185,"would_cite":false,"duration_ms":82099,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60K25","60J10","60E10"],"pacs":[],"model":"deepseek-v4-flash","headline":"By tracking customers who will still be in service at a fixed future time, the paper turns a non-Markovian discrete-time batch-arrival queue into a Markovian process and derives its exact time-dependent distribution.","keywords":["discrete-time queue","D-BMAP/G/∞","infinite-server queue","effective Markovian dynamics","probability generating function","time-dependent distribution","M/M/∞","Fano factor"],"falsifier":"Run the one-slot experiment: a single certain arrival ($p=1$), service time exactly one slot, empty system at time 0, and count customers present at slot 1. The paper's Section 2 counting rule includes the customer arriving in slot 1, giving $N(1)=1$; the product formula Eq. (17) with $\\alpha=0$ gives $G(z,1)=1$ and hence $N(1)=0$. That single calculation distinguishes the two slot conventions and determines whether the correct survival exponent is $\\Phi(t-s)$ or $\\Phi(t-s-1)$.","tokens_in":9399,"feed_emoji":"🧮","tokens_out":15086,"duration_ms":138561,"temperature":0.7,"pith_summary":"The paper derives the exact time-dependent distribution of the number of customers in a discrete-time infinite-server queue where arrivals follow a batch Markovian arrival process and service times follow any distribution (the D-BMAP/G/∞ model). It does this by defining an 'effective process' that counts, at each earlier time $s$, only the customers who will still be in service at the target time $t$; that process is Markovian even though the original queue is not. The generating functions of the effective process satisfy a one-step recursion whose iteration gives a closed matrix-product formula for the distribution at time $t$. From that formula the full probability distribution and all factorial moments follow by differentiation. The result matters because it covers correlated batch arrivals and arbitrary service laws exactly, and it turns the discrete-time M/M/∞ queue into a sum of independent Bernoulli trials whose variance-to-mean ratio is below 1.","feed_headline":"Infinite-server queues solved exactly in discrete time","feed_subtitle":"A matrix product over time slots gives the full customer-count distribution, with M/M/∞ as a simple special case.","key_machinery":"The load-bearing object is the effective process $N(s;t)$, the number of customers present at time $s$ who will remain in service at the later time $t$. For fixed $t$, the pair $(I(s),N(s;t))$ built from the background chain and this effective count is Markovian in $s$: each arriving customer is retained until $t$ independently with probability $\\Phi(t-s)$, the service-time survival probability. This Bernoulli-thinning fact converts the original non-Markovian queue into the vector recursion $g(z,s+1;t)=g(z,s;t)D(\\Phi(t-s)z+1-\\Phi(t-s))$, and iterating that recursion over $s=0,\\dots,t-1$ yields the matrix product in Theorem 2. The matrix argument $\\Phi(t-k)z+1-\\Phi(t-k)$ is the generating function of a thinned batch: an arriving batch of size $l$ contributes to the generating function with the factor $(\\Phi z+1-\\Phi)^l$.","core_discovery":"On the paper's own terms, the central discovery is Theorem 2: starting from an empty system, the vector of state-dependent generating functions at time $t$ is\n$$g(z,t)=p_0 \\prod_{k=0}^{t-1} D(\\Phi(t-k)z+1-\\Phi(t-k)),$$\nwhere $D$ is the matrix generating function of the D-BMAP and $\\Phi(t)=P(Y>t)$ is the service-time survival function. The probability $p_m(t)$ of $m$ customers is the coefficient of $z^m$ in $G(z,t)=g(z,t)\\mathbf{1}^T$, recovered as $(1/m!)G^{(m)}(0,t)$, and the $k$-th factorial moment is $G^{(k)}(1,t)$. For geometric service times with survival $\\alpha^t$ and Bernoulli arrivals with probability $p$, the product collapses to $G(z,t)=\\prod_{i=1}^t(1+p\\alpha^i(z-1))$, so the discrete-time M/M/∞ count is a sum of independent, non-identically distributed Bernoulli variables; the paper emphasizes that its Fano factor (variance-to-mean ratio) is always less than 1, unlike the Poisson count of continuous-time M/M/∞.","pith_inferences":["A natural extension the paper does not pursue: the same effective process should give joint distributions at several observation times, since the survival events for a fixed customer at multiple times are nested; covariance and autocorrelation of the count would then come from products of $D$ evaluated at products of survival probabilities.","In the small-slot limit, which the paper does not take, setting $p\\approx\\lambda\\Delta t$ and $\\alpha=1-\\mu\\Delta t$ sends $\\prod_{i=1}^t(1+p\\alpha^i(z-1))$ to $\\exp(\\lambda(1-e^{-\\mu T})(z-1)/\\mu)$, recovering the Poisson generating function of continuous-time M/M/∞ and making the Fano factor tend to 1.","The product form suggests a practical algorithm: with a truncated background chain, multiplying polynomial matrices in $z$ gives exact coefficients, so distributions at large $t$ could be computed by matrix-polynomial multiplication rather than Monte Carlo."],"forward_implications":["For any finite $t$, the exact distribution $p_m(t)$ can be computed directly from derivatives at $z=0$ of the matrix product, without simulation.","All factorial moments are available as derivatives at $z=1$; the paper writes the mean and variance explicitly in terms of $\\Phi$ and the arrival matrices.","The discrete-time M/M/∞ customer count is a sum of independent but non-identically distributed Bernoulli trials, and its Fano factor is below 1 at every time $t$.","Letting $t\\to\\infty$ in the product gives the stationary customer-number distribution for correlated batch arrivals.","Because only the survival function of the service time enters, the same formula covers any service-time law by substituting its $\\Phi$."],"supporting_citations":[{"why":"Defines the batch Markovian arrival process whose matrix generating function D(z) is the arrival model the paper works with.","marker":"[7]"},{"why":"Supplies the effective-Markovian-dynamics method used to turn the non-Markovian queue into a Markovian process.","marker":"[19]"},{"why":"Gives the Fano-factor/sub-Poissonian criterion used to interpret the discrete-time M/M/∞ result.","marker":"[20]"}],"fun_headline_variants":["Exact distribution for discrete-time infinite-server queues","Product formula solves discrete-time D-BMAP/G/∞ exactly","Discrete-time M/M/∞ count: independent non-identical Bernoullis","Fano factor below 1 for discrete-time infinite-server queue","Matrix product yields exact distribution for discrete-time infinite-server queue"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire construction rests on the Lemma 2 transition probability, which assumes a customer arriving at slot $s$ is still counted at the target time $t$ exactly when its service time is strictly larger than $t-s$, and the paper never states how that convention relates to its own rule that arrivals at slot $t$ are counted at slot $t$.","fun_headline_variants_meta":{"raw":{"variants":["Exact distribution for discrete-time infinite-server queues","Product formula solves discrete-time D-BMAP/G/∞ exactly","Discrete-time M/M/∞ count: independent non-identical Bernoullis","Fano factor below 1 for discrete-time infinite-server queue","Matrix product yields exact distribution for discrete-time infinite-server queue"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001281,"raw_usage":{"total_tokens":5201,"prompt_tokens":874,"completion_tokens":4327,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":490,"completion_tokens_details":{"reasoning_tokens":4240}},"tokens_in":490,"tokens_out":4327,"duration_ms":30128,"temperature":1.0,"reasoning_tokens":4240,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T12:53:10.705898+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the one-slot experiment: a single certain arrival ($p=1$), service time exactly one slot, empty system at time 0, and count customers present at slot 1. The paper's Section 2 counting rule includes the customer arriving in slot 1, giving $N(1)=1$; the product formula Eq. (17) with $\\alpha=0$ gives $G(z,1)=1$ and hence $N(1)=0$. That single calculation distinguishes the two slot conventions and determines whether the correct survival exponent is $\\Phi(t-s)$ or $\\Phi(t-s-1)$.","supporting_citations":[{"cited_title":"Communications in Statistics","cited_arxiv_id":null,"evidence_quote":"Defines the batch Markovian arrival process whose matrix generating function D(z) is the arrival model the paper works with."},{"cited_title":"bioRxiv, 2024–12 (2024)","cited_arxiv_id":null,"evidence_quote":"Supplies the effective-Markovian-dynamics method used to turn the non-Markovian queue into a Markovian process."},{"cited_title":"Journal of The Royal Society Interface 20(208), 20230467 (2023) 15","cited_arxiv_id":null,"evidence_quote":"Gives the Fano-factor/sub-Poissonian criterion used to interpret the discrete-time M/M/∞ result."}],"review_version":1}