{
  "annotation_id": "4b23decd-c360-491a-9eed-9581e44482e5",
  "date_created": "2026-02-17T05:53:20.513000Z",
  "date_modified": "2026-02-17T05:53:20.513000Z",
  "file_hash": "dd688bbcba5be93c8f1a89f9317a1507d9aa13ebb76910e2c40c873b29db0066",
  "private": false,
  "record": {
    "abstract": "The time to first crossing for the Poisson counting process with respect to a linear moving barrier with offset is a classic problem, although key results remain scattered across the literature and their equivalence is often unclear. Here we present a unified and pedagogical treatment of two approaches: the direct time-domain approach based on path-decomposition techniques and the Laplace-domain approach based on the Pollaczek-Spitzer formula. Beyond streamlining existing derivations and establishing their consistency, we leverage the complementary nature of the two methods to obtain new exact analytical results. Specifically, we derive an explicit large deviation function for the first-passage time distribution in the subcritical regime and closed-form expressions for the conditional mean first-passage time for arbitrary offset. Despite its simplicity, this first crossing process exhibits non-trivial critical behavior and provides a rare example where all the main results of interest can be derived exactly.",
    "arxiv_id": "2601.09296",
    "authors": [
      "Ivan Burenev",
      "Michael J. Kearney",
      "Satya N. Majumdar"
    ],
    "categories": [
      "cond-mat.stat-mech",
      "math-ph",
      "math.MP",
      "math.PR"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "A first passage problem for a Poisson counting process with a linear moving boundary",
    "url": "https://arxiv.org/abs/2601.09296",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5e761bff-36ef-442e-8c6a-1d69f2ba9b84",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}