{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SAQP5UFCLFWJOMQROQVYOPW5XY","short_pith_number":"pith:SAQP5UFC","schema_version":"1.0","canonical_sha256":"9020fed0a2596c973211742b873eddbe292b4a521e66f1fe1831894b577a1e76","source":{"kind":"arxiv","id":"1801.04674","version":1},"attestation_state":"computed","paper":{"title":"Approximation of Excessive Backlog Probabilities of Two Tandem Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ali Devin Sezer","submitted_at":"2018-01-15T06:25:50Z","abstract_excerpt":"Let $X$ be the constrained random walk on ${\\mathbb Z}_+^2$ taking the steps $(1,0)$, $(-1,1)$ and $(0,-1)$ with probabilities $\\lambda < (\\mu_1\\neq \\mu_2)$; in particular, $X$ is assumed stable. Let $\\tau_n$ be the first time $X$ hits $\\partial A_n = \\{x:x(1)+x(2) = n \\}$ For $x \\in {\\mathbb Z}_+^2, x(1) + x(2) < n$, the probability $p_n(x)= P_x( \\tau_n < \\tau_0)$ is a key performance measure for the queueing system represented by $X$. Let $Y$ be the constrained random walk on ${\\mathbb Z} \\times {\\mathbb Z}_+$ with increments $(-1,0)$, $(1,1)$ and $(0,-1)$. Let $\\tau$ be the first time that "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.04674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-15T06:25:50Z","cross_cats_sorted":[],"title_canon_sha256":"9d8ff527bde6bb85dfc225c4640c3caf3b3edfbe8e49cdb01ce3ed8be484887b","abstract_canon_sha256":"f2a9c9e3e302485693d0ad7a1c4371771d85e4deb92a5740ba6163bb1694accd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.610045Z","signature_b64":"/C2eBc8n9sn7z6e93azyjfuTDVxEG1oZhRjRHa1OJqfm78owEpidMJV2qcgqpRQZXXMp9Jn3U3uOStnWfwEYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9020fed0a2596c973211742b873eddbe292b4a521e66f1fe1831894b577a1e76","last_reissued_at":"2026-05-18T00:26:03.609310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.609310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation of Excessive Backlog Probabilities of Two Tandem Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ali Devin Sezer","submitted_at":"2018-01-15T06:25:50Z","abstract_excerpt":"Let $X$ be the constrained random walk on ${\\mathbb Z}_+^2$ taking the steps $(1,0)$, $(-1,1)$ and $(0,-1)$ with probabilities $\\lambda < (\\mu_1\\neq \\mu_2)$; in particular, $X$ is assumed stable. Let $\\tau_n$ be the first time $X$ hits $\\partial A_n = \\{x:x(1)+x(2) = n \\}$ For $x \\in {\\mathbb Z}_+^2, x(1) + x(2) < n$, the probability $p_n(x)= P_x( \\tau_n < \\tau_0)$ is a key performance measure for the queueing system represented by $X$. Let $Y$ be the constrained random walk on ${\\mathbb Z} \\times {\\mathbb Z}_+$ with increments $(-1,0)$, $(1,1)$ and $(0,-1)$. Let $\\tau$ be the first time that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04674","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.04674","created_at":"2026-05-18T00:26:03.609450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04674v1","created_at":"2026-05-18T00:26:03.609450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04674","created_at":"2026-05-18T00:26:03.609450+00:00"},{"alias_kind":"pith_short_12","alias_value":"SAQP5UFCLFWJ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SAQP5UFCLFWJOMQR","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SAQP5UFC","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY","json":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY.json","graph_json":"https://pith.science/api/pith-number/SAQP5UFCLFWJOMQROQVYOPW5XY/graph.json","events_json":"https://pith.science/api/pith-number/SAQP5UFCLFWJOMQROQVYOPW5XY/events.json","paper":"https://pith.science/paper/SAQP5UFC"},"agent_actions":{"view_html":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY","download_json":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY.json","view_paper":"https://pith.science/paper/SAQP5UFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04674&json=true","fetch_graph":"https://pith.science/api/pith-number/SAQP5UFCLFWJOMQROQVYOPW5XY/graph.json","fetch_events":"https://pith.science/api/pith-number/SAQP5UFCLFWJOMQROQVYOPW5XY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/action/storage_attestation","attest_author":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/action/author_attestation","sign_citation":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/action/citation_signature","submit_replication":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/action/replication_record"}},"created_at":"2026-05-18T00:26:03.609450+00:00","updated_at":"2026-05-18T00:26:03.609450+00:00"}