{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SAQP5UFCLFWJOMQROQVYOPW5XY","short_pith_number":"pith:SAQP5UFC","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"},"canonical_sha256":"9020fed0a2596c973211742b873eddbe292b4a521e66f1fe1831894b577a1e76","source":{"kind":"arxiv","id":"1801.04674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04674","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04674v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04674","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"SAQP5UFCLFWJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SAQP5UFCLFWJOMQR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SAQP5UFC","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SAQP5UFCLFWJOMQROQVYOPW5XY","target":"record","payload":{"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"},"canonical_sha256":"9020fed0a2596c973211742b873eddbe292b4a521e66f1fe1831894b577a1e76","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"},"source_kind":"arxiv","source_id":"1801.04674","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0V/gtQaidqggnoZeZH/I9jtYvLW+TwPSCjnPvQ/SAMx5hEpiwMX+nq7p48kmLTrDcSBcum4KOF4z7hCnyPrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:32:51.626059Z"},"content_sha256":"c32715ed847edfeb11447210b37cfce65fdf6a85c2d026f5215cc3ce2e2adc2c","schema_version":"1.0","event_id":"sha256:c32715ed847edfeb11447210b37cfce65fdf6a85c2d026f5215cc3ce2e2adc2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SAQP5UFCLFWJOMQROQVYOPW5XY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyFCVZfL90x0tDJMcIzxFmc+XRiap6LFY4BMxD2nG9iT0wG/tJ75mIP2tK9adk+CHkzoCBBpbUBdYR7GLIM2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:32:51.626429Z"},"content_sha256":"48a241f5daf9ecfeb05fb33ae384d420dba2e05a0b77685ea9ed5eae2d5bb4f7","schema_version":"1.0","event_id":"sha256:48a241f5daf9ecfeb05fb33ae384d420dba2e05a0b77685ea9ed5eae2d5bb4f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/bundle.json","state_url":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T02:32:51Z","links":{"resolver":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY","bundle":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/bundle.json","state":"https://pith.science/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAQP5UFCLFWJOMQROQVYOPW5XY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SAQP5UFCLFWJOMQROQVYOPW5XY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f2a9c9e3e302485693d0ad7a1c4371771d85e4deb92a5740ba6163bb1694accd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-15T06:25:50Z","title_canon_sha256":"9d8ff527bde6bb85dfc225c4640c3caf3b3edfbe8e49cdb01ce3ed8be484887b"},"schema_version":"1.0","source":{"id":"1801.04674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04674","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04674v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04674","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"SAQP5UFCLFWJ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SAQP5UFCLFWJOMQR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SAQP5UFC","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:48a241f5daf9ecfeb05fb33ae384d420dba2e05a0b77685ea9ed5eae2d5bb4f7","target":"graph","created_at":"2026-05-18T00:26:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Ali Devin Sezer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-15T06:25:50Z","title":"Approximation of Excessive Backlog Probabilities of Two Tandem Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04674","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c32715ed847edfeb11447210b37cfce65fdf6a85c2d026f5215cc3ce2e2adc2c","target":"record","created_at":"2026-05-18T00:26:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f2a9c9e3e302485693d0ad7a1c4371771d85e4deb92a5740ba6163bb1694accd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-15T06:25:50Z","title_canon_sha256":"9d8ff527bde6bb85dfc225c4640c3caf3b3edfbe8e49cdb01ce3ed8be484887b"},"schema_version":"1.0","source":{"id":"1801.04674","kind":"arxiv","version":1}},"canonical_sha256":"9020fed0a2596c973211742b873eddbe292b4a521e66f1fe1831894b577a1e76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9020fed0a2596c973211742b873eddbe292b4a521e66f1fe1831894b577a1e76","first_computed_at":"2026-05-18T00:26:03.609310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:03.609310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/C2eBc8n9sn7z6e93azyjfuTDVxEG1oZhRjRHa1OJqfm78owEpidMJV2qcgqpRQZXXMp9Jn3U3uOStnWfwEYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:03.610045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c32715ed847edfeb11447210b37cfce65fdf6a85c2d026f5215cc3ce2e2adc2c","sha256:48a241f5daf9ecfeb05fb33ae384d420dba2e05a0b77685ea9ed5eae2d5bb4f7"],"state_sha256":"388f414cbf8f0531bbc73e3efb5cd7e36573a9b8b303c127b1dc7f9e43f28e7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9GTM2GjzPd/72hmxuonYGRoy3zg/07YLrCJCRRqAN7YtyOl7GfrdGu8SrA3Qei187QpH1q3KenfN5Yq/wVFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:32:51.628412Z","bundle_sha256":"57873f3fa630450c75d2d390ffb1d7382f927ee636571144b597621995a5da1d"}}