Pith. sign in

REVIEW 3 major objections 2 minor

Scheduled arrivals with random unpunctuality obey a sample-path large deviations principle for their empirical counting mean, which yields overflow rates and the most likely tilted path for workload.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-15 04:18 UTC pith:3M3KD6PW

load-bearing objection Abstract-only: standard sample-path LDP for scheduled arrivals with i.i.d. unpunctuality plus workload transfer; mid-range queueing utility, cannot check proofs. the 3 major comments →

arxiv 2607.12666 v1 pith:3M3KD6PW submitted 2026-07-14 math.PR

Sample-path Large deviations for Scheduled Arrival Processes with Unpunctuality

Serena Della Corte , Michel Mandjes This is my paper
classification math.PR MSC 60F1060K2560G55
keywords sample-path large deviationsscheduled arrivalsunpunctualitycounting processworkload processSkorokhod topologyexponentially tilted pathqueueing
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies arrivals that are supposed to land at fixed scheduled times but are each shifted by an independent random unpunctuality offset. It proves that the empirical average of many independent copies of the resulting counting process satisfies a sample-path large deviations principle on the space of cadlag paths, under the Skorokhod topology. That path-level principle immediately supplies large-deviation rate functions for the workload process when service is either deterministic or random. In the deterministic-service case the same principle also identifies the exponentially tilted arrival path that is most likely to produce a rare workload overflow. A sympathetic reader cares because real appointment systems and scheduled networks routinely suffer from random early and late arrivals; the result supplies precise exponential decay rates and the typical way overflow occurs, rather than only mean-value approximations.

Core claim

For independent copies of a counting process generated by deterministic schedules perturbed by i.i.d. unpunctuality, the empirical mean process obeys a sample-path large deviations principle on D([0,T]) with the Skorokhod topology; the same principle yields large-deviation principles for the associated workload under deterministic and random service, and identifies the exponentially tilted arrival path that realises a rare workload overflow under deterministic service.

What carries the argument

The sample-path large deviations principle for the empirical mean of the unpunctual counting processes on D([0,T]) under the Skorokhod topology. This path-level LDP is the single object that is then mapped, by continuous or exponentially continuous functionals, onto workload overflow probabilities and onto the most likely arrival path.

Load-bearing premise

The unpunctuality offsets must be independent and identically distributed (and possess tails mild enough for a sample-path LDP of the counting process); dependence or heavier tails would break the claimed rate function.

What would settle it

Simulate many independent copies of the unpunctual counting process, compute the empirical mean path, and check whether the probability of paths lying outside a Skorokhod neighbourhood of a given limit decays at the exact exponential rate predicted by the paper's rate function; any systematic mismatch falsifies the LDP.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Workload overflow probabilities under both deterministic and random service admit explicit large-deviation rate functions obtained by continuous mapping from the arrival LDP.
  • Under deterministic service the most likely way a rare overflow occurs is by following a single, explicitly identified exponentially tilted arrival path.
  • Numerical or analytic evaluation of the rate function supplies exponential decay rates for overflow that can be used in capacity planning of scheduled systems.
  • The same path LDP can be applied to any continuous functional of the counting process, not only workload.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The result suggests that appointment systems and scheduled manufacturing lines can be dimensioned by computing the LDP rate rather than by simulation alone.
  • If unpunctuality distributions are estimated from data, the same rate function becomes a plug-in estimator of overflow risk that could be validated against historical rare events.
  • Extensions to weakly dependent unpunctuality or to multi-class scheduled streams would test how far the i.i.d. hypothesis can be relaxed while keeping a path LDP.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 2 minor

Summary. The manuscript studies a scheduled-arrival counting process in which deterministic arrival epochs are perturbed by i.i.d. unpunctuality random variables. For the empirical mean of independent copies of this process it claims a sample-path large deviations principle on D([0,T]) equipped with the Skorokhod topology. As applications it asserts large-deviation principles for the associated workload process under both deterministic and random service, and, in the deterministic-service case, identifies the exponentially tilted arrival path that realizes a rare workload overflow.

Significance. A sample-path LDP for scheduled arrivals with unpunctuality would be a natural and useful addition to the large-deviations literature on counting processes and fluid-scale rare events in queues, particularly for appointment-type traffic. The transfer to workload LDPs and the identification of the tilted overflow path are standard but practically relevant applications. The abstract’s program is internally consistent in form and does not exhibit circular fitting. Because only the abstract is available, however, the rate function, topology (J1 versus M1), moment/tail hypotheses, and proof architecture cannot be verified; significance therefore remains conditional on a correct and complete derivation.

major comments (3)
  1. Only the abstract is available for review. The central claim—a sample-path LDP on D([0,T]) with the Skorokhod topology for the empirical mean of the unpunctual scheduled counting process—cannot be checked for rate-function lower semicontinuity, good rate function properties, or the precise topology (J1/M1). These are load-bearing for the main theorem and for the subsequent workload transfers.
  2. The abstract does not state the moment or tail conditions imposed on the unpunctuality distribution. Sample-path LDPs for counting processes typically require exponential moments or comparable tail control; without an explicit hypothesis the domain of the claimed LDP and of the tilted overflow path remains unspecified and cannot be assessed.
  3. The transfer from the arrival-path LDP to workload LDPs under deterministic and random service, and the identification of the exponentially tilted path for overflow, are asserted without formulas or proof sketches. Continuity of the reflection map and the form of the rate function on the overflow set are load-bearing steps that cannot be verified from the abstract alone.
minor comments (2)
  1. The abstract should name the Skorokhod topology variant (J1 or M1) and give a one-line indication of the rate-function form (e.g., relative entropy or Legendre transform of a cumulant) so that the scope of the result is clear to readers.
  2. A brief statement of the unpunctuality moment assumptions in the abstract would help place the result relative to existing sample-path LDPs for renewal and non-renewal counting processes.

Circularity Check

0 steps flagged

No circularity detectable from abstract-only material; standard sample-path LDP derivation for i.i.d.-perturbed scheduled arrivals.

full rationale

Only the abstract is available. It states a classical program: prove a sample-path large-deviations principle on D([0,T]) with the Skorokhod topology for the empirical mean of independent copies of a counting process generated by deterministic schedules plus i.i.d. unpunctuality offsets, then obtain workload LDPs by contraction and identify the exponentially tilted path for a rare overflow under deterministic service. No free parameters are fitted to data and then re-presented as predictions; no uniqueness theorem or ansatz is imported from the authors' prior work; no known empirical pattern is merely renamed. The i.i.d. unpunctuality assumption and the usual moment/tail conditions required for sample-path LDPs of counting processes are ordinary modeling hypotheses, not circular reductions. With no equations, proofs, or self-citations to inspect, no step can be exhibited that reduces a claimed prediction to its own inputs by construction. Score 0 is therefore the honest finding under the hard rules (no speculation, quote-required evidence only).

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

Abstract-only pure-probability paper. No numerical free parameters are fitted. The model rests on standard probability axioms plus the domain modeling choice that unpunctuality is i.i.d. and that the path space is D([0,T]) with Skorokhod topology. No new physical entities are invented. Full technical assumptions (moments, continuity of rate function, service-law conditions) are not visible in the abstract and would appear in the full paper.

axioms (3)
  • domain assumption Unpunctuality random variables are i.i.d. and satisfy the (unstated) regularity needed for a sample-path LDP of the counting process.
    Stated in the opening model sentence of the abstract; load-bearing for the empirical-mean LDP.
  • standard math Path space is D([0,T]) equipped with the Skorokhod topology; standard large-deviations tools (e.g. contraction) apply.
    Explicitly named in the abstract as the setting of the LDP.
  • domain assumption Service is either deterministic or random with laws that allow transfer of the arrival LDP to the workload process.
    Required for the workload application stated in the abstract; precise conditions not given.

pith-pipeline@v1.1.0-grok45 · 5977 in / 2360 out tokens · 22745 ms · 2026-07-15T04:18:00.335523+00:00 · methodology

0 comments
read the original abstract

We study a scheduled-arrival process in which deterministic arrival times are perturbed by i.i.d. unpunctuality random variables. For the empirical mean of independent copies of the resulting counting process, we prove a sample-path large deviations principle on $D([0,T])$, equipped with the Skorokhod topology. As an application, we derive large deviation principles for the corresponding workload process under deterministic and random service setting. In the deterministic service case, we also identify the exponentially tilted arrival path associated with a rare workload overflow event.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.