{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FL6KVL5XSKRWWLRDUTLFWQBRM2","short_pith_number":"pith:FL6KVL5X","schema_version":"1.0","canonical_sha256":"2afcaaafb792a36b2e23a4d65b403166ab1a6af0d3a278e45d02e3d8a7c495fa","source":{"kind":"arxiv","id":"1503.05899","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.05899","created_at":"2026-05-18T01:30:34.737558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05899v3","created_at":"2026-05-18T01:30:34.737558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05899","created_at":"2026-05-18T01:30:34.737558+00:00"},{"alias_kind":"pith_short_12","alias_value":"FL6KVL5XSKRW","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FL6KVL5XSKRWWLRD","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FL6KVL5X","created_at":"2026-05-18T12:29:19.899920+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/FL6KVL5XSKRWWLRDUTLFWQBRM2","json":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2.json","graph_json":"https://pith.science/api/pith-number/FL6KVL5XSKRWWLRDUTLFWQBRM2/graph.json","events_json":"https://pith.science/api/pith-number/FL6KVL5XSKRWWLRDUTLFWQBRM2/events.json","paper":"https://pith.science/paper/FL6KVL5X"},"agent_actions":{"view_html":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2","download_json":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2.json","view_paper":"https://pith.science/paper/FL6KVL5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05899&json=true","fetch_graph":"https://pith.science/api/pith-number/FL6KVL5XSKRWWLRDUTLFWQBRM2/graph.json","fetch_events":"https://pith.science/api/pith-number/FL6KVL5XSKRWWLRDUTLFWQBRM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/action/storage_attestation","attest_author":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/action/author_attestation","sign_citation":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/action/citation_signature","submit_replication":"https://pith.science/pith/FL6KVL5XSKRWWLRDUTLFWQBRM2/action/replication_record"}},"created_at":"2026-05-18T01:30:34.737558+00:00","updated_at":"2026-05-18T01:30:34.737558+00:00"}