{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ETR5IYWJ3BXCYE3STOIXTGV6JF","short_pith_number":"pith:ETR5IYWJ","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"},"canonical_sha256":"24e3d462c9d86e2c13729b91799abe49431c607d41b1785e22c11a66b744e529","source":{"kind":"arxiv","id":"1411.3176","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3176","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3176v3","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3176","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"ETR5IYWJ3BXC","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETR5IYWJ3BXCYE3S","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETR5IYWJ","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ETR5IYWJ3BXCYE3STOIXTGV6JF","target":"record","payload":{"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"},"canonical_sha256":"24e3d462c9d86e2c13729b91799abe49431c607d41b1785e22c11a66b744e529","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"},"source_kind":"arxiv","source_id":"1411.3176","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:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5I1RO+vLqJjTUh0VHIex3CDW77PQEjX6ahuFZBDOHAd2vR9WBDP46pDxUOEq4rKAiVKe5+MK+i5y1KtQYZfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:29:50.065829Z"},"content_sha256":"0b25ce27ef85debb81a56310c901fdd09f9ae91ddacb5201b47ef26807cfb9e9","schema_version":"1.0","event_id":"sha256:0b25ce27ef85debb81a56310c901fdd09f9ae91ddacb5201b47ef26807cfb9e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ETR5IYWJ3BXCYE3STOIXTGV6JF","target":"graph","payload":{"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"},"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:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YjrVnnb/ghDrvhCMw+SEF7C5T1ZCHLlDetnTOhJjEuzUtQeT78iBX4LsjjMJ6AyF8iMA4JE6xTtUsn3EhGiFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:29:50.066204Z"},"content_sha256":"144b97d485f6465ad9a92179e4b5b306119eeae25999efcdd0c1b2bd5294edeb","schema_version":"1.0","event_id":"sha256:144b97d485f6465ad9a92179e4b5b306119eeae25999efcdd0c1b2bd5294edeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/bundle.json","state_url":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/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-24T19:29:50Z","links":{"resolver":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF","bundle":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/bundle.json","state":"https://pith.science/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETR5IYWJ3BXCYE3STOIXTGV6JF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ETR5IYWJ3BXCYE3STOIXTGV6JF","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":"fb54d608c912faa099604b381ffb6b22732c5beac17649fa2c3c06d2fc266161","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T13:52:52Z","title_canon_sha256":"33638b1ee1a22b43f87f153e7e12c49b8814bbfeaa55fe0e9f49fbcd4d8e0251"},"schema_version":"1.0","source":{"id":"1411.3176","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3176","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3176v3","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3176","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"ETR5IYWJ3BXC","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ETR5IYWJ3BXCYE3S","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ETR5IYWJ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:144b97d485f6465ad9a92179e4b5b306119eeae25999efcdd0c1b2bd5294edeb","target":"graph","created_at":"2026-05-18T01:27:08Z","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":"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","authors_text":"Andrei Sleptchenko, Geert-Jan van Houtum, Ivo Adan, Jori Selen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T13:52:52Z","title":"Joint queue length distribution of multi-class, single server queues with preemptive priorities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3176","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:0b25ce27ef85debb81a56310c901fdd09f9ae91ddacb5201b47ef26807cfb9e9","target":"record","created_at":"2026-05-18T01:27:08Z","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":"fb54d608c912faa099604b381ffb6b22732c5beac17649fa2c3c06d2fc266161","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T13:52:52Z","title_canon_sha256":"33638b1ee1a22b43f87f153e7e12c49b8814bbfeaa55fe0e9f49fbcd4d8e0251"},"schema_version":"1.0","source":{"id":"1411.3176","kind":"arxiv","version":3}},"canonical_sha256":"24e3d462c9d86e2c13729b91799abe49431c607d41b1785e22c11a66b744e529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24e3d462c9d86e2c13729b91799abe49431c607d41b1785e22c11a66b744e529","first_computed_at":"2026-05-18T01:27:08.060905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:08.060905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EoiOlcvRQbLgBOz9RXmY8pkah+VzfWs0qMT1uvk2+rk8EEhFmr7Jz10HLkKdVPocwfC/0WbnKinZN5kc59WtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:08.061601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3176","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b25ce27ef85debb81a56310c901fdd09f9ae91ddacb5201b47ef26807cfb9e9","sha256:144b97d485f6465ad9a92179e4b5b306119eeae25999efcdd0c1b2bd5294edeb"],"state_sha256":"20cd718ffaf27d095640b6f8eaaa2f9242ed9cd1f123d585d58202a93b21bfcb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFl3Pn0ax1w4wP1gAEBL07hzR40b1iF1HUDb5sV+Z7kzEgFU640E1trQFQY/akE3bynJo5gkNv6N2MhbljafAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:29:50.068185Z","bundle_sha256":"a7a282657deeacce677f6c902d86d12f6d92d19593b91d56d9d7aac7aa68f4f2"}}