{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DHHXTGOMDATCNQZZCNOXVX2ULT","short_pith_number":"pith:DHHXTGOM","schema_version":"1.0","canonical_sha256":"19cf7999cc182626c339135d7adf545cda4e907be05d25110b7898d0c12796b3","source":{"kind":"arxiv","id":"1806.00686","version":1},"attestation_state":"computed","paper":{"title":"Excessive Backlog Probabilities of Two Parallel Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ali Devin Sezer, Kamil Demirberk \\\"Unl\\\"u","submitted_at":"2018-06-02T18:49:31Z","abstract_excerpt":"Let $X$ be the constrained random walk on ${\\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and interarrival times are exponentially distributed with arrival rates $\\lambda_i$ and service rates $\\mu_i$, $i=1,2$; we assume $\\lambda_i < \\mu_i$, $i=1,2$, i.e., $X$ is assumed stable. Without loss of generality we assume $\\rho_1 =\\lambda_1/\\mu_1 \\ge \\rho_2 = \\lambda_2/\\mu_2$. Let $\\tau_n$ be the first time $X$ hits the line $\\partial A_n = \\{x \\in {\\mathbb Z}^2:x"},"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":"1806.00686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-02T18:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"d0bd7e9da82ca3c93db398f86bf8919fcd6ff994656b063e45690c37310febf9","abstract_canon_sha256":"9c97590820e011c8e1fab57d9eba14ea1fe0c5a37a7a46c4034df2395956aec9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.738762Z","signature_b64":"dSzZYPd0BPZ0oEdwgW5bgsCQo1ZpzaTpxD7FFPnEQPvKbAAsCj9Yk+mfPK6o01lS0maBlcRn7EoyEN/qyH5yAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19cf7999cc182626c339135d7adf545cda4e907be05d25110b7898d0c12796b3","last_reissued_at":"2026-05-18T00:14:18.738287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.738287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Excessive Backlog Probabilities of Two Parallel Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ali Devin Sezer, Kamil Demirberk \\\"Unl\\\"u","submitted_at":"2018-06-02T18:49:31Z","abstract_excerpt":"Let $X$ be the constrained random walk on ${\\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and interarrival times are exponentially distributed with arrival rates $\\lambda_i$ and service rates $\\mu_i$, $i=1,2$; we assume $\\lambda_i < \\mu_i$, $i=1,2$, i.e., $X$ is assumed stable. Without loss of generality we assume $\\rho_1 =\\lambda_1/\\mu_1 \\ge \\rho_2 = \\lambda_2/\\mu_2$. Let $\\tau_n$ be the first time $X$ hits the line $\\partial A_n = \\{x \\in {\\mathbb Z}^2:x"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00686","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":"1806.00686","created_at":"2026-05-18T00:14:18.738368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00686v1","created_at":"2026-05-18T00:14:18.738368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00686","created_at":"2026-05-18T00:14:18.738368+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHHXTGOMDATC","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHHXTGOMDATCNQZZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHHXTGOM","created_at":"2026-05-18T12:32:19.392346+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/DHHXTGOMDATCNQZZCNOXVX2ULT","json":"https://pith.science/pith/DHHXTGOMDATCNQZZCNOXVX2ULT.json","graph_json":"https://pith.science/api/pith-number/DHHXTGOMDATCNQZZCNOXVX2ULT/graph.json","events_json":"https://pith.science/api/pith-number/DHHXTGOMDATCNQZZCNOXVX2ULT/events.json","paper":"https://pith.science/paper/DHHXTGOM"},"agent_actions":{"view_html":"https://pith.science/pith/DHHXTGOMDATCNQZZCNOXVX2ULT","download_json":"https://pith.science/pith/DHHXTGOMDATCNQZZCNOXVX2ULT.json","view_paper":"https://pith.science/paper/DHHXTGOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00686&json=true","fetch_graph":"https://pith.science/api/pith-number/DHHXTGOMDATCNQZZCNOXVX2ULT/graph.json","fetch_events":"https://pith.science/api/pith-number/DHHXTGOMDATCNQZZCNOXVX2ULT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHHXTGOMDATCNQZZCNOXVX2ULT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHHXTGOMDATCNQZZCNOXVX2ULT/action/storage_attestation","attest_author":"https://pith.science/pith/DHHXTGOMDATCNQZZCNOXVX2ULT/action/author_attestation","sign_citation":"https://pith.science/pith/DHHXTGOMDATCNQZZCNOXVX2ULT/action/citation_signature","submit_replication":"https://pith.science/pith/DHHXTGOMDATCNQZZCNOXVX2ULT/action/replication_record"}},"created_at":"2026-05-18T00:14:18.738368+00:00","updated_at":"2026-05-18T00:14:18.738368+00:00"}