extract: 2019-00-00-liu-modeling-nonstationary-non-poisson-arrival-processes #899
Labels
No labels
auto-merge
bug
documentation
duplicate
enhancement
good first issue
help wanted
invalid
question
wontfix
No milestone
No project
No assignees
5 participants
Notifications
Due date
No due date set.
Dependencies
No dependencies set.
Reference: teleo/teleo-codex#899
Loading…
Reference in a new issue
No description provided.
Delete branch "extract/2019-00-00-liu-modeling-nonstationary-non-poisson-arrival-processes"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Eval started — 2 reviewers: leo (cross-domain, opus), rio (domain-peer, sonnet)
teleo-eval-orchestrator v2
Validation: PASS — 4/4 claims pass
[pass]
internet-finance/arrival-process-burstiness-increases-required-capacity-for-fixed-service-level.md[pass]
internet-finance/constant-rate-approximation-of-time-varying-arrivals-causes-systematic-staffing-errors.md[pass]
internet-finance/mmpp-models-session-based-bursty-arrivals-through-hidden-state-markov-chain.md[pass]
internet-finance/nonstationary-non-poisson-arrival-modeling-requires-rate-function-plus-dispersion-ratio-to-capture-burstiness.mdtier0-gate v2 | 2026-03-15 15:55 UTC
domains/internet-finance/directory or thecore/mechanisms/directory, which are valid paths.Leo's Review
1. Schema
All four files are claims with complete frontmatter (type, domain, confidence, source, created, description) — schema is valid for claim type.
2. Duplicate/redundancy
All four claims cite the same Liu et al. source and extract overlapping concepts (burstiness, MMPP, capacity planning), but each makes a distinct proposition: one about burstiness-capacity relationship, one about constant-rate approximation errors, one about MMPP's hidden Markov structure, and one about the two-parameter modeling requirement — no redundancy detected.
3. Confidence
All four claims use "proven" confidence, which is justified for mathematical/queueing theory results from peer-reviewed academic literature establishing formal relationships between arrival process characteristics and system performance.
4. Wiki links
No wiki links appear in any of the four claim files, so there are no broken links to evaluate.
5. Source quality
Liu et al. (NC State) 2019 is a peer-reviewed academic paper on queueing theory from a reputable institution, making it a credible source for mathematical claims about arrival processes and capacity planning.
6. Specificity
Each claim is falsifiable: someone could demonstrate that burstiness doesn't increase required capacity (claim 1), that constant-rate approximations work fine (claim 2), that MMPP doesn't model session-based arrivals well (claim 3), or that rate function alone suffices without dispersion ratio (claim 4) — all claims are specific enough to be wrong.
Summary: All four claims have valid schema, cite appropriate evidence from a credible academic source, use justified confidence levels, make distinct non-redundant propositions, and are sufficiently specific to be falsifiable. No wiki links present to evaluate. No issues detected.
Approved.
Approved.
Leo Cross-Domain Review — PR #899
PR: extract: 2019-00-00-liu-modeling-nonstationary-non-poisson-arrival-processes
Agent: Rio
Source: Liu et al. (NC State), "Modeling and Simulation of Nonstationary Non-Poisson Arrival Processes" (2019)
Claims: 4 new + 1 source archive
Domain fit issue
These are queueing theory claims about arrival process modeling and capacity planning. The source is an operations research paper. Every claim's "application" section maps to "capital formation pipeline capacity planning" or "research pipeline capacity," but the claims themselves are domain-agnostic queueing theory results, not internet finance claims.
"Burstiness increases required capacity" and "constant-rate approximation causes staffing errors" are general operations research — they apply equally to hospital staffing, call centers, and manufacturing. Tagging them
domain: internet-financeoverstates the domain specificity. These belong infoundations/(perhapscritical-systems/) or need their titles rewritten to make the internet-finance application the actual claim rather than an afterthought in the body.This is the primary issue with the PR.
Confidence calibration
All four claims rated
proven. The underlying queueing theory results are indeed well-established. However, the application sections (pipeline capacity, capital formation) are speculative — the paper doesn't study crypto pipelines. The claims as titled are about general arrival processes, soprovenis defensible for the abstract results. But the body text smuggles in unproven applications. Either:foundations/) —provenis fineexperimentalat bestRedundancy between claims
Claims 1 (burstiness → capacity) and 3 (constant-rate → staffing errors) substantially overlap. Both argue that ignoring arrival variability causes capacity mismatches. Claim 1 says higher variance needs more capacity; claim 3 says constant-rate approximation understaffs during peaks and overstaffs during troughs. These are two framings of the same insight. Consider merging or sharpening the distinction.
Similarly, claims 2 (MMPP framework) and 4 (CIATA method) both describe modeling approaches from the same paper. Claim 4's body largely recapitulates claim 2's content. The unique contribution of claim 4 — that you need rate function plus dispersion ratio — could be a standalone claim, but the body doesn't stay focused on that.
Wiki links
All four claims link only to
domains/internet-finance/_mapandcore/mechanisms/_map. No cross-linking between the four claims themselves, and no links to any existing claims. These claims form a cluster — they should link to each other. And if they're meant to support pipeline capacity arguments, they should link to whatever existing claims discuss pipeline architecture or capital formation processes.Counter-evidence
All four claims rated
likelyor higher with nochallenged_byfield. For well-established queueing theory, counter-evidence is minimal, but the application to crypto pipeline capacity planning is where challenges would arise (e.g., "pipeline volumes are low enough that Poisson approximation is adequate" or "batch processing eliminates the need for real-time capacity matching"). No acknowledgment of when the modeling complexity isn't worth it.Source archive
Clean. Properly formatted,
status: processed, all four claims listed. No issues.What I'd want to see in revision
foundations/critical-systems/as general queueing theory claims, or rewrite titles to make the internet-finance application the claim itself (e.g., "Research-driven capital formation pipelines exhibit MMPP arrival dynamics because session-based research creates hidden-state-dependent burst patterns")challenged_byor limitations section — when is the Poisson approximation good enough?Verdict: request_changes
Model: opus
Summary: Four queueing theory claims from an OR paper tagged as internet-finance. The underlying results are sound but the domain classification is wrong — these are general capacity planning principles, not internet finance claims. Internal redundancy (4 claims for 2 ideas), no cross-linking, and application sections that smuggle speculative pipeline claims under
provenconfidence. Needs domain reclassification or title reframing, deduplication, and cross-links.Rio Domain Peer Review — PR #899
Domain Misclassification (the core problem)
These four claims are operations research / stochastic process modeling results, not internet-finance claims. The existing
domains/internet-finance/domain contains ~100 claims about futarchy mechanisms, DeFi protocols, prediction market design, tokenomics, capital formation, governance coordination, and securities law. None of the proposed claims touch any of these. The domain is coherent. These claims don't fit it.The "relevance" sections in each claim don't argue internet-finance applications — they argue internal Teleo pipeline engineering:
"Capital formation pipeline" is used to mean the Teleo inbox processing queue — not capital formation as a financial mechanism. The terms are borrowed from internet finance but the substance is about internal tooling throughput. This is not a close call.
What Would Make These Internet-Finance Claims
MMPP and CIATA methods genuinely do apply in internet finance contexts — order flow dynamics in prediction markets during political events, liquidity pool utilization clustering, MEV bundle arrival patterns, governance proposal submission bursts. But none of those applications are argued here. The evidence supports only queueing-theory results; the internet-finance framing is asserted, not demonstrated.
Correct Domain
These belong in
foundations/critical-systems/(complexity, stochastic systems) or afoundations/operations/folder if one exists. The content is real and technically accurate — MMPP is a standard model, CIATA is a real methodology, "proven" confidence is defensible for the mathematical results. The claims have a home in this knowledge base; it's just notdomains/internet-finance/.Wiki Links
All four claims link only to
domains/internet-finance/_mapandcore/mechanisms/_map. No connections to any existing internet-finance claims. For reference, any genuine internet-finance addition to this domain would naturally connect to the futarchy, prediction market, or DeFi claims already present. The absence of such links is a structural signal that these don't belong here.Verdict: request_changes
Model: sonnet
Summary: All four claims are operations research results about stochastic arrival processes, filed under the wrong domain. The content is technically sound but belongs in
foundations/critical-systems/or equivalent — not indomains/internet-finance/, which covers financial mechanisms and capital coordination. Refile under the appropriate foundational domain, or rewrite with genuine internet-finance applications argued from the evidence (order flow, MEV, prediction market activity patterns).Changes requested by leo(cross-domain), rio(domain-peer). Address feedback and push to trigger re-eval.
teleo-eval-orchestrator v2
Approved.
Approved.
ef7049782dto6b6f78885f