Pith. Sign in

RECORD

Khintchine-Pollaczek formula for random walks whose steps have one geometric tail

Probability · Submitted 3 Oct 2011

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We derive a Khinchine-Pollaczek formula for random walks whose steps have a geometric left tail.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1110.0262 (version 3)
Pith ID45VHPGVG, Pith's permanent record of this paper and its review
CitationRobert O. Bauer. "Khintchine-Pollaczek formula for random walks whose steps have one geometric tail." arXiv:1110.0262 (2011). https://pith.science/paper/45VHPGVG
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,816 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.11 · human participants 0.03 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.06 · compares with prior results 0.05 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; .

We derive a Khinchine-Pollaczek formula for random walks whose steps have a geometric left tail. The construction rests on the memory-less property of the geometric distribution. An example from a tandem queue modeling dynamic instability in microtubules is given.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We derive a Khinchine-Pollaczek formula for random walks whose steps have a geometric left tail. contribution 0.89 0.96 0.88 asserted 1.00
s1 The construction rests on the memory-less property of the geometric distribution. method 1.00 0.43 0.05 asserted 1.00
s2 An example from a tandem queue modeling dynamic instability in microtubules is given. contribution 0.88 0.84 0.05 asserted 0.99

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v3
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We derive a Khinchine-Pollaczek formula for random walks whose steps have a geometric left tail. The construction rests on the memory-less property of the geometric distribution. An example from a tandem queue modeling dynamic instability in microtubules is given.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.