{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FL6KVL5XSKRWWLRDUTLFWQBRM2","short_pith_number":"pith:FL6KVL5X","canonical_record":{"source":{"id":"1503.05899","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-19T19:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"ca46e9b52c9fa5dd55c81ff19388df160513fc2c36550de283f330668248dd68","abstract_canon_sha256":"8d4b2762031d8e9644ccbd9a90d0a685f9050f9442e67bb04772630f873009cb"},"schema_version":"1.0"},"canonical_sha256":"2afcaaafb792a36b2e23a4d65b403166ab1a6af0d3a278e45d02e3d8a7c495fa","source":{"kind":"arxiv","id":"1503.05899","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05899","created_at":"2026-05-18T01:30:34Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05899v3","created_at":"2026-05-18T01:30:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05899","created_at":"2026-05-18T01:30:34Z"},{"alias_kind":"pith_short_12","alias_value":"FL6KVL5XSKRW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FL6KVL5XSKRWWLRD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FL6KVL5X","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FL6KVL5XSKRWWLRDUTLFWQBRM2","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05899","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-19T19:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"ca46e9b52c9fa5dd55c81ff19388df160513fc2c36550de283f330668248dd68","abstract_canon_sha256":"8d4b2762031d8e9644ccbd9a90d0a685f9050f9442e67bb04772630f873009cb"},"schema_version":"1.0"},"canonical_sha256":"2afcaaafb792a36b2e23a4d65b403166ab1a6af0d3a278e45d02e3d8a7c495fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:34.738143Z","signature_b64":"GxlSCgFJ3+zyYFFnvp0fnUrAjiyz67bMy/nHCJoQZSmt5pKE7+a2KcQAf2G6/FAUUW8ItWSc9JODhTAE7lofDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2afcaaafb792a36b2e23a4d65b403166ab1a6af0d3a278e45d02e3d8a7c495fa","last_reissued_at":"2026-05-18T01:30:34.737447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:34.737447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05899","source_version":3,"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-18T01:30:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHDpUZyrSnDSypyuMXdEzK8dVJbkb0Nm+kQyRotb+7T+oxDLYZDO3Q4oCh6uy9j1nDnrlBiYKId2twS6QDOmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:09:55.609626Z"},"content_sha256":"2e8c62c3e1bcfe2662c155f617c1b5037c2fc7c87793da1fccac40d85af5e785","schema_version":"1.0","event_id":"sha256:2e8c62c3e1bcfe2662c155f617c1b5037c2fc7c87793da1fccac40d85af5e785"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FL6KVL5XSKRWWLRDUTLFWQBRM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clearing Analysis on Phases: Exact Limiting Probabilities for Skip-free, Unidirectional, Quasi-birth-death Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Brian Fralix, Mor Harchol-Balter, Sherwin Doroudi","submitted_at":"2015-03-19T19:21:36Z","abstract_excerpt":"Many problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes (QBDs) with transitions that are skip-free in level, in that one can only transition between consecutive levels, and unidirectional in phase, in that one can only transition from lower-numbered phases to higher-numbered phases. We present a procedure, which we call Clearing Analysis on Phases (CAP), for determining the limiting probabilities of such Markov chains exact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05899","kind":"arxiv","version":3},"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-18T01:30:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2ih9myQ9G029VDkHixA4Mf7D6y5lTGixrl5j82gi5Fc338YQ3143LFVZN+QkkgIlwqG3jnWQ/dTrn55dQvaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:09:55.609969Z"},"content_sha256":"1b650281de8b329a0d03bb0cbbc105ce46d3cee999568cfeeff214b672640ebe","schema_version":"1.0","event_id":"sha256:1b650281de8b329a0d03bb0cbbc105ce46d3cee999568cfeeff214b672640ebe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/bundle.json","state_url":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/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-06-25T05:09:55Z","links":{"resolver":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2","bundle":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/bundle.json","state":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FL6KVL5XSKRWWLRDUTLFWQBRM2","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":"8d4b2762031d8e9644ccbd9a90d0a685f9050f9442e67bb04772630f873009cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-19T19:21:36Z","title_canon_sha256":"ca46e9b52c9fa5dd55c81ff19388df160513fc2c36550de283f330668248dd68"},"schema_version":"1.0","source":{"id":"1503.05899","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05899","created_at":"2026-05-18T01:30:34Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05899v3","created_at":"2026-05-18T01:30:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05899","created_at":"2026-05-18T01:30:34Z"},{"alias_kind":"pith_short_12","alias_value":"FL6KVL5XSKRW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FL6KVL5XSKRWWLRD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FL6KVL5X","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:1b650281de8b329a0d03bb0cbbc105ce46d3cee999568cfeeff214b672640ebe","target":"graph","created_at":"2026-05-18T01:30:34Z","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":"Many problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes (QBDs) with transitions that are skip-free in level, in that one can only transition between consecutive levels, and unidirectional in phase, in that one can only transition from lower-numbered phases to higher-numbered phases. We present a procedure, which we call Clearing Analysis on Phases (CAP), for determining the limiting probabilities of such Markov chains exact","authors_text":"Brian Fralix, Mor Harchol-Balter, Sherwin Doroudi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-19T19:21:36Z","title":"Clearing Analysis on Phases: Exact Limiting Probabilities for Skip-free, Unidirectional, Quasi-birth-death Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05899","kind":"arxiv","version":3},"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:2e8c62c3e1bcfe2662c155f617c1b5037c2fc7c87793da1fccac40d85af5e785","target":"record","created_at":"2026-05-18T01:30:34Z","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":"8d4b2762031d8e9644ccbd9a90d0a685f9050f9442e67bb04772630f873009cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-03-19T19:21:36Z","title_canon_sha256":"ca46e9b52c9fa5dd55c81ff19388df160513fc2c36550de283f330668248dd68"},"schema_version":"1.0","source":{"id":"1503.05899","kind":"arxiv","version":3}},"canonical_sha256":"2afcaaafb792a36b2e23a4d65b403166ab1a6af0d3a278e45d02e3d8a7c495fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2afcaaafb792a36b2e23a4d65b403166ab1a6af0d3a278e45d02e3d8a7c495fa","first_computed_at":"2026-05-18T01:30:34.737447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:34.737447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GxlSCgFJ3+zyYFFnvp0fnUrAjiyz67bMy/nHCJoQZSmt5pKE7+a2KcQAf2G6/FAUUW8ItWSc9JODhTAE7lofDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:34.738143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05899","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e8c62c3e1bcfe2662c155f617c1b5037c2fc7c87793da1fccac40d85af5e785","sha256:1b650281de8b329a0d03bb0cbbc105ce46d3cee999568cfeeff214b672640ebe"],"state_sha256":"355545e9221544850426aeb4c05aec4f72844824fb727a9f599fe88baf3fc7ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZYl8AUMXQRBFCc1aTQuYZeg2/lc53VtX0fUf/fy0Sl+eeVsQgHb4TdC2m0r3L3tqpPteJvSqUMpH8pJB8G1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:09:55.611853Z","bundle_sha256":"6e48ee1eede314388a1b2a62d237d4c986e7af545c992f48deb3b95a62e6f73d"}}