{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ETR5IYWJ3BXCYE3STOIXTGV6JF","short_pith_number":"pith:ETR5IYWJ","schema_version":"1.0","canonical_sha256":"24e3d462c9d86e2c13729b91799abe49431c607d41b1785e22c11a66b744e529","source":{"kind":"arxiv","id":"1411.3176","version":3},"attestation_state":"computed","paper":{"title":"Joint queue length distribution of multi-class, single server queues with preemptive priorities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andrei Sleptchenko, Geert-Jan van Houtum, Ivo Adan, Jori Selen","submitted_at":"2014-11-12T13:52:52Z","abstract_excerpt":"In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a multi-dimensional Markov process, where the coordinates keep track of the number of customers of each class in the system. Based on matrix-analytic techniques and probabilistic arguments we develop a recursive method for the exact determination of the equilibrium joint queue length distribution. The method is applied to a spare parts logistics problem to illustrate the"},"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":"1411.3176","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T13:52:52Z","cross_cats_sorted":[],"title_canon_sha256":"33638b1ee1a22b43f87f153e7e12c49b8814bbfeaa55fe0e9f49fbcd4d8e0251","abstract_canon_sha256":"fb54d608c912faa099604b381ffb6b22732c5beac17649fa2c3c06d2fc266161"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:08.061601Z","signature_b64":"EoiOlcvRQbLgBOz9RXmY8pkah+VzfWs0qMT1uvk2+rk8EEhFmr7Jz10HLkKdVPocwfC/0WbnKinZN5kc59WtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24e3d462c9d86e2c13729b91799abe49431c607d41b1785e22c11a66b744e529","last_reissued_at":"2026-05-18T01:27:08.060905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:08.060905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint queue length distribution of multi-class, single server queues with preemptive priorities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andrei Sleptchenko, Geert-Jan van Houtum, Ivo Adan, Jori Selen","submitted_at":"2014-11-12T13:52:52Z","abstract_excerpt":"In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a multi-dimensional Markov process, where the coordinates keep track of the number of customers of each class in the system. Based on matrix-analytic techniques and probabilistic arguments we develop a recursive method for the exact determination of the equilibrium joint queue length distribution. The method is applied to a spare parts logistics problem to illustrate the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3176","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":"1411.3176","created_at":"2026-05-18T01:27:08.061027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3176v3","created_at":"2026-05-18T01:27:08.061027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3176","created_at":"2026-05-18T01:27:08.061027+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETR5IYWJ3BXC","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETR5IYWJ3BXCYE3S","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETR5IYWJ","created_at":"2026-05-18T12:28:28.263976+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/ETR5IYWJ3BXCYE3STOIXTGV6JF","json":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF.json","graph_json":"https://pith.science/api/pith-number/ETR5IYWJ3BXCYE3STOIXTGV6JF/graph.json","events_json":"https://pith.science/api/pith-number/ETR5IYWJ3BXCYE3STOIXTGV6JF/events.json","paper":"https://pith.science/paper/ETR5IYWJ"},"agent_actions":{"view_html":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF","download_json":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF.json","view_paper":"https://pith.science/paper/ETR5IYWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3176&json=true","fetch_graph":"https://pith.science/api/pith-number/ETR5IYWJ3BXCYE3STOIXTGV6JF/graph.json","fetch_events":"https://pith.science/api/pith-number/ETR5IYWJ3BXCYE3STOIXTGV6JF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/action/storage_attestation","attest_author":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/action/author_attestation","sign_citation":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/action/citation_signature","submit_replication":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/action/replication_record"}},"created_at":"2026-05-18T01:27:08.061027+00:00","updated_at":"2026-05-18T01:27:08.061027+00:00"}